Error Bounds for Variational Quantum Time Evolution
- URL: http://arxiv.org/abs/2108.00022v2
- Date: Tue, 27 Jun 2023 14:11:56 GMT
- Title: Error Bounds for Variational Quantum Time Evolution
- Authors: Christa Zoufal, David Sutter, Stefan Woerner
- Abstract summary: Variational quantum time evolution allows us to simulate the time dynamics of quantum systems with near-term compatible quantum circuits.
Due to the variational nature of this method the accuracy of the simulation is a priori unknown.
We derive global phase error bounds for the state simulation accuracy with variational quantum time evolution.
- Score: 4.38301148531795
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Variational quantum time evolution allows us to simulate the time dynamics of
quantum systems with near-term compatible quantum circuits. Due to the
variational nature of this method the accuracy of the simulation is a priori
unknown. We derive global phase agnostic error bounds for the state simulation
accuracy with variational quantum time evolution that improve the tightness of
fidelity estimates over existing error bounds. These analysis tools are
practically crucial for assessing the quality of the simulation and making
informed choices about simulation hyper-parameters. The efficient, a posteriori
evaluation of the bounds can be tightly integrated with the variational time
simulation and, hence, results in a minor resource overhead which is governed
by the system's energy variance. The performance of the novel error bounds is
demonstrated on numerical examples.
Related papers
- Optimization of Algorithmic Errors in Analog Quantum Simulations [0.0]
This paper examines the interplay of errors arising from simulation of approximate time evolution with those due to practical, real-world device constraints.
Errors are studied in Heisenberg-type systems on analog quantum devices described by the Ising Hamiltonian.
arXiv Detail & Related papers (2023-08-04T18:01:04Z) - Stochastic Approximation of Variational Quantum Imaginary Time Evolution [0.716879432974126]
In quantum computers, the imaginary-time evolution of quantum states is integral to various fields.
Here, we suggest a approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes.
We demonstrate the efficiency of our algorithm in simulations and show a hardware experiment performing the imaginary-time evolution of the transverse field Ising model on 27 qubits.
arXiv Detail & Related papers (2023-05-11T18:00:06Z) - Importance sampling for stochastic quantum simulations [68.8204255655161]
We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients.
We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage.
Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
arXiv Detail & Related papers (2022-12-12T15:06:32Z) - Probing finite-temperature observables in quantum simulators of spin
systems with short-time dynamics [62.997667081978825]
We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality.
We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
arXiv Detail & Related papers (2022-06-03T18:00:02Z) - Fermionic approach to variational quantum simulation of Kitaev spin
models [50.92854230325576]
Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions.
We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation.
We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
arXiv Detail & Related papers (2022-04-11T18:00:01Z) - Error-resilient Monte Carlo quantum simulation of imaginary time [5.625946422295428]
We propose an algorithm for simulating the imaginary-time evolution and solving the ground-state problem.
Compared with quantum phase estimation, the Trotter step number can be thousands of times smaller.
Results show that Monte Carlo quantum simulation is promising even without a fully fault-tolerant quantum computer.
arXiv Detail & Related papers (2021-09-16T08:51:24Z) - 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) - Evaluating low-depth quantum algorithms for time evolution on
fermion-boson systems [0.0]
Simulating time evolution of quantum systems is one of the most promising applications of quantum computing.
We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers.
arXiv Detail & Related papers (2021-06-07T22:03:17Z) - The Variational Method of Moments [65.91730154730905]
conditional moment problem is a powerful formulation for describing structural causal parameters in terms of observables.
Motivated by a variational minimax reformulation of OWGMM, we define a very general class of estimators for the conditional moment problem.
We provide algorithms for valid statistical inference based on the same kind of variational reformulations.
arXiv Detail & Related papers (2020-12-17T07:21:06Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Faster Digital Quantum Simulation by Symmetry Protection [0.6554326244334866]
We show that by introducing quantum gates implementing unitary transformations one can induce destructive interference between the errors from different steps of the simulation.
In particular, when the symmetry transformations are chosen as powers of a unitary, the error of the algorithm is approximately projected to the so-called quantum Zeno subspaces.
We apply the symmetry protection technique to the simulations of the XXZ Heisenberg interactions with local disorder and the Schwinger model in quantum field theory.
arXiv Detail & Related papers (2020-06-29T18:00:00Z)
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.