Error propagation in NISQ devices for solving classical optimization problems

Abstract

We propose a random circuit model to analyze the impact of noise on the performance of variational quantum circuits for classical optimization problems. Our model accounts for the propagation of arbitrary single qubit errors through the circuit. We find that even with a small noise rate, the quality of the obtained classical optima is low on average and a single-qubit error rate of $1/nD$, where $n$ is the number of qubits and $D$ is the circuit depth, is needed for the possibility of a quantum advantage. We estimate that this translates to an error rate lower than $10^{-6}$ using QAOA for classical optimization problems with 2D circuits.

arXiv comment19 pages, 5 figures

References in corpus (25)

• 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
• Variational Quantum Algorithms
• Quantum Annealing in the Transverse Ising Model
• Quantum computational advantage using photons
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Adiabatic Quantum Computing
• Characterizing Quantum Supremacy in Near-Term Devices
• Strong quantum computational advantage using a superconducting quantum processor
• Towards Practical Quantum Variational Algorithms
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Quantum Annealing: A New Method for Minimizing Multidimensional Functions
• Scalable Noise Estimation with Random Unitary Operators
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• Variational quantum algorithms for discovering Hamiltonian spectra
• Reachability Deficits in Quantum Approximate Optimization
• Capacity and quantum geometry of parametrized quantum circuits
• Filtering variational quantum algorithms for combinatorial optimization
• Expressibility of the alternating layered ansatz for quantum computation
• Many-body physics in the NISQ era: quantum programming a discrete time crystal
• Calculation of the Green's function on near-term quantum computers
• Characterizing local noise in QAOA circuits

Cited by in corpus (19)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Exponentially tighter bounds on limitations of quantum error mitigation
• Recommending Solution Paths for Solving Optimization Problems with Quantum Computing
• Simulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization
• Integration of Quantum Accelerators with High Performance Computing -- A Review of Quantum Programming Tools
• Pauli path simulations of noisy quantum circuits beyond average case
• Statistical Mechanics of Monitored Dissipative Random Circuits
• Accuracy guarantees and quantum advantage in analogue open quantum simulation with and without noise
• Emergence of noise-induced barren plateaus in arbitrary layered noise models
• Performance of Quantum Approximate Optimization with Quantum Error Detection
• Lattice Hamiltonians and Stray Interactions Within Quantum Processors
• Modelling noise in global Molmer-Sorensen interactions applied to quantum approximate optimization
• Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
• Constant Depth Code Deformations in the Parity Architecture
• Quantum machine learning for multiclass classification beyond kernel methods
• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
• Shot-noise reduction for lattice Hamiltonians
• Dynamical complexity of non-Gaussian many-body systems with dissipation
• Bounded-Error Quantum Simulation via Hamiltonian and Lindbladian Learning