Error Analysis of the Variational Quantum Eigensolver Algorithm
arXiv:2301.07263 · doi:10.1109/NANOARCH53687.2021.9642249
Abstract
Variational quantum algorithms have been one of the most intensively studied applications for near-term quantum computing applications. The noisy intermediate-scale quantum (NISQ) regime, where small enough algorithms can be run successfully on noisy quantum computers expected during the next 5 years, is driving both a large amount of research work and a significant amount of private sector funding. Therefore, it is important to understand whether variational algorithms are effective at successfully converging to the correct answer in presence of noise. We perform a comprehensive study of the variational quantum eigensolver (VQE) and its individual quantum subroutines. Building on asymptotic bounds, we show through explicit simulation that the VQE algorithm effectively collapses already when single errors occur during a quantum processing call. We discuss the significant implications of this result in the context of being able to run any variational type algorithm without resource expensive error correction protocols.
References in corpus (24)
- Adam: A Method for Stochastic Optimization
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- The theory of variational hybrid quantum-classical algorithms
- Quantum Circuit Learning
- Simulated Quantum Computation of Molecular Energies
- Scalable Quantum Simulation of Molecular Energies
- Quantum Error Correction for Beginners
- Hartree-Fock on a superconducting qubit quantum computer
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Theory of variational quantum simulation
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Stochastic gradient descent for hybrid quantum-classical optimization
- Efficient quantum measurement of Pauli operators in the presence of finite sampling error
- Variational-State Quantum Metrology
- Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
- Accuracy and Resource Estimations for Quantum Chemistry on a Near-term Quantum Computer
- Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
- Error detection on quantum computers improves accuracy of chemical calculations
- Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits
- Reinforcement learning for semi-autonomous approximate quantum eigensolver
- Forecasting timelines of quantum computing
- Effects of Quantum Noise on Quantum Approximate Optimization Algorithm