Emergence of noise-induced barren plateaus in arbitrary layered noise models

Abstract

In variational quantum algorithms the parameters of a parameterized quantum circuit are optimized in order to minimize a cost function that encodes the solution of the problem. The barren plateau phenomenon manifests as an exponentially vanishing dependence of the cost function with respect to the variational parameters, and thus hampers the optimization process. We discuss how, and in which sense, the phenomenon of noise-induced barren plateaus emerges in parameterized quantum circuits with a layered noise model. Previous results have shown the existence of noise-induced barren plateaus in the presence of local Pauli noise [arXiv:2007.14384]. We extend these results analytically to arbitrary completely-positive trace preserving maps in two cases: 1) when a parameter-shift rule holds, 2) when the parameterized quantum circuit at each layer forms a unitary $2$-design. The second example shows how highly expressive unitaries give rise not only to standard barren plateaus [arXiv:1803.11173], but also to noise-induced ones. In the second part of the paper, we study numerically the emergence of noise-induced barren plateaus in QAOA circuits focusing on the case of MaxCut problems on $d$-regular graphs and amplitude damping noise.

arXiv comment46 pages, 11 Figures, We give additional numerical results for the decay of the average purity in QAOA circuits under amplitude damping noise

References in corpus (51)

• Quantum Computing in the NISQ era and beyond
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Surface codes: Towards practical large-scale quantum computation
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum Annealing in the Transverse Ising Model
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Topological quantum memory
• Quantum Circuit Learning
• Error mitigation for short-depth quantum circuits
• Quantum Error Correction for Quantum Memories
• Suppressing quantum errors by scaling a surface code logical qubit
• Evaluating analytic gradients on quantum hardware
• The Variational Quantum Eigensolver: a review of methods and best practices
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• A short introduction to the Lindblad Master Equation
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Scalable Noise Estimation with Random Unitary Operators
• The randomized measurement toolbox
• Effect of barren plateaus on gradient-free optimization
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Solving nonlinear differential equations with differentiable quantum circuits
• Variational algorithms for linear algebra
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Logical-qubit operations in an error-detecting surface code
• Expressibility of the alternating layered ansatz for quantum computation
• Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
• Evaluating the noise resilience of variational quantum algorithms
• On the Universality of the Quantum Approximate Optimization Algorithm
• Quantum approximate optimization is computationally universal
• Barren plateaus in quantum tensor network optimization
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Characterizing local noise in QAOA circuits
• Conditions for strictly purity-decreasing quantum Markovian dynamics
• Error propagation in NISQ devices for solving classical optimization problems
• Variational quantum simulations of stochastic differential equations
• The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model
• Strictly contractive quantum channels and physically realizable quantum computers
• Families of completely positive maps associated with monotone metrics
• Exponentially tighter bounds on limitations of quantum error mitigation
• Contraction coefficients for noisy quantum channels
• Spectral Quantum Tomography
• The quantum cost function concentration dependency on the parametrization expressivity
• Ability of error correlations to improve the performance of variational quantum algorithms
• Noise-induced shallow circuits and absence of barren plateaus

Cited by in corpus (7)

• Barren Plateaus in Variational Quantum Computing
• Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets
• Quantum DeepONet: Neural operators accelerated by quantum computing
• Noise-Robust Detection of Quantum Phase Transitions
• Estimates of loss function concentration in noisy parametrized quantum circuits
• Noisy Monitored Quantum Circuits
• Quantum Simulation-Based Optimization for Cooling System Design