The Dominant Eigenvector of a Noisy Quantum State

Abstract

Although near-term quantum devices have no comprehensive solution for correcting errors, numerous techniques have been proposed for achieving practical value. Two works have recently introduced the very promising Error Suppression by Derangements (ESD) and Virtual Distillation (VD) techniques. The approach exponentially suppresses errors and ultimately allows one to measure expectation values in the pure state as the dominant eigenvector of the noisy quantum state. Interestingly this dominant eigenvector is, however, different than the ideal computational state and it is the aim of the present work to comprehensively explore the following fundamental question: how significantly different are these two pure states? The motivation for this work is two-fold. First, comprehensively understanding the effect of this coherent mismatch is of fundamental importance for the successful exploitation of noisy quantum devices. As such, the present work rigorously establishes that in practically relevant scenarios the coherent mismatch is exponentially less severe than the incoherent decay of the fidelity -- where the latter can be suppressed exponentially via the ESD/VD technique. Second, the above question is closely related to central problems in mathematics, such as bounding eigenvalues of a sum of two matrices (Weyl inequalities) -- solving of which was a major breakthrough. The present work can be viewed as a first step towards extending the Weyl inequalities to eigenvectors of a sum of two matrices -- and completely resolves this problem for the special case of the considered density matrices.

32 pages, 7 figures

References in corpus (5)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• A Quantum Approximate Optimization Algorithm
• The Spectra of Density Operators and the Kronecker Coefficients of the Symmetric Group
• Qubit-efficient exponential suppression of errors

Cited by in corpus (23)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Error Mitigation
• Quantum advantage in learning from experiments
• Fundamental limits of quantum error mitigation
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Generalized quantum subspace expansion
• Purification-based quantum error mitigation of pair-correlated electron simulations
• Multicore Quantum Computing
• Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors
• Error-Mitigated Quantum Metrology via Virtual Purification
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• Unifying and benchmarking state-of-the-art quantum error mitigation techniques
• Scaling Quantum Approximate Optimization on Near-term Hardware
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
• Quantum Error Mitigation Relying on Permutation Filtering
• Algorithmic Shadow Spectroscopy
• Resource-efficient Purification-based Quantum Error Mitigation
• Quantum Error Mitigation via Quantum-Noise-Effect Circuit Groups
• Mitigating Quantum Errors via Truncated Neumann Series
• A Practical Framework for Quantum Error Mitigation
• Improving the efficiency of learning-based error mitigation
• Study of noise in virtual distillation circuits for quantum error mitigation