BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2204.13751v1
• Date: Thu, 28 Apr 2022 19:46:10 GMT
• Title: BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithms
• Authors: Ankit Kulshrestha and Ilya Safro
• Abstract summary: Barren plateaus are a notorious problem in the optimization of variational quantum algorithms. We propose an alternative strategy which initializes the parameters of a unitary gate by drawing from a beta distribution. We empirically show that our proposed framework significantly reduces the possibility of a complex quantum neural network getting stuck in a barren plateau.
• Score: 0.7462336024223667
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Barren plateaus are a notorious problem in the optimization of variational quantum algorithms and pose a critical obstacle in the quest for more efficient quantum machine learning algorithms. Many potential reasons for barren plateaus have been identified but few solutions have been proposed to avoid them in practice. Existing solutions are mainly focused on the initialization of unitary gate parameters without taking into account the changes induced by input data. In this paper, we propose an alternative strategy which initializes the parameters of a unitary gate by drawing from a beta distribution. The hyperparameters of the beta distribution are estimated from the data. To further prevent barren plateau during training we add a novel perturbation at every gradient descent step. Taking these ideas together, we empirically show that our proposed framework significantly reduces the possibility of a complex quantum neural network getting stuck in a barren plateau.

Related papers

• A Survey of Methods for Mitigating Barren Plateaus for Parameterized Quantum Circuits [0.0]
  Barren Plateaus are a formidable challenge for hybrid quantum-classical algorithms that lead to flat plateaus in the loss function. This paper provides a conceptual perspective between classical interpretations of vanishing gradients as well as dive into techniques of cost functions, entanglement, strategies to barren plateaus.
  arXiv  Detail & Related papers  (2024-06-20T13:10:26Z)
• Avoiding barren plateaus via Gaussian Mixture Model [6.0599055267355695]
  Variational quantum algorithms are one of the most representative algorithms in quantum computing. They face challenges when dealing with large numbers of qubits, deep circuit layers, or global cost functions, making them often untrainable.
  arXiv  Detail & Related papers  (2024-02-21T03:25:26Z)
• From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits [0.0]
  We introduce an approach that favours jumps out of a barren plateau into a fertile valley. These operations are constructed from conic extensions of parameterised unitary quantum circuits. We further reduce the problem of finding optimal jump directions to a low-dimensional generalised eigenvalue problem.
  arXiv  Detail & Related papers  (2023-10-06T13:56:42Z)
• Entropic Neural Optimal Transport via Diffusion Processes [105.34822201378763]
  We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions. Our algorithm is based on the saddle point reformulation of the dynamic version of EOT which is known as the Schr"odinger Bridge problem. In contrast to the prior methods for large-scale EOT, our algorithm is end-to-end and consists of a single learning step.
  arXiv  Detail & Related papers  (2022-11-02T14:35:13Z)
• Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis [59.545114016224254]
  Quantum algorithms for topological data analysis seem to provide an exponential advantage over the best classical approach. We show that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers. We argue that an exponential quantum advantage can be recovered if the input data is given as a specification of simplices.
  arXiv  Detail & Related papers  (2022-09-28T17:53:25Z)
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz [0.0]
  Variational Quantum Algorithms (VQAs) represent leading candidates to achieve computational speed-ups on current quantum devices. Two major hurdles are the proliferation of low-quality variational local minima, and the exponential vanishing of gradients in the cost function landscape. Here we show that by employing iterative search schemes one can effectively prepare the ground state of paradigmatic quantum many-body models.
  arXiv  Detail & Related papers  (2022-06-04T12:52:29Z)
• Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration and Lower Bounds [54.51566432934556]
  We consider distributed optimization methods for problems where forming the Hessian is computationally challenging. We leverage randomized sketches for reducing the problem dimensions as well as preserving privacy and improving straggler resilience in asynchronous distributed systems.
  arXiv  Detail & Related papers  (2022-03-18T05:49:13Z)
• A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors [60.489902135153415]
  This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors. The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement.
  arXiv  Detail & Related papers  (2021-11-26T06:33:29Z)
• Multivariate Deep Evidential Regression [77.34726150561087]
  A new approach with uncertainty-aware neural networks shows promise over traditional deterministic methods. We discuss three issues with a proposed solution to extract aleatoric and epistemic uncertainties from regression-based neural networks.
  arXiv  Detail & Related papers  (2021-04-13T12:20:18Z)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)
• Entanglement Devised Barren Plateau Mitigation [1.382143546774115]
  We implicate random entanglement as the source of barren plateaus and characterize them in terms of many-body entanglement dynamics. We propose and demonstrate a number of barren plateau ameliorating techniques. We find that entanglement limiting, both automatic and engineered, is a hallmark of high-accuracy training.
  arXiv  Detail & Related papers  (2020-12-22T17:49:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.