- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Robust error accumulation suppression for quantum circuits

Tatsuki Odake1, Philip Taranto2,1, Nobuyuki Yoshioka3, Toshinari Itoko4, Kunal Sharma5, Antonio Mezzacapo5, and Mio Murao1,*

  • *Contact author: murao@phys.s.u-tokyo.ac.jp
PDF

Phys. Rev. Research 7, 033029 – Published 8 July, 2025

DOI: https://doi.org/10.1103/yx9t-nctk

Abstract

We present a robust error accumulation suppression (REAS) technique to manage errors in quantum computers. Our method reduces the accumulation of errors in any quantum circuit composed of single- or two-qubit gates expressed as e−iσθ for Pauli operators σ and θ∈[0,π), which forms a universal gate set. For coherent errors, which include gate overrotation and crosstalk, we demonstrate a reduction of the error scaling in an L-depth circuit from O(L) to O(L). This asymptotic error suppression behavior can be proven in a regime where all gates, including those constituting the error-suppressing protocol itself, are noisy. Going beyond coherent errors, we derive the general form of decoherence noise that can be suppressed by REAS. Lastly, we experimentally demonstrate the effectiveness of our approach regarding realistic errors using 100-qubit circuits with up to 64 two-qubit gate layers on IBM Quantum processors.

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (57)

  1. D. Aharonov, M. Ben-Or, R. Impagliazzo, and N. Nisan, Limitations of noisy reversible computation, arXiv:quant-ph/9611028.
  2. P. W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (IEEE Computer Society, Washington, DC, 1994), p. 124.
  3. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26, 1484 (1997).
  4. A. Acín, I. Bloch, H. Buhrman, T. Calarco, C. Eichler, J. Eisert, D. Esteve, N. Gisin, S. J. Glaser, F. Jelezko, S. Kuhr, M. Lewenstein, M. F. Riedel, P. O. Schmidt, R. Thew, A. Wallraff, I. Walmsley, and F. K. Wilhelm, The quantum technologies roadmap: A European community view, New J. Phys. 20, 080201 (2018).
  5. D. D. Awschalom, H. Bernien, R. Brown, A. Clerk, E. Chitambar, A. Dibos, J. Dionne, M. Eriksson, B. Fefferman, G. D. Fuchs, J. Gambetta, E. Goldschmidt, S. Guha, F. J. Heremans, K. D. Irwin, A. B. Jayich, L. Jiang, J. Karsch, M. Kasevich, S. Kolkowitz et al., A roadmap for quantum interconnects, Technical Report ANL-22/83; 179439, Argonne National Laboratory, Argonne, IL, 2022.
  6. P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A 52, R2493 (1995).
  7. A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098 (1996).
  8. A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77, 793 (1996).
  9. R. Laflamme, C. Miquel, J. P. Paz, and W. H. Zurek, Perfect quantum error correcting code, Phys. Rev. Lett. 77, 198 (1996).
  10. B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87, 307 (2015).
  11. R. Acharya et al. (Google Quantum AI and collaborators), Quantum error correction below the surface code threshold, Nature (London) 638, 920 (2025).
  12. K. Temme, S. Bravyi, and J. M. Gambetta, Error mitigation for short-depth quantum circuits, Phys. Rev. Lett. 119, 180509 (2017).
  13. Y. Li and S. C. Benjamin, Efficient variational quantum simulator incorporating active error minimization, Phys. Rev. X 7, 021050 (2017).
  14. S. Endo, S. C. Benjamin, and Y. Li, Practical quantum error mitigation for near-future applications, Phys. Rev. X 8, 031027 (2018).
  15. B. Koczor, Exponential error suppression for near-term quantum devices, Phys. Rev. X 11, 031057 (2021).
  16. W. J. Huggins, S. McArdle, T. E. O'Brien, J. Lee, N. C. Rubin, S. Boixo, K. B. Whaley, R. Babbush, and J. R. McClean, Virtual distillation for quantum error mitigation, Phys. Rev. X 11, 041036 (2021).
  17. N. Yoshioka, H. Hakoshima, Y. Matsuzaki, Y. Tokunaga, Y. Suzuki, and S. Endo, Generalized quantum subspace expansion, Phys. Rev. Lett. 129, 020502 (2022).
  18. H. Hakoshima, S. Endo, K. Yamamoto, Y. Matsuzaki, and N. Yoshioka, Localized virtual purification, Phys. Rev. Lett. 133, 080601 (2024).
  19. Z. Cai, R. Babbush, S. C. Benjamin, S. Endo, W. J. Huggins, Y. Li, J. R. McClean, and T. E. O'Brien, Quantum error mitigation, Rev. Mod. Phys. 95, 045005 (2023).
  20. A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets, Nature (London) 549, 242 (2017).
  21. A. Kandala, K. Temme, A. D. Córcoles, A. Mezzacapo, J. M. Chow, and J. M. Gambetta, Error mitigation extends the computational reach of a noisy quantum processor, Nature (London) 567, 491 (2019).
  22. Y. Kim, C. J. Wood, T. J. Yoder, S. T. Merkel, J. M. Gambetta, K. Temme, and A. Kandala, Scalable error mitigation for noisy quantum circuits produces competitive expectation values, Nat. Phys. 19, 752 (2023).
  23. Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Evidence for the utility of quantum computing before fault tolerance, Nature (London) 618, 500 (2023).
  24. K. Tsubouchi, T. Sagawa, and N. Yoshioka, Universal cost bound of quantum error mitigation based on quantum estimation theory, Phys. Rev. Lett. 131, 210601 (2023).
  25. R. Takagi, H. Tajima, and M. Gu, Universal sampling lower bounds for quantum error mitigation, Phys. Rev. Lett. 131, 210602 (2023).
  26. Y. Quek, D. Stilck França, S. Khatri, J. J. Meyer, and J. Eisert, Exponentially tighter bounds on limitations of quantum error mitigation, Nat. Phys. 20, 1648 (2024).
  27. L. Viola, E. Knill, and S. Lloyd, Dynamical decoupling of open quantum systems, Phys. Rev. Lett. 82, 2417 (1999).
  28. M. B. Hastings, Turning gate synthesis errors into incoherent errors, Quantum Inf. Comput. 17, 488 (2017).
  29. E. Campbell, Shorter gate sequences for quantum computing by mixing unitaries, Phys. Rev. A 95, 042306 (2017).
  30. S. Akibue, G. Kato, and S. Tani, Probabilistic state synthesis based on optimal convex approximation, npj Quantum Inf. 10, 3 (2024).
  31. W. Dür, M. Hein, J. I. Cirac, and H.-J. Briegel, Standard forms of noisy quantum operations via depolarization, Phys. Rev. A 72, 052326 (2005).
  32. E. Magesan, J. M. Gambetta, and J. Emerson, Scalable and robust randomized benchmarking of quantum processes, Phys. Rev. Lett. 106, 180504 (2011).
  33. M. R. Geller and Z. Zhou, Efficient error models for fault-tolerant architectures and the Pauli twirling approximation, Phys. Rev. A 88, 012314 (2013).
  34. J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Phys. Rev. A 94, 052325 (2016).
  35. J. Hines, M. Lu, R. K. Naik, A. Hashim, J.-L. Ville, B. Mitchell, J. M. Kriekebaum, D. I. Santiago, S. Seritan, E. Nielsen, R. Blume-Kohout, K. Young, I. Siddiqi, B. Whaley, and T. Proctor, Demonstrating scalable randomized benchmarking of universal gate sets, Phys. Rev. X 13, 041030 (2023).
  36. J. dos Santos, B. Bar, and R. Uzdin, Deeper quantum circuits via pseudo-twirling coherent errors mitigation in non-Clifford gates, arXiv:2401.09040.
  37. Y. Akahoshi, K. Maruyama, H. Oshima, S. Sato, and K. Fujii, Partially fault-tolerant quantum computing architecture with error-corrected Clifford gates and space-time efficient analog rotations, PRX Quantum 5, 010337 (2024).
  38. A. Hashim, R. K. Naik, A. Morvan, J.-L. Ville, B. Mitchell, J. M. Kreikebaum, M. Davis, E. Smith, C. Iancu, K. P. O'Brien, I. Hincks, J. J. Wallman, J. Emerson, and I. Siddiqi, Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor, Phys. Rev. X 11, 041039 (2021).
  39. J.-L. Ville, A. Morvan, A. Hashim, R. K. Naik, M. Lu, B. Mitchell, J.-M. Kreikebaum, K. P. O'Brien, J. J. Wallman, I. Hincks, J. Emerson, E. Smith, E. Younis, C. Iancu, D. I. Santiago, and I. Siddiqi, Leveraging randomized compiling for the quantum imaginary-time-evolution algorithm, Phys. Rev. Res. 4, 033140 (2022).
  40. S. Ferracin, A. Hashim, J.-L. Ville, R. Naik, A. Carignan-Dugas, H. Qassim, A. Morvan, D. I. Santiago, I. Siddiqi, and J. J. Wallman, Efficiently improving the performance of noisy quantum computers, Quantum 8, 1410 (2024).
  41. T. Kurita, H. Qassim, M. Ishii, H. Oshima, S. Sato, and J. Emerson, Synergetic quantum error mitigation by randomized compiling and zero-noise extrapolation for the variational quantum eigensolver, Quantum 7, 1184 (2023).
  42. N. Goss, S. Ferracin, A. Hashim, A. Carignan-Dugas, J. M. Kreikebaum, R. K. Naik, D. I. Santiago, and I. Siddiqi, Extending the computational reach of a superconducting qutrit processor, arXiv:2305.16507.
  43. N. Sundaresan, I. Lauer, E. Pritchett, E. Magesan, P. Jurcevic, and J. M. Gambetta, Reducing unitary and spectator errors in cross resonance with optimized rotary echoes, PRX Quantum 1, 020318 (2020).
  44. See Supplemental Material at http://link.aps.org/supplemental/10.1103/yx9t-nctk for technical details and proofs.
  45. S. Kimmel, G. H. Low, and T. J. Yoder, Robust calibration of a universal single-qubit gate set via robust phase estimation, Phys. Rev. A 92, 062315 (2015).
  46. B. L. Higgins, D. W. Berry, S. D. Bartlett, M. W. Mitchell, H. M. Wiseman, and G. J. Pryde, Demonstrating Heisenberg-limited unambiguous phase estimation without adaptive measurements, New J. Phys. 11, 073023 (2009).
  47. C. Arenz, R. Hillier, M. Fraas, and D. Burgarth, Distinguishing decoherence from alternative quantum theories by dynamical decoupling, Phys. Rev. A 92, 022102 (2015).
  48. D. Layden, G. Mazzola, R. V. Mishmash, M. Motta, P. Wocjan, J.-S. Kim, and S. Sheldon, Quantum-enhanced Markov chain Monte Carlo, Nature (London) 619, 282 (2023).
  49. IBM Quantum, https://quantum.ibm.com.
  50. E. van den Berg, Z. K. Minev, and K. Temme, Model-free readout-error mitigation for quantum expectation values, Phys. Rev. A 105, 032620 (2022).
  51. G. A. L. White, C. D. Hill, F. A. Pollock, L. C. L. Hollenberg, and K. Modi, Demonstration of non-Markovian process characterisation and control on a quantum processor, Nat. Commun. 11, 6301 (2020).
  52. Y. Guo, P. Taranto, B.-H. Liu, X.-M. Hu, Y.-F. Huang, C.-F. Li, and G.-C. Guo, Experimental demonstration of instrument-specific quantum memory effects and non-Markovian process recovery for common-cause processes, Phys. Rev. Lett. 126, 230401 (2021).
  53. K. Goswami, C. Giarmatzi, C. Monterola, S. Shrapnel, J. Romero, and F. Costa, Experimental characterization of a non-Markovian quantum process, Phys. Rev. A 104, 022432 (2021).
  54. P. Figueroa-Romero, K. Modi, R. J. Harris, T. M. Stace, and M.-H. Hsieh, Randomized benchmarking for non-Markovian noise, PRX Quantum 2, 040351 (2021).
  55. P. Figueroa-Romero, K. Modi, and M.-H. Hsieh, Towards a general framework of randomized benchmarking incorporating non-Markovian noise, Quantum 6, 868 (2022).
  56. G. White, F. Pollock, L. Hollenberg, K. Modi, and C. Hill, non-Markovian quantum process tomography, PRX Quantum 3, 020344 (2022).
  57. G. A. L. White, K. Modi, and C. D. Hill, Filtering crosstalk from bath non-Markovianity via spacetime classical shadows, Phys. Rev. Lett. 130, 160401 (2023).

Outline

Information

Phys. Rev. Research 7, 033029– Published 8 July, 2025
  • Received 8 October 2024
  • Accepted 3 June 2025
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation