On barren plateaus and cost function locality in variational quantum algorithms

• URL: http://arxiv.org/abs/2011.10530v2
• Date: Mon, 25 Oct 2021 15:13:52 GMT
• Title: On barren plateaus and cost function locality in variational quantum algorithms
• Authors: Alexey Uvarov and Jacob Biamonte
• Abstract summary: Variational quantum algorithms rely on gradient based optimization to iteratively minimize a cost function evaluated by measuring output(s) of a quantum processor. A barren plateau is the phenomenon of exponentially vanishing gradients in sufficiently expressive parametrized quantum circuits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms rely on gradient based optimization to iteratively minimize a cost function evaluated by measuring output(s) of a quantum processor. A barren plateau is the phenomenon of exponentially vanishing gradients in sufficiently expressive parametrized quantum circuits. It has been established that the onset of a barren plateau regime depends on the cost function, although the particular behavior has been demonstrated only for certain classes of cost functions. Here we derive a lower bound on the variance of the gradient, which depends mainly on the width of the circuit causal cone of each term in the Pauli decomposition of the cost function. Our result further clarifies the conditions under which barren plateaus can occur.

Related papers

• Equivalence of cost concentration and gradient vanishing for quantum circuits: An elementary proof in the Riemannian formulation [0.0]
  optimization of quantum circuits can be hampered by a decay of average gradient amplitudes with increasing system size. barren plateau problem is equivalent to an exponential decay of the variance of cost-function differences.
  arXiv  Detail & Related papers  (2024-02-12T18:48:50Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Emergence of noise-induced barren plateaus in arbitrary layered noise models [44.99833362998488]
  In variational quantum algorithms the parameters of a parameterized quantum circuit are optimized in order to minimize a cost function that encodes the solution of the problem. We discuss how, and in which sense, the phenomenon of noise-induced barren plateaus emerges in parameterized quantum circuits with a layered noise model.
  arXiv  Detail & Related papers  (2023-10-12T15:18:27Z)
• Gaussian initializations help deep variational quantum circuits escape from the barren plateau [87.04438831673063]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Towards Efficient Ansatz Architecture for Variational Quantum Algorithms [12.728075253374062]
  Variational quantum algorithms are expected to demonstrate the advantage of quantum computing on noisy quantum computers. Training such variational quantum algorithms suffers from gradient vanishing as the size of the algorithm increases. We propose a novel training scheme to mitigate such noise-induced gradient vanishing.
  arXiv  Detail & Related papers  (2021-11-26T19:41:35Z)
• Mitigating Noise-Induced Gradient Vanishing in Variational Quantum Algorithm Training [14.343891429004639]
  Variational quantum algorithms are expected to demonstrate the advantage of quantum computing on noisy quantum computers. Training such variational quantum algorithms suffers from gradient vanishing as the size of the algorithm increases. We propose a novel training scheme to mitigate such noise-induced gradient vanishing.
  arXiv  Detail & Related papers  (2021-11-25T18:28:34Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges [0.0]
  optimizing quantum circuits (PQCs) is the leading approach to make use of near-term quantum computers. We investigate the connection between three different landscape features that have been observed for PQCs.
  arXiv  Detail & Related papers  (2021-04-12T23:52:16Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.