Efficient estimation of trainability for variational quantum circuits

Abstract

Parameterized quantum circuits used as variational ansätze are emerging as promising tools to tackle complex problems ranging from quantum chemistry to combinatorial optimization. These variational quantum circuits can suffer from the well-known curse of barren plateaus, which is characterized by an exponential vanishing of the cost-function gradient with the system size, making training unfeasible for practical applications. Since a generic quantum circuit cannot be simulated efficiently, the determination of its trainability is an important problem. Here we find an efficient method to compute the gradient of the cost function and its variance for a wide class of variational quantum circuits. Our scheme relies on our proof of an exact mapping from randomly initialized circuits to a set of Clifford circuits that can be efficiently simulated on a classical computer by virtue of the celebrated Gottesmann-Knill theorem. This method is scalable and can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem. As illustrative examples, we show results with up to 100 qubits.

arXiv commentRevised version with three additional figures and results with up to 100 qubits

References in corpus (46)

• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Machine learning and the physical sciences
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Quantum support vector machine for big data classification
• Quantum Circuit Learning
• Improved Simulation of Stabilizer Circuits
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Hartree-Fock on a superconducting qubit quantum computer
• Challenges and Opportunities in Quantum Machine Learning
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Chaos and complexity by design
• Training variational quantum algorithms is NP-hard
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Evenly distributed unitaries: on the structure of unitary designs
• Random Quantum Circuits are Approximate 2-designs
• Local random quantum circuits are approximate polynomial-designs
• Effect of barren plateaus on gradient-free optimization
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Quantum machine learning beyond kernel methods
• Quantum circuit architecture search for variational quantum algorithms
• Theory of neuromorphic computing by waves: machine learning by rogue waves, dispersive shocks, and solitons
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Opportunities in Quantum Reservoir Computing and Extreme Learning Machines
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Entanglement Devised Barren Plateau Mitigation
• Barren plateaus preclude learning scramblers
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• On barren plateaus and cost function locality in variational quantum algorithms
• Expressibility of the alternating layered ansatz for quantum computation
• Photonic extreme learning machine by free-space optical propagation
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Quasiprobability decompositions with reduced sampling overhead
• Universal Effectiveness of High-Depth Circuits in Variational Eigenproblems
• Noisy Quantum Kernel Machines
• Quantum Energy Landscape and VQA Optimization
• Entanglement Diagnostics for Efficient Quantum Computation
• Photonic kernel machine learning for ultrafast spectral analysis
• Machine learning via relativity-inspired quantum dynamics

Cited by in corpus (5)

• Barren Plateaus in Variational Quantum Computing
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• SHARC-VQE: Simplified Hamiltonian Approach with Refinement and Correction enabled Variational Quantum Eigensolver for Molecular Simulation
• Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations
• Moments of Quantum Channel Ensembles