Diagnosing Barren Plateaus with Tools from Quantum Optimal Control

• URL: http://arxiv.org/abs/2105.14377v3
• Date: Tue, 27 Sep 2022 14:21:57 GMT
• Title: Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Authors: Martin Larocca, Piotr Czarnik, Kunal Sharma, Gopikrishnan Muraleedharan, Patrick J. Coles, M. Cerezo
• Abstract summary: Variational Quantum Algorithms (VQAs) have received considerable attention due to their potential for achieving near-term quantum advantage. One known scaling result for VQAs is barren plateaus, where certain circumstances lead to exponentially vanishing gradients. We employ tools from quantum optimal control to develop a framework that can diagnose the presence or absence of barren plateaus for problem-inspired ansatzes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational Quantum Algorithms (VQAs) have received considerable attention due to their potential for achieving near-term quantum advantage. However, more work is needed to understand their scalability. One known scaling result for VQAs is barren plateaus, where certain circumstances lead to exponentially vanishing gradients. It is common folklore that problem-inspired ansatzes avoid barren plateaus, but in fact, very little is known about their gradient scaling. In this work we employ tools from quantum optimal control to develop a framework that can diagnose the presence or absence of barren plateaus for problem-inspired ansatzes. Such ansatzes include the Quantum Alternating Operator Ansatz (QAOA), the Hamiltonian Variational Ansatz (HVA), and others. With our framework, we prove that avoiding barren plateaus for these ansatzes is not always guaranteed. Specifically, we show that the gradient scaling of the VQA depends on the degree of controllability of the system, and hence can be diagnosed through the dynamical Lie algebra $\mathfrak{g}$ obtained from the generators of the ansatz. We analyze the existence of barren plateaus in QAOA and HVA ansatzes, and we highlight the role of the input state, as different initial states can lead to the presence or absence of barren plateaus. Taken together, our results provide a framework for trainability-aware ansatz design strategies that do not come at the cost of extra quantum resources. Moreover, we prove no-go results for obtaining ground states with variational ansatzes for controllable system such as spin glasses. Our work establishes a link between the existence of barren plateaus and the scaling of the dimension of $\mathfrak{g}$.

Related papers

• Exploiting hidden structures in non-convex games for convergence to Nash equilibrium [62.88214569402201]
  A wide array of modern machine learning applications can be formulated as non-cooperative Nashlibria. We provide explicit convergence guarantees for both deterministic and deterministic environments.
  arXiv  Detail & Related papers  (2023-12-27T15:21:25Z)
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits [7.0379869298557844]
  Training a parameterized model largely depends on the landscape of the underlying loss function. We show that these bounds, as well as the variance of the loss itself, can be estimated efficiently and classically-versa--providing practical tools to study the loss landscapes of VQA models. This insight has direct implications for hybrid Quantum Generative Adrial Networks (qGANs), a generative model that can be reformulated as a VQA with an observable composed of local and global terms.
  arXiv  Detail & Related papers  (2023-09-22T07:38:13Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Non-Abelian braiding of graph vertices in a superconducting processor [144.97755321680464]
  Indistinguishability of particles is a fundamental principle of quantum mechanics. braiding of non-Abelian anyons causes rotations in a space of degenerate wavefunctions. We experimentally verify the fusion rules of the anyons and braid them to realize their statistics.
  arXiv  Detail & Related papers  (2022-10-19T02:28:44Z)
• BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithms [0.7462336024223667]
  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.
  arXiv  Detail & Related papers  (2022-04-28T19:46:10Z)
• Non-equilibrium stationary states of quantum non-Hermitian lattice models [68.8204255655161]
  We show how generic non-Hermitian tight-binding lattice models can be realized in an unconditional, quantum-mechanically consistent manner. We focus on the quantum steady states of such models for both fermionic and bosonic systems.
  arXiv  Detail & Related papers  (2021-03-02T18:56:44Z)
• Entanglement Induced Barren Plateaus [2.8038382295783943]
  We argue that an excess in entanglement between the visible and hidden units in a Quantum Neural Network can hinder learning. We show that quantum neural networks that satisfy a volume-law in the entanglement entropy will give rise to models not suitable for learning with high probability.
  arXiv  Detail & Related papers  (2020-10-29T22:05:30Z)
• Barren plateaus preclude learning scramblers [2.442224099834475]
  Scrambling processes rapidly spread entanglement through many-body quantum systems. We ask if quantum machine learning (QML) could be used to investigate such processes.
  arXiv  Detail & Related papers  (2020-09-30T17:31:36Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms [0.3562485774739681]
  Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau.
  arXiv  Detail & Related papers  (2020-07-28T17:52:21Z)
• Einselection from incompatible decoherence channels [62.997667081978825]
  We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators. We show that Fock states remain the most robust states to decoherence up to a critical coupling.
  arXiv  Detail & Related papers  (2020-01-29T14:15:19Z)

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.