Noise-induced shallow circuits and absence of barren plateaus
arXiv:2403.13927 · doi:10.1038/s41567-026-03245-z
Abstract
Motivated by realistic hardware considerations of the pre-fault-tolerant era, we comprehensively study the impact of uncorrected noise on quantum circuits. We first show that in the task of estimating observable expectation values any noise truncates most quantum circuits to effectively logarithmic depth. We then prove that quantum circuits under any non-unital noise do not exhibit barren plateaus for cost functions composed of local observables. However, by using the effective shallowness, we also design an efficient classical algorithm to estimate observable expectation values within any constant additive accuracy, with high probability over the choice of the circuit, in any circuit architecture. Taken together, our results establish that, unless we carefully engineer quantum circuits to take advantage of the noise, noisy quantum circuits are unlikely to offer an advantage over shallow ones for algorithms that output observable expectation value estimates, such as many variational quantum machine learning proposals.
arXiv comment16+46 pages, 8 figures
References in corpus (25)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- Quantum machine learning in feature Hilbert spaces
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Logical quantum processor based on reconfigurable atom arrays
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Evenly distributed unitaries: on the structure of unitary designs
- Quantum machine learning beyond kernel methods
- Decoherence in Solid State Qubits
- Experimental Realization of a Measurement-Induced Entanglement Phase Transition on a Superconducting Quantum Processor
- Computational advantage of quantum random sampling
- Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
- The Boundary for Quantum Advantage in Gaussian Boson Sampling
- The Quantum Wasserstein Distance of Order 1
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- A polynomial-time classical algorithm for noisy random circuit sampling
- Does provable absence of barren plateaus imply classical simulability?
- Efficient tensor network simulation of IBM's largest quantum processors
- Relative Entropy Convergence for Depolarizing Channels
- Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
- Classically estimating observables of noiseless quantum circuits
- Shor's Algorithm Does Not Factor Large Integers in the Presence of Noise
Cited by in corpus (6)
- Barren Plateaus in Variational Quantum Computing
- Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
- Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets
- Emergence of noise-induced barren plateaus in arbitrary layered noise models
- Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
- Learning complexity gradually in quantum machine learning models