Limitations of optimization algorithms on noisy quantum devices

Abstract

Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is whether their noise can be overcome or it fundamentally restricts any potential quantum advantage. We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices for a large family of problems that include optimization problems and approximations to the ground state energy of Hamiltonians. Our approach is based on the combination of entropic inequalities that determine how fast the quantum computation state converges to the fixed point of the noise model, together with established classical methods of Gibbs state sampling. The approach is extremely versatile and allows for its application to a large variety of problems, noise models and quantum computing architectures. We use our result to provide estimates for a variety of problems and architectures that have been the focus of recent experiments, such as quantum annealers, variational quantum eigensolvers, and quantum approximate optimization. The bounds we obtain indicate that substantial quantum advantages are unlikely for classical optimization unless the current noise rates are decreased by orders of magnitude or the topology of the problem matches that of the device. This is the case even if the number of qubits increases substantially. We reach similar but less stringent conclusions for quantum Hamiltonian problems.

19 pages, 3 figures

References in corpus (7)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Numerical Linked-Cluster Approach to Quantum Lattice Models
• Decoherence in adiabatic quantum computation
• Approximating Gibbs states of local Hamiltonians efficiently with PEPS
• A Short Introduction to Numerical Linked-Cluster Expansions
• Robust entanglement renormalization on a noisy quantum computer

Cited by in corpus (11)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Theory of overparametrization in quantum neural networks
• Neural Predictor based Quantum Architecture Search
• How will quantum computers provide an industrially relevant computational advantage in quantum chemistry?
• Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
• Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
• Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries
• The modified logarithmic Sobolev inequality for quantum spin systems: classical and commuting nearest neighbour interactions
• A game of quantum advantage: linking verification and simulation
• Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA