Trainability Enhancement of Parameterized Quantum Circuits via
Reduced-Domain Parameter Initialization
- URL: http://arxiv.org/abs/2302.06858v1
- Date: Tue, 14 Feb 2023 06:41:37 GMT
- Title: Trainability Enhancement of Parameterized Quantum Circuits via
Reduced-Domain Parameter Initialization
- Authors: Yabo Wang, Bo Qi, Chris Ferrie, Daoyi Dong
- Abstract summary: Training quantum circuits (PQCs) is notoriously challenging owing to the phenomenon of plateaus and/or the existence of (exponentially) many spurious local minima.
We propose an efficient parameter initialization strategy with theoretical guarantees.
Our results can be used to enhance the trainability of PQCs in variational quantum algorithms.
- Score: 2.372393003522374
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Parameterized quantum circuits (PQCs) have been widely used as a machine
learning model to explore the potential of achieving quantum advantages for
various tasks. However, the training of PQCs is notoriously challenging owing
to the phenomenon of plateaus and/or the existence of (exponentially) many
spurious local minima. In this work, we propose an efficient parameter
initialization strategy with theoretical guarantees. It is proved that if the
initial domain of each parameter is reduced inversely proportional to the
square root of circuit depth, then the magnitude of the cost gradient decays at
most polynomially as a function of the depth. Our theoretical results are
verified by numerical simulations of variational quantum eigensolver tasks.
Moreover, we demonstrate that the reduced-domain initialization strategy can
protect specific quantum neural networks from exponentially many spurious local
minima. Our results highlight the significance of an appropriate parameter
initialization strategy and can be used to enhance the trainability of PQCs in
variational quantum algorithms.
Related papers
- Diagnosing local minima and accelerating convergence of variational quantum eigensolvers with quantum subspace techniques [0.0]
We propose combining quantum subspace techniques with the variational quantum eigensolver (VQE)
In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits.
The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies.
arXiv Detail & Related papers (2024-04-09T18:00:01Z) - End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
We provide a complete quantum circuit-level description of the algorithm from problem input to problem output.
We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
arXiv Detail & Related papers (2022-11-22T18:54:48Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Bayesian Learning of Parameterised Quantum Circuits [0.0]
We take a probabilistic point of view and reformulate the classical optimisation as an approximation of a Bayesian posterior.
We describe a dimension reduction strategy based on a maximum a posteriori point estimate with a Laplace prior.
Experiments on the Quantinuum H1-2 computer show that the resulting circuits are faster to execute and less noisy than circuits trained without a gradient.
arXiv Detail & Related papers (2022-06-15T14:20:14Z) - Fundamental limitations on optimization in variational quantum
algorithms [7.165356904023871]
A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs)
We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability.
This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
arXiv Detail & Related papers (2022-05-10T17:14:57Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - 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) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z)
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.