The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion

Abstract

Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. In general, the computational error reduction comes at the cost of a sampling overhead due to the variance-boosting effect caused by the channel inversion operation, which ultimately limits the applicability of QEM. Existing sampling overhead analysis of QEM typically assumes exact channel inversion, which is unrealistic in practical scenarios. In this treatise, we consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error that in turn may be eliminated at the cost of an extra sampling overhead. In particular, we show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates. By contrast, the error exhibits a linear scaling with the number of gates in the absence of QEM under the same assumptions. Hence, the error scaling of QEM remains to be preferable even without the extra sampling overhead. Our analytical results are accompanied by numerical examples.

References in corpus (26)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• A Quantum Approximate Optimization Algorithm
• Error mitigation for short-depth quantum circuits
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• A Theory of Fault-Tolerant Quantum Computation
• Scalable Quantum Simulation of Molecular Energies
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum optimization using variational algorithms on near-term quantum devices
• Practical Quantum Error Mitigation for Near-Future Applications
• Robust determination of molecular spectra on a quantum processor
• Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
• Resilient Quantum Computation: Error Models and Thresholds
• Layerwise learning for quantum neural networks
• Low-cost error mitigation by symmetry verification
• Stochastic gradient descent for hybrid quantum-classical optimization
• Variational algorithms for linear algebra
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Decoding quantum errors with subspace expansions
• Introduction to Quantum Gate Set Tomography
• Optimal resource cost for error mitigation
• Estimation of quantum channels with finite resources