Learning to learn with quantum neural networks via classical neural networks

Abstract

Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Specifically, we train classical recurrent neural networks to find approximately optimal parameters within a small number of queries of the cost function for the Quantum Approximate Optimization Algorithm (QAOA) for MaxCut, QAOA for Sherrington-Kirkpatrick Ising model, and for a Variational Quantum Eigensolver for the Hubbard model. By initializing other optimizers at parameter values suggested by the classical neural network, we demonstrate a significant improvement in the total number of optimization iterations required to reach a given accuracy. We further demonstrate that the optimization strategies learned by the neural network generalize well across a range of problem instance sizes. This opens up the possibility of training on small, classically simulatable problem instances, in order to initialize larger, classically intractably simulatable problem instances on quantum devices, thereby significantly reducing the number of required quantum-classical optimization iterations.

arXiv comment12 pages, 4 figures

Cited by in corpus (53)

• Variational Quantum Algorithms
• Quantum computational chemistry
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The power of quantum neural networks
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Challenges and Opportunities in Quantum Machine Learning
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Transfer learning in hybrid classical-quantum neural networks
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Layerwise learning for quantum neural networks
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine
• Large gradients via correlation in random parameterized quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Variational Quantum State Eigensolver
• Barren plateaus preclude learning scramblers
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Implementation of the XY interaction family with calibration of a single pulse
• Recent advances for quantum classifiers
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms
• QuGAN: A Quantum State Fidelity based Generative Adversarial Network
• Reformulation of the No-Free-Lunch Theorem for Entangled Data Sets
• Classical symmetries and the Quantum Approximate Optimization Algorithm
• Quantum Graph Neural Networks
• Quantum Hamiltonian-Based Models and the Variational Quantum Thermalizer Algorithm
• Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation
• Quantum Embedding Search for Quantum Machine Learning
• Low depth mechanisms for quantum optimization
• Quantum approximate optimization via learning-based adaptive optimization
• Detecting and quantifying entanglement on near-term quantum devices
• Natural Evolutionary Strategies for Variational Quantum Computation
• Exploiting Symmetry Reduces the Cost of Training QAOA
• Quantum Architecture Search with Meta-learning
• Quantum Architecture Search via Deep Reinforcement Learning
• QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA
• Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries
• Collective optimization for variational quantum eigensolvers
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits
• Avoiding local minima in Variational Quantum Algorithms with Neural Networks
• Hybrid quantum-classical algorithms for solving quantum chemistry in Hamiltonian-wavefunction space
• Reinforcement-Learning-Based Variational Quantum Circuits Optimization for Combinatorial Problems
• Differentiable Physics: A Position Piece
• Compressed variational quantum eigensolver for the Fermi-Hubbard model
• Experimental pairwise entanglement estimation for an N-qubit system :A machine learning approach for programming quantum hardware
• Normalized Gradient Descent for Variational Quantum Algorithms
• Meta Variational Monte Carlo
• Using machine learning for quantum annealing accuracy prediction
• Mitigating Noise-Induced Gradient Vanishing in Variational Quantum Algorithm Training
• Learning to Utilize Correlated Auxiliary Noise: A Possible Quantum Advantage