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.

19 pages, 5 figures

References in corpus (3)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Strong quantum computational advantage using a superconducting quantum processor

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