Abrupt Transitions in Variational Quantum Circuit Training

Abstract

Variational quantum algorithms dominate gate-based applications of modern quantum processors. The so called, {\it layer-wise trainability conjecture} appears in various works throughout the variational quantum computing literature. The conjecture asserts that a quantum circuit can be trained piece-wise, e.g.~that a few layers can be trained in sequence to minimize an objective function. Here we prove this conjecture false. Counterexamples are found by considering objective functions that are exponentially close (in the number of qubits) to the identity matrix. In the finite setting, we found abrupt transitions in the ability of quantum circuits to be trained to minimize these objective functions. Specifically, we found that below a critical (target gate dependent) threshold, circuit training terminates close to the identity and remains near to the identity for subsequently added blocks trained piece-wise. A critical layer depth will abruptly train arbitrarily close to the target, thereby minimizing the objective function. These findings shed new light on the divide-and-conquer trainability of variational quantum circuits and apply to a wide collection of contemporary literature.

arXiv comment11 pages, 8 figures, RevTeX

References in corpus (34)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Quantum Circuit Learning
• Parameterized quantum circuits as machine learning models
• Evaluating analytic gradients on quantum hardware
• Scalable Quantum Simulation of Molecular Energies
• Quantum optimization using variational algorithms on near-term quantum devices
• Variational Quantum Computation of Excited States
• Robust determination of molecular spectra on a quantum processor
• Quantum chemistry calculations on a trapped-ion quantum simulator
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• A generative modeling approach for benchmarking and training shallow quantum circuits
• Quantum-assisted quantum compiling
• Layerwise learning for quantum neural networks
• Simulating quantum many-body dynamics on a current digital quantum computer
• From transistor to trapped-ion computers for quantum chemistry
• Noise Resilience of Variational Quantum Compiling
• Universal Variational Quantum Computation
• Variational Quantum Unsampling on a Quantum Photonic Processor
• On the Universality of the Quantum Approximate Optimization Algorithm
• A quantum algorithm to train neural networks using low-depth circuits
• Machine Learning Phase Transitions with a Quantum Processor
• Adequacy of Si:P Chains as Fermi-Hubbard Simulators
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• Classical and Quantum Bounded Depth Approximation Algorithms
• Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers
• Variational Quantum Algorithms for Dimensionality Reduction and Classification
• Understanding Quantum Control Processor Capabilities and Limitations through Circuit Characterization
• Certified variational quantum algorithms for eigenstate preparation

Cited by in corpus (33)

• Variational Quantum Algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• General parameter-shift rules for quantum gradients
• Effect of barren plateaus on gradient-free optimization
• Barren Plateaus in Variational Quantum Computing
• Quantum circuit architecture search for variational quantum algorithms
• Entanglement Devised Barren Plateau Mitigation
• Parameter Concentration in Quantum Approximate Optimization
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
• Learning quantum data with the quantum Earth Mover's distance
• Training Saturation in Layerwise Quantum Approximate Optimisation
• Lyapunov control-inspired strategies for quantum combinatorial optimization
• Variational Quantum Classifiers Through the Lens of the Hessian
• Variational quantum simulation: a case study for understanding warm starts
• Generalization of Quantum Machine Learning Models Using Quantum Fisher Information Metric
• Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus
• Quantum Optimization for Training Quantum Neural Networks
• Improved variational quantum eigensolver via quasi-dynamical evolution
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits
• Assessment of the variational quantum eigensolver: application to the Heisenberg model
• Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
• Quantum Circuit Evolution on NISQ Devices
• Randomized adaptive quantum state preparation
• Numerical hardware-efficient variational quantum simulation of a soliton solution
• Progress towards analytically optimal angles in quantum approximate optimisation
• Barren plateaus are swamped with traps
• Evaluating the Resilience of Variational Quantum Algorithms to Leakage Noise
• Backpropagation scaling in parameterised quantum circuits
• Deep-Circuit QAOA
• Improving Parameter Training for VQEs by Sequential Hamiltonian Assembly
• From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits