Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

  • Article
  • Published:

Protecting expressive circuits with a quantum error detection code

Abstract

A successful quantum error correction protocol would allow quantum computers to run algorithms without suffering from the effects of noise. However, fully fault-tolerant quantum error correction is too resource intensive for existing quantum computers. In this context, we develop a quantum error detection code for implementations on existing trapped-ion computers. By encoding k logical qubits into k + 2 physical qubits, this code presents fault-tolerant state-initialization and syndrome-measurement circuits that can detect any single-qubit error. It provides a universal set of local and global logical rotations that have physical support on only two qubits. A high-fidelity—although non fault-tolerant—compilation of this universal gate set is possible thanks to the two-qubit physical rotations present in trapped-ion computers with all-to-all connectivity. Given the particular structure of the logical operators, we nickname it the Iceberg code. We demonstrate the protection of circuits of eight logical qubits with up to 256 layers, saturate the logical quantum volume of 28 and show the positive effect of increasing the frequency of syndrome measurements in the circuit. These results illustrate the practical usefulness of the Iceberg code to protect expressive circuits on existing trapped-ion quantum computers.

This is a preview of subscription content, access via your institution

Access options

Buy this article

Prices may be subject to local taxes which are calculated during checkout

Fig. 1: Logical operators and fault-tolerant operations of the Iceberg code.
Fig. 2: Comparing the performance of a random mirror circuit encoded with the Iceberg code against the unencoded circuit.
Fig. 3: Numerical simulations of the performance of random mirror circuits for more logical qubits.
Fig. 4: Passing a QV test with eight logical qubits using the Iceberg code.

Similar content being viewed by others

Data availability

The data that support the findings of this study are available at Zenodo45. Source data are provided with this paper.

Code availability

Code to reproduce the findings of this study is available from the corresponding authors on reasonable request.

References

  1. Gottesman, D. An introduction to quantum error correction and fault-tolerant quantum computation. Proc. Sym. Ap. 68, 13–58 (2010).

  2. Lidar, D. A. & Brun, T. A. Quantum Error Correction (Cambridge Univ. Press, 2013).

  3. Orzel, C. Quantum Simulation (IOP, 2017).

  4. Harrow, A. W., Hassidim, A. & Lloyd, S. Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009).

    Article  MathSciNet  PubMed  ADS  Google Scholar 

  5. Shor, P. W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Comput. 26, 1484–1509 (1997).

  6. Gidney, C. & Ekerå, M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433–464 (2021).

  7. Allcock, J. et al. The prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer. Front. Drug Discov. 2, 908870 (2022).

  8. Chen, Z. et al. Exponential suppression of bit or phase errors with cyclic error correction. Nature 595, 383–387 (2021).

  9. Ryan-Anderson, C. et al. Realization of real-time fault-tolerant quantum error correction. Phys. Rev. X 11, 041058 (2021).

    CAS  Google Scholar 

  10. Acharya, R. et al. Suppressing quantum errors by scaling a surface code logical qubit. Nature 614, 676–681 (2023).

  11. Postler, L. et al. Demonstration of fault-tolerant universal quantum gate operations. Nature 605, 675–680 (2022).

  12. Ryan-Anderson, C. et al. Implementing fault-tolerant entangling gates on the five-qubit code and the color code. Preprint at https://doi.org/10.48550/ARXIV.2208.01863 (2022).

  13. Suzuki, Y., Endo, S., Fujii, K. & Tokunaga, Y. Quantum error mitigation as a universal error reduction technique: applications from the nisq to the fault-tolerant quantum computing eras. PRX Quantum 3, 010345 (2022).

  14. Cirac, J. I. & Zoller, P. Goals and opportunities in quantum simulation. Nat. Phys. 8, 264–266 (2012).

  15. Harrow, A. W. & Montanaro, A. Quantum computational supremacy. Nature 549, 203–209 (2017).

  16. Lund, A. P., Bremner, M. J. & Ralph, T. C. Quantum sampling problems, BosonSampling and quantum supremacy. npj Quantum Inf. 3, 15 (2017).

    Article  ADS  Google Scholar 

  17. Knill, E. Fault-tolerant postselected quantum computation: schemes. Preprint at https://doi.org/10.48550/ARXIV.QUANT-PH/0402171 (2004).

  18. Knill, E. Fault-tolerant postselected quantum computation: threshold analysis. Preprint at https://doi.org/10.48550/ARXIV.QUANT-PH/0404104 (2004).

  19. Urbanek, M., Nachman, B. & de Jong, W. A. Error detection on quantum computers improving the accuracy of chemical calculations. Phys. Rev. A 102, 022427 (2020).

    Article  CAS  ADS  Google Scholar 

  20. Schindler, P. et al. A quantum information processor with trapped ions. New J. Phys. 15, 123012 (2013).

    Article  ADS  Google Scholar 

  21. Bruzewicz, C. D., Chiaverini, J., McConnell, R. & Sage, J. M. Trapped-ion quantum computing: progress and challenges. Appl. Phys. Rev. 6, 021314 (2019).

    Article  ADS  Google Scholar 

  22. Grassl, M., Beth, T. & Rötteler, M. On optimal quantum codes. Int. J. Quantum Inf. 02, 55–64 (2004).

  23. Chao, R. & Reichardt, B. W. Fault-tolerant quantum computation with few qubits. npj Quantum Inf. 4, 42 (2018).

    Article  ADS  Google Scholar 

  24. Gidney, C. Cleaner magic states with hook injection. Preprint at https://doi.org/10.48550/arXiv.2302.12292 (2023).

  25. Mølmer, K. & Sørensen, A. Multiparticle entanglement of hot trapped ions. Phys. Rev. Lett. 82, 1835 (1999).

    Article  ADS  Google Scholar 

  26. System Model H1 powered by Honeywell. Quantinuum https://www.quantinuum.com/hardware/h1 (2022).

  27. Pino, J. M. et al. Demonstration of the trapped-ion quantum ccd computer architecture. Nature 592, 209–213 (2021).

  28. Linke, N. M. et al. Fault-tolerant quantum error detection. Sci. Adv. 3, e1701074 (2017).

    Article  PubMed  PubMed Central  ADS  Google Scholar 

  29. Hines, J. et al. Demonstrating scalable randomized benchmarking of universal gate sets. Preprint at https://doi.org/10.48550/ARXIV.2207.07272 (2022).

  30. Proctor, T. et al. Scalable randomized benchmarking of quantum computers using mirror circuits. Phys. Rev. Lett. 129, 150502 (2022).

    Article  CAS  PubMed  ADS  Google Scholar 

  31. Chao, R. & Reichardt, B. W. Quantum error correction with only two extra qubits. Phys. Rev. Lett. 121, 050502 (2018).

    Article  CAS  PubMed  ADS  Google Scholar 

  32. Proctor, T., Rudinger, K., Young, K., Nielsen, E. & Blume-Kohout, R. Measuring the capabilities of quantum computers. Nat. Phys. 18, 75–79 (2021).

  33. Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D. & Gambetta, J. M. Validating quantum computers using randomized model circuits. Phys. Rev. A 100, 032328 (2019).

    Article  CAS  ADS  Google Scholar 

  34. Baldwin, C. H., Mayer, K., Brown, N. C., Ryan-Anderson, C. & Hayes, D. Re-examining the quantum volume test: ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations. Quantum 6, 707–736 (2022).

  35. Qiskit Python package v.0.37.0, v.0.37.2, v.0.38.0. Qiskit Contributors https://pypi.org/project/qiskit/ (2022).

  36. Itoko, T. & Imamichi, T. Scheduling of operations in quantum compiler. In 2020 IEEE International Conference on Quantum Computing and Engineering 337–344 (IEEE Computer Society, 2020).

  37. Gokhale, P. et al. Quantum fan-out: circuit optimizations and technology modeling. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) 276–290 (IEEE Computer Society, 2021).

  38. Lao, L. & Browne, D. E. 2QAN: a quantum compiler for 2-local qubit Hamiltonian simulation algorithms. In Proc. 49th Annual International Symposium on Computer Architecture 351–365 (Association for Computing Machinery, 2022).

  39. Nannicini, G., Bishop, L. S., Gunluk, O. & Jurcevic, P. Optimal qubit assignment and routing via integer programming. ACM Transactions on Quantum Computing 4, 7 (2022).

  40. Stricker, R. et al. Experimental deterministic correction of qubit loss. Nature 585, 207–210 (2020).

  41. Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. Preprint at https://doi.org/10.48550/ARXIV.1411.4028 (2014).

  42. Amaro, D. et al. Filtering variational quantum algorithms for combinatorial optimization. Quantum Sci. Technol. 7, 015021 (2022).

    Article  ADS  Google Scholar 

  43. Benedetti, M., Lloyd, E., Sack, S. & Fiorentini, M. Parameterized quantum circuits as machine learning models. Quantum Sci. Technol. 4, 043001 (2019).

    Article  ADS  Google Scholar 

  44. van de Wetering, J. Constructing quantum circuits with global gates. New J. Phys. 23, 043015 (2021).

    Article  MathSciNet  Google Scholar 

  45. Self, C., Benedetti, M. & Amaro, D. Research data supporting ‘Protecting expressive circuits with a quantum error detection code’. Zenodo https://doi.org/10.5281/zenodo.8318683 (2023).

Download references

Acknowledgements

We thank C. Ryan-Anderson, N. Burdick, B. Neyenhuis, C. Baldwin, Y. Kikuchi, M. Fiorentini, D. Hayes, K. Mayer and Y.H. Chen for fruitful discussions and feedback on the manuscript. The experiments were done using the Quantinuum system model H1-2, powered by Honeywell ion traps.

Author information

Authors and Affiliations

Authors

Contributions

All authors conceived and designed the study. D.A. performed analytic calculations and C.N.S. carried out numerical studies. All authors analysed the data, interpreted the results and wrote the manuscript.

Corresponding authors

Correspondence to Chris N. Self, Marcello Benedetti or David Amaro.

Ethics declarations

Competing interests

The authors declare no competing interests.

Peer review

Peer review information

Nature Physics thanks Crystal Noel and the other, anonymous, reviewer(s) for their contribution to the peer review of this work.

Additional information

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary information

Supplementary Information

Supplementary Figs. 1–5, details about experiments and simulations, and references.

Supplementary Data 1

Statistical source data for Supplementary Fig. 1.

Supplementary Data 2

Statistical source data for Supplementary Fig. 3.

Supplementary Data 3

Statistical source data for Supplementary Fig. 5.

Source data

Source Data Fig. 2

Statistical source data.

Source Data Fig. 3

Statistical source data.

Source Data Fig. 4

Statistical source data.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Self, C.N., Benedetti, M. & Amaro, D. Protecting expressive circuits with a quantum error detection code. Nat. Phys. 20, 219–224 (2024). https://doi.org/10.1038/s41567-023-02282-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1038/s41567-023-02282-2

This article is cited by

Search

Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing