Mitigating algorithmic errors in quantum optimization through energy extrapolation

Abstract

Quantum optimization algorithms offer a promising route to finding the ground states of target Hamiltonians on near-term quantum devices. None the less, it remains necessary to limit the evolution time and circuit depth as much as possible, since otherwise decoherence will degrade the computation. And even where this is done, there always exists a non-negligible error in estimates of the ground state energy. Here we present a scalable extrapolation approach to mitigating this error, which significantly improves estimates obtained using three of the most popular optimization algorithms: quantum annealing (QA), the variational quantum eigensolver (VQE), and quantum imaginary time evolution (QITE), at fixed evolution time or circuit depth. The approach is based on extrapolating the annealing time to infinity, or the variance of estimates to zero. The method is reasonably robust against noise, and for Hamiltonians which only involve few-body interactions, the additional computational overhead is an increase in the number of measurements by a constant factor. Analytic derivations are provided for the quadratic convergence of estimates of energy as a function of time in QA, and the linear convergence of estimates as a function of variance in all three algorithms. We have verified the validity of these approaches through both numerical simulation and experiments on an IBM quantum computer. This work suggests a promising new way to enhance near-term quantum computing through classical post-processing.

16 pages, 9 figures

References in corpus (15)

• A Quantum Approximate Optimization Algorithm
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Efficient estimation of Pauli observables by derandomization
• Fundamental limits of quantum error mitigation
• Digital quantum simulation of open quantum systems using quantum imaginary time evolution
• Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors
• Novel Extrapolation Method in the Monte Carlo Shell Model
• Why and when is pausing beneficial in quantum annealing?
• Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
• Variational procedure for nuclear shell-model calculations and energy-variance extrapolation
• Quantum imaginary time evolution steered by reinforcement learning
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation
• Quantum variational learning for quantum error-correcting codes
• Improving the accuracy of the energy estimation by combining quantum annealing with classical computation

Cited by in corpus (13)

• Quantum Error Mitigation
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Quantum variational learning for quantum error-correcting codes
• Accelerated variational quantum eigensolver with joint Bell measurement
• Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm
• Mitigating Quantum Errors via Truncated Neumann Series
• Learning quantum phases via single-qubit disentanglement
• Warm Start Adaptive-Bias Quantum Approximate Optimization Algorithm
• Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm
• Low Depth Virtual Distillation of Quantum Circuits by Deterministic Circuit Decomposition
• Exploiting many-body localization for scalable variational quantum simulation
• Hardware-efficient quantum annealing with error mitigation via classical shadow
• Unraveling Rodeo Algorithm Through the Zeeman Model