Universal Sampling Lower Bounds for Quantum Error Mitigation
Abstract: Numerous quantum error-mitigation protocols have been proposed, motivated by the critical need to suppress noise effects on intermediate-scale quantum devices. Yet, their general potential and limitations remain elusive. In particular, to understand the ultimate feasibility of quantum error mitigation, it is crucial to characterize the fundamental sampling cost -- how many times an arbitrary mitigation protocol must run a noisy quantum device. Here, we establish universal lower bounds on the sampling cost for quantum error mitigation to achieve the desired accuracy with high probability. Our bounds apply to general mitigation protocols, including the ones involving nonlinear postprocessing and those yet-to-be-discovered. The results imply that the sampling cost required for a wide class of protocols to mitigate errors must grow exponentially with the circuit depth for various noise models, revealing the fundamental obstacles in the scalability of useful noisy near-term quantum devices.
- J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018).
- Y. Li and S. C. Benjamin, Efficient variational quantum simulator incorporating active error minimization, Phys. Rev. X 7, 021050 (2017).
- W. G. Unruh, Maintaining coherence in quantum computers, Phys. Rev. A 51, 992 (1995).
- B. Koczor, Exponential error suppression for near-term quantum devices, Phys. Rev. X 11, 031057 (2021).
- M. Huo and Y. Li, Dual-state purification for practical quantum error mitigation, Phys. Rev. A 105, 022427 (2022).
- Z. Cai, Quantum Error Mitigation using Symmetry Expansion, Quantum 5, 548 (2021a).
- Z. Cai, Multi-exponential error extrapolation and combining error mitigation techniques for NISQ applications, npj Quantum Inf. 7, 80 (2021b).
- S. Carnot, Reflections on the motive power of fire, and on machines fitted to develop that power, Paris: Bachelier 108, 1824 (1824).
- R. Landauer, Irreversibility and heat generation in the computing process, IBM J. Res. Dev. 5, 183 (1961).
- B. Regula and R. Takagi, Fundamental limitations on distillation of quantum channel resources, Nat. Commun. 12, 4411 (2021).
- K. Fang and Z.-W. Liu, No-go theorems for quantum resource purification: New approach and channel theory, PRX Quantum 3, 010337 (2022).
- D. Stilck França and R. GarcÃa-Patrón, Limitations of optimization algorithms on noisy quantum devices, Nat. Phys. 17, 1221 (2021).
- L. Viola and S. Lloyd, Dynamical suppression of decoherence in two-state quantum systems, Phys. Rev. A 58, 2733 (1998).
- R. Takagi, Optimal resource cost for error mitigation, Phys. Rev. Research 3, 033178 (2021).
- C. Fuchs and J. van de Graaf, Cryptographic distinguishability measures for quantum-mechanical states, IEEE Trans. Inf. Theory 45, 1216 (1999).
- M. J. Kastoryano and K. Temme, Quantum logarithmic sobolev inequalities and rapid mixing, J. Math. Phys. 54, 052202 (2013).
- M. Hayashi, Quantum Information Theory: Mathematical Foundation (Springer, 2016).
- K. M. R. Audenaert and J. Eisert, Continuity bounds on the quantum relative entropy, J. Math. Phys. 46, 102104 (2005).
- R. Carbone and A. Martinelli, Logarithmic sobolev inequalities in non-commutative algebras, Infin. Dimens. Anal. Quantum Probab. Relat. Top. 18, 1550011 (2015).
- M. J. Kastoryano and F. G. S. L. Brandão, Quantum Gibbs Samplers: The Commuting Case, Commun. Math. Phys. 344, 915 (2016).
- K. Temme and M. J. Kastoryano, How fast do stabilizer Hamiltonians thermalize? arXiv:1505.07811 (2015).
- Qiskit: Device backend noise model simulations, .
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.