Exploring the role of parameters in variational quantum algorithms
- URL: http://arxiv.org/abs/2209.14405v1
- Date: Wed, 28 Sep 2022 20:24:53 GMT
- Title: Exploring the role of parameters in variational quantum algorithms
- Authors: Abhinav Anand, Sumner Alperin-Lea, Alexandre Choquette and Al\'an
Aspuru-Guzik
- Abstract summary: We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra.
A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
- Score: 59.20947681019466
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this work, we introduce a quantum-control-inspired method for the
characterization of variational quantum circuits using the rank of the
dynamical Lie algebra associated with the hermitian generator(s) of the
individual layers. Layer-based architectures in variational algorithms for the
calculation of ground-state energies of physical systems are taken as the focus
of this exploration. A promising connection is found between the Lie rank, the
accuracy of calculated energies, and the requisite depth to attain target
states via a given circuit architecture, even when using a lot of parameters
which is appreciably below the number of separate terms in the generators. As
the cost of calculating the dynamical Lie rank via an iterative process grows
exponentially with the number of qubits in the circuit and therefore becomes
prohibitive quickly, reliable approximations thereto are desirable. The
rapidity of the increase of the dynamical Lie rank in the first few iterations
of the calculation is found to be a viable (lower bound) proxy for the full
calculation, balancing accuracy and computational expense. We, therefore,
propose the dynamical Lie rank and proxies thereof as a useful design metric
for layer-structured quantum circuits in variational algorithms.
Related papers
- Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Energy risk analysis with Dynamic Amplitude Estimation and Piecewise
Approximate Quantum Compiling [0.0]
We generalize the Approximate Quantum Compiling algorithm into a new method for CNOT-depth reduction.
We present a 10-qubit experimental demonstration of Iterative Amplitude Estimation on a quantum computer.
The target application is the derivation of the Expected Value of contract portfolios in the energy industry.
arXiv Detail & Related papers (2023-05-16T14:53:08Z) - Calculation of the moscovium ground-state energy by quantum algorithms [0.0]
We investigate the possibility to calculate the ground-state energy of the atomic systems on a quantum computer.
We evaluate the lowest binding energy of the moscovium atom with the use of the iterative phase estimation and variational quantum eigensolver.
arXiv Detail & Related papers (2022-07-17T18:41:19Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Quantum Causal Unravelling [44.356294905844834]
We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process.
Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
arXiv Detail & Related papers (2021-09-27T16:28:06Z) - 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) - Adaptive variational quantum eigensolvers for highly excited states [4.038971004196936]
Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization.
We propose an adaptive variational algorithm, adaptive VQE-X, that self-generates a variational ansatz for arbitrary eigenstates of a many-body Hamiltonian $H$.
arXiv Detail & Related papers (2021-04-26T15:03:51Z) - Reinforcement learning for optimization of variational quantum circuit
architectures [2.624902795082451]
We propose a reinforcement learning algorithm that autonomously explores the space of possible ans"atze.
We showcase the performance of our algorithm on the problem of estimating the ground-state energy of lithium hydride (LiH)
arXiv Detail & Related papers (2021-03-30T05:46:21Z) - 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.