Avoiding barren plateaus via Gaussian Mixture Model
- URL: http://arxiv.org/abs/2402.13501v1
- Date: Wed, 21 Feb 2024 03:25:26 GMT
- Title: Avoiding barren plateaus via Gaussian Mixture Model
- Authors: Xiao Shi and Yun Shang
- Abstract summary: 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.
- Score: 6.0599055267355695
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Variational quantum algorithms is one of the most representative algorithms
in quantum computing, which has a wide range of applications in quantum machine
learning, quantum simulation and other related fields. However, they face
challenges associated with the barren plateau phenomenon, especially when
dealing with large numbers of qubits, deep circuit layers, or global cost
functions, making them often untrainable. In this paper, we propose a novel
parameter initialization strategy based on Gaussian Mixture Models. We
rigorously prove that, the proposed initialization method consistently avoids
the barren plateaus problem for hardware-efficient ansatz with arbitrary length
and qubits and any given cost function. Specifically, we find that the gradient
norm lower bound provided by the proposed method is independent of the number
of qubits $N$ and increases with the circuit depth $L$. Our results strictly
highlight the significance of Gaussian Mixture model initialization strategies
in determining the trainability of quantum circuits, which provides valuable
guidance for future theoretical investigations and practical applications.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization [3.031137751464259]
We show that by reducing the initial domain of each parameter proportional to the square root of circuit depth, the magnitude of the cost gradient decays at most inversely to qubit count and circuit depth.
This strategy can protect specific quantum neural networks from exponentially many spurious local minima.
arXiv Detail & Related papers (2023-02-14T06:41:37Z) - Improving the speed of variational quantum algorithms for quantum error
correction [7.608765913950182]
We consider the problem of devising a suitable Quantum Error Correction (QEC) procedures for a generic quantum noise acting on a quantum circuit.
In general, there is no analytic universal procedure to obtain the encoding and correction unitary gates.
We address this problem using a cost function based on the Quantum Wasserstein distance of order 1.
arXiv Detail & Related papers (2023-01-12T19:44:53Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Provably efficient variational generative modeling of quantum many-body
systems via quantum-probabilistic information geometry [3.5097082077065003]
We introduce a generalization of quantum natural gradient descent to parameterized mixed states.
We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent.
Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
arXiv Detail & Related papers (2022-06-09T17:58:15Z) - Quantum Robustness Verification: A Hybrid Quantum-Classical Neural
Network Certification Algorithm [1.439946676159516]
In this work, we investigate the verification of ReLU networks, which involves solving a robustness many-variable mixed-integer programs (MIPs)
To alleviate this issue, we propose to use QC for neural network verification and introduce a hybrid quantum procedure to compute provable certificates.
We show that, in a simulated environment, our certificate is sound, and provide bounds on the minimum number of qubits necessary to approximate the problem.
arXiv Detail & Related papers (2022-05-02T13:23:56Z) - 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) - Surviving The Barren Plateau in Variational Quantum Circuits with
Bayesian Learning Initialization [0.0]
Variational quantum-classical hybrid algorithms are seen as a promising strategy for solving practical problems on quantum computers in the near term.
Here, we introduce the fast-and-slow algorithm, which uses gradients to identify a promising region in Bayesian space.
Our results move variational quantum algorithms closer to their envisioned applications in quantum chemistry, optimization, and quantum simulation problems.
arXiv Detail & Related papers (2022-03-04T17:48:57Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
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.