Mitigating Barren Plateaus with Transfer-learning-inspired Parameter Initializations

Abstract

Variational quantum algorithms (VQAs) are widely applied in the noisy intermediate-scale quantum era and are expected to demonstrate quantum advantage. However, training VQAs faces difficulties, one of which is the so-called barren plateaus (BP) phenomenon, where gradients of cost functions vanish exponentially with the number of qubits. In this paper, inspired by transfer learning, where knowledge of pre-solved tasks could be further used in a different but related work with training efficiency improved, we report a parameter initialization method to mitigate BP. In the method, a small-sized task is solved with a VQA. Then the ansatz and its optimum parameters are transferred to tasks with larger sizes. Numerical simulations show that this method could mitigate BP and improve training efficiency. A brief discussion on how this method can work well is also provided. This work provides a reference for mitigating BP, and therefore, VQAs could be applied to more practical problems.

arXiv comment12 pages, 4 figures, 1 tables

References in corpus (49)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum machine learning in feature Hilbert spaces
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• A Theory of Fault-Tolerant Quantum Computation
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Optimal Quantum Phase Estimation
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Training variational quantum algorithms is NP-hard
• Transfer learning in hybrid classical-quantum neural networks
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Layerwise learning for quantum neural networks
• Variational quantum algorithms for nonlinear problems
• Random Quantum Circuits are Approximate 2-designs
• The Expressive Power of Parameterized Quantum Circuits
• Subspace-search variational quantum eigensolver for excited states
• Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Effect of barren plateaus on gradient-free optimization
• Variational algorithms for linear algebra
• Multiqubit Clifford groups are unitary 3-designs
• Reachability Deficits in Quantum Approximate Optimization
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Variational Quantum algorithm for Poisson equation
• Efficient measure for the expressivity of variational quantum algorithms
• Expressibility of the alternating layered ansatz for quantum computation
• Universal Variational Quantum Computation
• Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
• Quantum Machine Learning for Particle Physics using a Variational Quantum Classifier
• Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
• Symmetry-adapted variational quantum eigensolver
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Symbolic integration with respect to the Haar measure on the unitary group
• Transfer learning for scalability of neural-network quantum states
• Quantifying the efficiency of state preparation via quantum variational eigensolvers
• Reachability Deficits in Quantum Approximate Optimization of Graph Problems
• A unified framework of transformations based on the Jordan-Wigner transformation
• Hybrid quantum variational algorithm for simulating open quantum systems with near-term devices
• Variational Quantum Algorithms for Steady States of Open Quantum Systems
• Transfer Learning for Quantum Classifiers: An Information-Theoretic Generalization Analysis

Cited by in corpus (18)

• Barren Plateaus in Variational Quantum Computing
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Barren plateaus in quantum tensor network optimization
• Trainability barriers and opportunities in quantum generative modeling
• ResQNets: A Residual Approach for Mitigating Barren Plateaus in Quantum Neural Networks
• Tensor networks for quantum machine learning
• Training variational quantum algorithms with random gate activation
• Classical Splitting of Parametrized Quantum Circuits
• Quantum algorithms for scientific computing
• Quantum Neural Estimation of Entropies
• Image Classification with Rotation-Invariant Variational Quantum Circuits
• Quantum neural compressive sensing for ghost imaging
• Transfer learning from Hermitian to non-Hermitian quantum many-body physics
• High-fidelity dimer excitations using quantum hardware
• Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations
• A variational quantum algorithm for entanglement quantification
• HQNET: Harnessing Quantum Noise for Effective Training of Quantum Neural Networks in NISQ Era
• Data-driven Quantum Dynamical Embedding Method for Long-term Prediction on Near-term Quantum Computers