Equivalence of quantum barren plateaus to cost concentration and narrow
gorges
- URL: http://arxiv.org/abs/2104.05868v1
- Date: Mon, 12 Apr 2021 23:52:16 GMT
- Title: Equivalence of quantum barren plateaus to cost concentration and narrow
gorges
- Authors: Andrew Arrasmith, Zo\"e Holmes, M. Cerezo, Patrick J. Coles
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Optimizing parameterized quantum circuits (PQCs) is the leading approach to
make use of near-term quantum computers. However, very little is known about
the cost function landscape for PQCs, which hinders progress towards
quantum-aware optimizers. In this work, we investigate the connection between
three different landscape features that have been observed for PQCs: (1)
exponentially vanishing gradients (called barren plateaus), (2) exponential
cost concentration about the mean, and (3) the exponential narrowness of minina
(called narrow gorges). We analytically prove that these three phenomena occur
together, i.e., when one occurs then so do the other two. A key implication of
this result is that one can numerically diagnose barren plateaus via cost
differences rather than via the computationally more expensive gradients. More
broadly, our work shows that quantum mechanics rules out certain cost
landscapes (which otherwise would be mathematically possible), and hence our
results are interesting from a quantum foundations perspective.
Related papers
- Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Towards determining the presence of barren plateaus in some chemically inspired variational quantum algorithms [10.386753939552872]
In quantum chemistry, the variational quantum eigensolver (VQE) is a promising algorithm for molecular simulations on near-term quantum computers.
However, VQEs using hardware-efficient circuits face scaling challenges due to the barren plateau problem.
This raises the question of whether chemically inspired circuits from unitary coupled cluster (UCC) methods can avoid this issue.
arXiv Detail & Related papers (2023-12-13T12:43:54Z) - A vertical gate-defined double quantum dot in a strained germanium
double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation.
We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well.
We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z) - The quantum cost function concentration dependency on the
parametrization expressivity [0.0]
We analyze how the expressiveness of the parametrization affects the cost function.
This is the first time that these two important aspects of quantum neural networks are explicitly connected.
arXiv Detail & Related papers (2023-01-17T13:39:26Z) - System-environment dynamics of GHZ-like states in noninertial frames [14.401323451758975]
Quantum coherence, quantum entanglement and quantum nonlocality are important resources in quantum information precessing.
We study the dynamical evolution of the three-qubit GHZ-like states in non-inertial frame when one and/or two qubits undergo decoherence.
arXiv Detail & Related papers (2022-12-30T03:36:48Z) - 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) - On barren plateaus and cost function locality in variational quantum
algorithms [0.0]
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.
arXiv Detail & Related papers (2020-11-20T18:00:01Z) - 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) - 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.