Barren plateaus in quantum neural network training landscapes

  title={Barren plateaus in quantum neural network training landscapes},
  author={Jarrod R. McClean and Sergio Boixo and Vadim N. Smelyanskiy and Ryan Babbush and Hartmut Neven},
  journal={Nature Communications},
Many experimental proposals for noisy intermediate scale quantum devices involve training a parameterized quantum circuit with a classical optimization loop. Such hybrid quantum-classical algorithms are popular for applications in quantum simulation, optimization, and machine learning. Due to its simplicity and hardware efficiency, random circuits are often proposed as initial guesses for exploring the space of quantum states. We show that the exponential dimension of Hilbert space and the… 

Reducing Barren Plateaus in Quantum Algorithm Protocols

An approach to quantum algorithm optimization that is based on trainable Fourier coef-ficients of Hamiltonian system parameters and the ansatz, which applies to the extension of discrete quantum variational algorithms to analogue quantum optimal control schemes and is non-local in time.

Surviving The Barren Plateau in Variational Quantum Circuits with Bayesian Learning Initialization

The fast-and-slow algorithm is introduced, which uses Bayesian Learning to identify a promising region in parameter space and is used to initialize a fast local optimizer to find the global optimum point efficiently.

Noise-induced barren plateaus in variational quantum algorithms

This work rigorously proves a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau, and proves that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n.

Training of quantum circuits on a hybrid quantum computer

This study trains generative modeling circuits on a quantum hybrid computer showing an optimization strategy and a resource trade-off and shows that the convergence of the quantum circuit to the target distribution depends critically on both the quantum hardware and classical optimization strategy.

Optimization of Quantum Algorithm Protocols without Barren Plateaus

This work presents an approach to quantum algorithm optimization that is based on trainable Fourier coefficients of Hamiltonian system parameters and proposes the ansatz as a viable parametrization candidate for near-term quantum machine learning.

Optimal training of variational quantum algorithms without barren plateaus

This work identifies a VQA for quantum simulation with such a constraint that thus can be trained free of barren plateaus and introduces the generalized quantum natural gradient that features stability and optimized movement in parameter space.

Gaussian initializations help deep variational quantum circuits escape from the barren plateau

It is proved that under proper Gaussian initialized parameters, the norm of the gradient decays at most polynomially when the qubit number and the circuit depth increase, where the latter was believed to have vanishing gradients even for shallow circuits.

Entanglement devised barren plateau mitigation

This work defines barren plateaus in terms of random entanglement and proposes and demonstrates a number of barren plateau ameliorating techniques, including initial partitioning of cost function and non-cost function registers, meta-learning of lowentanglement circuit initializations, selective inter-register interaction, entanglements regularization, and rotation into preferred cost function eigenbases.

Capacity and quantum geometry of parametrized quantum circuits

The capacity and trainability of parametrized quantum circuits are evaluated using the geometric structure of the parameter space via the effective quantum dimension, which reveals the expressive power of circuits in general as well as of particular initialization strategies.

Quantum Circuit Evolution on NISQ Devices

This work considers a simple evolutionary strategy that addresses the trade-off between finding appropriate circuit ar-chitectures and parameter tuning and finds only a minor slowdown on actual quantum machines compared to simulations.



Classification with Quantum Neural Networks on Near Term Processors

This work introduces a quantum neural network, QNN, that can represent labeled data, classical or quantum, and be trained by supervised learning, and shows through classical simulation that parameters can be found that allow the QNN to learn to correctly distinguish the two data sets.

Quantum optimization using variational algorithms on near-term quantum devices

The quantum volume as a metric to compare the power of near-term quantum devices is discussed and simple error-mitigation schemes are introduced that could improve the accuracy of determining ground-state energies.

The theory of variational hybrid quantum-classical algorithms

The concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device is introduced and the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

The theory of variational hybrid quantum-classical algorithms

This work develops a variational adiabatic ansatz and explores unitary coupled cluster where it is shown how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of

QVECTOR: an algorithm for device-tailored quantum error correction

This method aims to optimize the average fidelity of encoding and recovery circuits with respect to the actual noise in the device, as opposed to that of an artificial or approximate noise model.

Practical optimization for hybrid quantum-classical algorithms

A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorial

Application of Fermionic Marginal Constraints to Hybrid Quantum Algorithms

This work introduces fermionic n-representability conditions in the language of quantum computation, and utilizes them to develop several techniques to accelerate and improve practical applications for quantum chemistry on quantum computers.

Quantum Algorithms for Fixed Qubit Architectures

Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or

Unsupervised Machine Learning on a Hybrid Quantum Computer

This paper uses the quantum approximate optimization algorithm in conjunction with a gradient-free Bayesian optimization to train the quantum machine, and finds evidence that classical optimization can be used to train around both coherent and incoherent imperfections.