An efficient quantum algorithm for the time evolution of parameterized
circuits
- URL: http://arxiv.org/abs/2101.04579v3
- Date: Fri, 23 Jul 2021 08:21:06 GMT
- Title: An efficient quantum algorithm for the time evolution of parameterized
circuits
- Authors: Stefano Barison and Filippo Vicentini and Giuseppe Carleo
- Abstract summary: We introduce a novel hybrid algorithm to simulate the real-time evolution of quantum systems.
We show that our approach is particularly advantageous over existing global optimization algorithms.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce a novel hybrid algorithm to simulate the real-time evolution of
quantum systems using parameterized quantum circuits. The method, named
"projected - Variational Quantum Dynamics" (p-VQD) realizes an iterative,
global projection of the exact time evolution onto the parameterized manifold.
In the small time-step limit, this is equivalent to the McLachlan's variational
principle. Our approach is efficient in the sense that it exhibits an optimal
linear scaling with the total number of variational parameters. Furthermore, it
is global in the sense that it uses the variational principle to optimize all
parameters at once. The global nature of our approach then significantly
extends the scope of existing efficient variational methods, that instead
typically rely on the iterative optimization of a restricted subset of
variational parameters. Through numerical experiments, we also show that our
approach is particularly advantageous over existing global optimization
algorithms based on the time-dependent variational principle that, due to a
demanding quadratic scaling with parameter numbers, are unsuitable for large
parameterized quantum circuits.
Related papers
- Variational approach to photonic quantum circuits via the parameter shift rule [0.0]
We derive a formulation of the parameter shift rule for reconfigurable optical linear circuits based on the Boson Sampling paradigm.
We also present similar rules for the computations of integrals over the variational parameters.
We employ the developed approach to experimentally test variational algorithms with single-photon states processed in a reconfigurable 6-mode universal integrated interferometer.
arXiv Detail & Related papers (2024-10-09T15:06:17Z) - Optimizing a parameterized controlled gate with Free Quaternion Selection [0.4353365283165517]
In this study, we propose an algorithm to estimate the optimal parameters for locally minimizing the cost value of a single-qubit gate.
To benchmark the performance, we apply the proposed method to various optimization problems, including the Variational Eigensolver (VQE) for Ising and molecular Hamiltonians.
arXiv Detail & Related papers (2024-09-20T14:46:00Z) - Global optimization in variational quantum algorithms via dynamic tunneling method [2.156170153103442]
We adapt the conventional dynamic tunneling flow to exploit the distance measure of quantum states.
Our global optimization algorithm is applied to the variational quantum eigensolver for the transverse-field Ising model.
arXiv Detail & Related papers (2024-05-29T05:56:44Z) - Parsimonious Optimisation of Parameters in Variational Quantum Circuits [1.303764728768944]
We propose a novel Quantum-Gradient Sampling that requires the execution of at most two circuits per iteration to update the optimisable parameters.
Our proposed method achieves similar convergence rates to classical gradient descent, and empirically outperforms gradient coordinate descent, and SPSA.
arXiv Detail & Related papers (2023-06-20T18:50:18Z) - Manifold Gaussian Variational Bayes on the Precision Matrix [70.44024861252554]
We propose an optimization algorithm for Variational Inference (VI) in complex models.
We develop an efficient algorithm for Gaussian Variational Inference whose updates satisfy the positive definite constraint on the variational covariance matrix.
Due to its black-box nature, MGVBP stands as a ready-to-use solution for VI in complex models.
arXiv Detail & Related papers (2022-10-26T10:12:31Z) - Simulating Time Evolution with Fully Optimized Single-Qubit Gates on
Parameterized Quantum Circuits [3.5462326830737805]
We propose a novel method to sequentially optimize arbitrary single-qubit gates in parameterized quantum circuits.
We show the method can be applied to real time evolution and discuss the tradeoff between its simulation accuracy and hardware efficiency.
arXiv Detail & Related papers (2021-11-10T05:46: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) - Online hyperparameter optimization by real-time recurrent learning [57.01871583756586]
Our framework takes advantage of the analogy between hyperparameter optimization and parameter learning in neural networks (RNNs)
It adapts a well-studied family of online learning algorithms for RNNs to tune hyperparameters and network parameters simultaneously.
This procedure yields systematically better generalization performance compared to standard methods, at a fraction of wallclock time.
arXiv Detail & Related papers (2021-02-15T19:36:18Z) - Direct Optimal Control Approach to Laser-Driven Quantum Particle
Dynamics [77.34726150561087]
We propose direct optimal control as a robust and flexible alternative to indirect control theory.
The method is illustrated for the case of laser-driven wavepacket dynamics in a bistable potential.
arXiv Detail & Related papers (2020-10-08T07:59:29Z) - 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) - Cross Entropy Hyperparameter Optimization for Constrained Problem
Hamiltonians Applied to QAOA [68.11912614360878]
Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications.
Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem.
In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
arXiv Detail & Related papers (2020-03-11T13:52:41Z)
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.