Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2108.00022 · Physical Review Applied

Error bounds for variational quantum time evolution

Christa Zoufal, David Sutter, Stefan Woerner

Published Oct 23, 2023• 40 citations
arXivHTMLPDF

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 a posteriori global phase agnostic error bounds for the state simulation accuracy with variational quantum time evolution that improve the tightness of fidelity estimates over existing a posteriori error bounds. These analysis tools are practically crucial for assessing the quality of the simulation and making informed choices about simulation hyperparameters. 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 error bounds is demonstrated on numerical examples.

DOI
10.1103/physrevapplied.20.044059

Related papers

Mitigating algorithmic errors in quantum optimization through energy extrapolation

Chenfeng Cao, Yunlong Yu, Zipeng Wu +3 more

Abstract Quantum optimization algorithms offer a promising route to finding the ground states of target Hamiltonians on near-term quantum devices. Nonetheless, it remains necessary to limit the evolution time and circuit depth as much as possible, since otherwise decoherence will degrade the computation. Even when this is done, there always exists a non-negligible error in estimates of the ground state energy. Here we present a scalable extrapolation approach to mitigating this algorithmic error, which significantly improves estimates obtained using three well-studied quantum optimization algorithms: quantum annealing (QA), the variational quantum eigensolver, and the quantum imaginary time evolution at fixed evolution time or circuit depth. The approach is based on extrapolating the annealing time to infinity or the variance of estimates to zero. The method is reasonably robust against noise. For Hamiltonians which only involve few-body interactions, the additional computational overhead is an increase in the number of measurements by a constant factor. Analytic derivations are provided for the quadratic convergence of estimates of energy as a function of time in QA, and the linear convergence of estimates as a function of variance in all three algorithms. We have verified the validity of these approaches through both numerical simulation and experiments on IBM quantum machines. This work suggests a promising new way to enhance near-term quantum computing through classical post-processing.

arXiv:2109.08132•Quantum Science and Technology•Sep 30, 2022•24 citations

Theory of variational quantum simulation

Xiao Yuan, Suguru Endo, Qi Zhao +2 more

The variational method is a versatile tool for classical simulation of a variety of quantum systems. Great efforts have recently been devoted to its extension to quantum computing for efficiently solving static many-body problems and simulating real and imaginary time dynamics. In this work, we first review the conventional variational principles, including the Rayleigh-Ritz method for solving static problems, and the Dirac and Frenkel variational principle, the McLachlan's variational principle, and the time-dependent variational principle, for simulating real time dynamics. We focus on the simulation of dynamics and discuss the connections of the three variational principles. Previous works mainly focus on the unitary evolution of pure states. In this work, we introduce variational quantum simulation of mixed states under general stochastic evolution. We show how the results can be reduced to the pure state case with a correction term that takes accounts of global phase alignment. For variational simulation of imaginary time evolution, we also extend it to the mixed state scenario and discuss variational Gibbs state preparation. We further elaborate on the design of ansatz that is compatible with post-selection measurement and the implementation of the generalised variational algorithms with quantum circuits. Our work completes the theory of variational quantum simulation of general real and imaginary time evolution and it is applicable to near-term quantum hardware.

arXiv:1812.08767•Quantum•Oct 7, 2019•513 citations

Stochastic Approximation of Variational Quantum Imaginary Time Evolution

Julien Gacon, Christa Zoufal, Giuseppe Carleo +1 more

The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an exponentially large wave function, quantum computers are emerging as a promising platform for this task. However, variational approaches, suitable for near-term quantum computers, struggle with a prohibitive number of measurements and impractical runtimes for relevant system sizes. Here, we suggest a stochastic approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes. Our approach allows trading off invested resources and accuracy, which makes it also suitable for ground state preparation, where simulating the exact dynamics is not required. 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:2305.07059•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•13 citations

PIQS: an efficient quantum subspace method for dynamical property estimation

Youle Wang, Wenbin Yu, Yanfeng Fan +1 more

Abstract Simulating quantum dynamics to extract time-evolving observables constitutes a central challenge in quantum computing, with both fundamental significance and broad practical applications. Classical approaches suffer from the exponential scaling of Hilbert space, while existing quantum algorithms face limitations from deep circuits and sequential error accumulation on near-term devices. This work introduces a physics-informed quantum subspace method for the efficient estimation of dynamical properties of quantum systems. The core innovation is a globally physics-informed loss function that incorporates the time-dependent Schrödinger equation as a physics-based penalty. This enforces quantum evolution constraints directly during optimization, thereby circumventing the error accumulation inherent in stepwise simulations. By strategically relaxing the normalization constraint, we obtain convexified loss functions whose optimization reduces to solving a linear system, guaranteeing global convergence and significantly mitigating the convergence issues and barren plateaus common in variational quantum algorithms. Theoretically, we prove that under suitable conditions the true dynamical solution can be approximated with high accuracy within a subspace whose dimension scales only as O ( T log ⁡ ( 1 / ε ) ) , thus breaking the curse of dimensionality in classical simulation. Numerical experiments demonstrate that the proposed method outperforms conventional Trotterization and variational quantum benchmarks in terms of computational cost, convergence speed, and robustness against measurement noise, offering a viable and efficient pathway for practical dynamical simulation on noisy intermediate-scale quantum hardware.

Quantum Science and Technology•Jan 29, 2026•0 citations

Error and resource estimates of variational quantum algorithms for solving differential equations based on Runge-Kutta methods

David Dechant, Liubov A. Markovich, Vedran Dunjko +1 more

A focus of recent research in quantum computing has been on developing quantum algorithms for solving differential equations using variational methods on near-term quantum devices. A promising approach involves variational algorithms, which combine classical Runge-Kutta methods with quantum computations. However, a rigorous error analysis, essential for assessing real-world feasibility, has so far been lacking. In this paper, we provide an extensive analysis of error sources and determine the resource requirements needed to achieve specific target errors. In particular, we derive analytical error and resource estimates for scenarios with and without shot noise, examining shot noise in quantum measurements and truncation errors in Runge-Kutta methods. Our analysis does not take into account representation errors and hardware noise, as these are specific to the instance and the used device. We evaluate the implications of our results by applying them to two scenarios: classically solving a 1D ordinary differential equation and solving an option pricing linear partial differential equation with the variational algorithm, showing that the most resource-efficient methods are of order 4 and 2, respectively. This work provides a framework for optimizing quantum resources when applying Runge-Kutta methods, enhancing their efficiency and accuracy in both solving differential equations and simulating quantum systems.

arXiv:2412.12262•Journal of Mathematical Physics•Jan 1, 2026•0 citations

Evaluating low-depth quantum algorithms for time evolution on fermion-boson systems

Nathan Fitzpatrick, Harriet Apel, David Muñoz Ramo

Simulating time evolution of quantum systems is one of the most promising applications of quantum computing and also appears as a subroutine in many applications such as Green's function methods. In the current era of NISQ machines we assess the state of algorithms for simulating time dynamics with limited resources. We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers. Using these simple models, direct Trotterisation of the time evolution operator produces deep circuits, requiring coherence times out of reach on current NISQ hardware. Therefore we test two alternative responses to this problem: variational compilation of the time evolution operator, and variational quantum simulation of the wavefunction ansatz. We demonstrate numerically to what extent these methods are successful in time evolving this system. The costs in terms of circuit depth and number of measurements are compared quantitatively, along with other drawbacks and advantages of each method. We find that computational requirements for both methods make them suitable for performing time evolution simulations of our models on NISQ hardware. Our results also indicate that variational quantum compilation produces more accurate results than variational quantum simulation, at the cost of a larger number of measurements.

arXiv:2106.03985•Jun 7, 2021•11 citations
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 a posteriori global phase agnostic error bounds for the state simulation accuracy with variational quantum time evolution that improve the tightness of fidelity estimates over existing a posteriori error bounds. These analysis tools are practically crucial for assessing the quality of the simulation and making informed choices about simulation hyperparameters. 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 error bounds is demonstrated on numerical examples.
Abstract Quantum optimization algorithms offer a promising route to finding the ground states of target Hamiltonians on near-term quantum devices. Nonetheless, it remains necessary to limit the evolution time and circuit depth as much as possible, since otherwise decoherence will degrade the computation. Even when this is done, there always exists a non-negligible error in estimates of the ground state energy. Here we present a scalable extrapolation approach to mitigating this algorithmic error, which significantly improves estimates obtained using three well-studied quantum optimization algorithms: quantum annealing (QA), the variational quantum eigensolver, and the quantum imaginary time evolution at fixed evolution time or circuit depth. The approach is based on extrapolating the annealing time to infinity or the variance of estimates to zero. The method is reasonably robust against noise. For Hamiltonians which only involve few-body interactions, the additional computational overhead is an increase in the number of measurements by a constant factor. Analytic derivations are provided for the quadratic convergence of estimates of energy as a function of time in QA, and the linear convergence of estimates as a function of variance in all three algorithms. We have verified the validity of these approaches through both numerical simulation and experiments on IBM quantum machines. This work suggests a promising new way to enhance near-term quantum computing through classical post-processing.
The variational method is a versatile tool for classical simulation of a variety of quantum systems. Great efforts have recently been devoted to its extension to quantum computing for efficiently solving static many-body problems and simulating real and imaginary time dynamics. In this work, we first review the conventional variational principles, including the Rayleigh-Ritz method for solving static problems, and the Dirac and Frenkel variational principle, the McLachlan's variational principle, and the time-dependent variational principle, for simulating real time dynamics. We focus on the simulation of dynamics and discuss the connections of the three variational principles. Previous works mainly focus on the unitary evolution of pure states. In this work, we introduce variational quantum simulation of mixed states under general stochastic evolution. We show how the results can be reduced to the pure state case with a correction term that takes accounts of global phase alignment. For variational simulation of imaginary time evolution, we also extend it to the mixed state scenario and discuss variational Gibbs state preparation. We further elaborate on the design of ansatz that is compatible with post-selection measurement and the implementation of the generalised variational algorithms with quantum circuits. Our work completes the theory of variational quantum simulation of general real and imaginary time evolution and it is applicable to near-term quantum hardware.
The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an exponentially large wave function, quantum computers are emerging as a promising platform for this task. However, variational approaches, suitable for near-term quantum computers, struggle with a prohibitive number of measurements and impractical runtimes for relevant system sizes. Here, we suggest a stochastic approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes. Our approach allows trading off invested resources and accuracy, which makes it also suitable for ground state preparation, where simulating the exact dynamics is not required. 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.
Abstract Simulating quantum dynamics to extract time-evolving observables constitutes a central challenge in quantum computing, with both fundamental significance and broad practical applications. Classical approaches suffer from the exponential scaling of Hilbert space, while existing quantum algorithms face limitations from deep circuits and sequential error accumulation on near-term devices. This work introduces a physics-informed quantum subspace method for the efficient estimation of dynamical properties of quantum systems. The core innovation is a globally physics-informed loss function that incorporates the time-dependent Schrödinger equation as a physics-based penalty. This enforces quantum evolution constraints directly during optimization, thereby circumventing the error accumulation inherent in stepwise simulations. By strategically relaxing the normalization constraint, we obtain convexified loss functions whose optimization reduces to solving a linear system, guaranteeing global convergence and significantly mitigating the convergence issues and barren plateaus common in variational quantum algorithms. Theoretically, we prove that under suitable conditions the true dynamical solution can be approximated with high accuracy within a subspace whose dimension scales only as O ( T log ⁡ ( 1 / ε ) ) , thus breaking the curse of dimensionality in classical simulation. Numerical experiments demonstrate that the proposed method outperforms conventional Trotterization and variational quantum benchmarks in terms of computational cost, convergence speed, and robustness against measurement noise, offering a viable and efficient pathway for practical dynamical simulation on noisy intermediate-scale quantum hardware.
A focus of recent research in quantum computing has been on developing quantum algorithms for solving differential equations using variational methods on near-term quantum devices. A promising approach involves variational algorithms, which combine classical Runge-Kutta methods with quantum computations. However, a rigorous error analysis, essential for assessing real-world feasibility, has so far been lacking. In this paper, we provide an extensive analysis of error sources and determine the resource requirements needed to achieve specific target errors. In particular, we derive analytical error and resource estimates for scenarios with and without shot noise, examining shot noise in quantum measurements and truncation errors in Runge-Kutta methods. Our analysis does not take into account representation errors and hardware noise, as these are specific to the instance and the used device. We evaluate the implications of our results by applying them to two scenarios: classically solving a 1D ordinary differential equation and solving an option pricing linear partial differential equation with the variational algorithm, showing that the most resource-efficient methods are of order 4 and 2, respectively. This work provides a framework for optimizing quantum resources when applying Runge-Kutta methods, enhancing their efficiency and accuracy in both solving differential equations and simulating quantum systems.
Simulating time evolution of quantum systems is one of the most promising applications of quantum computing and also appears as a subroutine in many applications such as Green's function methods. In the current era of NISQ machines we assess the state of algorithms for simulating time dynamics with limited resources. We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers. Using these simple models, direct Trotterisation of the time evolution operator produces deep circuits, requiring coherence times out of reach on current NISQ hardware. Therefore we test two alternative responses to this problem: variational compilation of the time evolution operator, and variational quantum simulation of the wavefunction ansatz. We demonstrate numerically to what extent these methods are successful in time evolving this system. The costs in terms of circuit depth and number of measurements are compared quantitatively, along with other drawbacks and advantages of each method. We find that computational requirements for both methods make them suitable for performing time evolution simulations of our models on NISQ hardware. Our results also indicate that variational quantum compilation produces more accurate results than variational quantum simulation, at the cost of a larger number of measurements.