Mitigating algorithmic errors in quantum optimization through energy extrapolation
arXiv:2109.08132 · doi:10.1088/2058-9565/ac969c
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.
arXiv comment16 pages, 9 figures
References in corpus (56)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum Annealing in the Transverse Ising Model
- Barren plateaus in quantum neural network training landscapes
- A Quantum Approximate Optimization Algorithm
- Quantum computational chemistry
- Adiabatic Quantum Computing
- Error mitigation for short-depth quantum circuits
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Extending the computational reach of a noisy superconducting quantum processor
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Hartree-Fock on a superconducting qubit quantum computer
- Towards Practical Quantum Variational Algorithms
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Efficient variational quantum simulator incorporating active error minimisation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Variational ansatz-based quantum simulation of imaginary time evolution
- Practical Quantum Error Mitigation for Near-Future Applications
- Quantum autoencoders for efficient compression of quantum data
- Exponential suppression of bit or phase flip errors with repetitive error correction
- Generalized Lanczos Algorithm for Variational Quantum Monte Carlo
- Gapless spin-liquid phase in the kagome spin-1/2 Heisenberg antiferromagnet
- Subspace-search variational quantum eigensolver for excited states
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Maximum Likelihood, Minimum Effort
- Learning-based quantum error mitigation
- Effects of Backflow Correlation in the Three-Dimensional Electron Gas: Quantum Monte Carlo Study
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Virtual Distillation for Quantum Error Mitigation
- Efficient estimation of Pauli observables by derandomization
- Fundamental limits of quantum error mitigation
- Resource Efficient Zero Noise Extrapolation with Identity Insertions
- Digital quantum simulation of open quantum systems using quantum imaginary time evolution
- Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
- Exponential Error Suppression for Near-Term Quantum Devices
- Efficient variational simulation of non-trivial quantum states
- Quantum Computation of Finite-Temperature Static and Dynamical Properties of Spin Systems Using Quantum Imaginary Time Evolution
- Variational Quantum Fidelity Estimation
- Mitigating algorithmic errors in Hamiltonian simulation
- Residual Energies after Slow Quantum Annealing
- Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors
- Noise-Assisted Quantum Autoencoder
- 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
- Precise estimation of shell model energy by second order extrapolation method
- Simulating quench dynamics on a digital quantum computer with data-driven error mitigation
- Quantum variational learning for quantum error-correcting codes
- A variational quantum algorithm for Hamiltonian diagonalization
- 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