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:2412.08719 · Physical Review A

Short-time simulation of quantum dynamics by Pauli measurements

Paul K. Faehrmann, Jens Eisert, Mária Kieferová, Richard Kueng

Published Jun 12, 2025• 7 citations
arXivHTMLPDF

Abstract

Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here we propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical postprocessing using a truncated Taylor series approach. While limited to short simulation times, our hybrid quantum-classical method is equipped with rigorous error bounds. It is extendable to estimate low-order Taylor approximations of smooth time-dependent functions of tractable linear combinations of measurable operators. These insights can be made use of in the context of Hamiltonian learning and device verification, short-time imaginary-time evolution, or the application of intractable operations to subuniversal quantum simulators in classical postprocessing.

DOI
10.1103/6ggs-y392

Related papers

Simulating Hamiltonian Dynamics with a Truncated Taylor Series

Dominic William Berry, Andrew M. Childs, Richard Cleve +2 more

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations together with a robust form of oblivious amplitude amplification.

arXiv:1412.4687•Physical Review Letters•Mar 3, 2015•850 citations

A hybrid method for quantum dynamics simulation

Niladri Gomes, Jia Yin, Siyuan Niu +2 more

We propose a hybrid approach to simulate quantum many-body dynamics by combining Trotter-based quantum evolution with classical dynamic mode decomposition. In quantum simulation, the interest often lies in estimating observables rather than explicitly obtaining the wave function. Instead of characterizing a quantum state, our method predicts observables of the quantum state at later times by using data from a set of short-time measurements from a quantum computer. For a fixed set of measurements, the global error bound for our method scales at most as $\mathcal{O}(t^{3/2})$, with constants determined by the DMD approximation error and the conditioning of the learned modes. We apply our method to quench dynamics in the Hubbard model and nearest neighbor spin systems and show that the observable properties can be predicted up to a reasonable error by controlling the number of data points obtained from the quantum measurements.

arXiv:2307.15231•Jul 27, 2023•6 citations

Classical Algorithms for Hamiltonian Dynamics Mean Value and Guided Local Hamiltonian Problem

Yusen Wu, Yukun Zhang, Wang, Chuan +1 more

The efficient simulation of quantum dynamics and ground states is a central challenge in physics and a key frontier for quantum advantage. While short-time evolution in one-dimensional systems can often be simulated classically, extending this to higher dimensions remains difficult. Here, we introduce an efficient classical algorithm for simulating the short-time dynamics of arbitrary local quantum systems. For any local Hamiltonian $H$ and constant evolution time $t$, our method estimates expectation values of the form $\langleψ|e^{iHt}Oe^{-iHt}|ψ\rangle$ for global Pauli observables $O$ and stabilizer states $|ψ\rangle$, with high precision and exponentially small failure probability. Furthermore, we present a classical dequantization of a tailored quantum algorithm that efficiently solves the guided local Hamiltonian (GLH) problem to constant additive error - previously considered classically hard and hence a promising candidate for quantum computational advantage. These results reveal unexpected classical tractability in constant-time quantum dynamics and fundamental connections between Hamiltonian dynamics mean value and the GLH problem. Our work refines the boundary between classical and quantum computational power, identifying sharper criteria for regimes where quantum advantage may genuinely emerge.

arXiv:2409.04161•Sep 6, 2024•8 citations

Classical Simulation of Short-Time Quantum Dynamics

Dominik S. Wild, Alvaro Martin Alhambra

Recent progress in the development of quantum technologies has enabled the direct investigation of the dynamics of increasingly complex quantum many-body systems.This motivates the study of the complexity of classical algorithms for this problem in order to benchmark quantum simulators and to delineate the regime of quantum advantage.Here, we present classical algorithms for approximating the dynamics of local observables and nonlocal quantities such as the Loschmidt echo, where the evolution is governed by a local Hamiltonian.For short times, their computational cost scales polynomially with the system size and the inverse of the approximation error.In the case of local observables, the proposed algorithm has a better dependence on the approximation error than algorithms based on the Lieb-Robinson bound.Our results use cluster-expansion techniques adapted to the dynamical setting, for which we give a novel proof of their convergence.This has important physical consequences besides our efficient algorithms.In particular, we establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.

arXiv:2210.11490•PRX Quantum•Jun 12, 2023•42 citations

Shorter width truncated Taylor series for Hamiltonian dynamics simulations

Michelle Wynne Sze, David Zsolt Manrique, David Muñoz Ramo +1 more

As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order $K$) makes a good candidate for simulating Hamiltonian dynamics. Here, we adapt the method but present an alternative quantum circuit that maintains an equivalent asymptotic elementary gate cost but has an exponentially reduced number of ancilla qubits. This is realized by utilizing mid-circuit measurements (with early abort-and-restart of circuit execution), and transforming a series of multi-controlled$(H^k)$ to a series of singly-controlled$(H^{k'})$, where $H$ is a linear combination of unitaries and $k, k'$ are integers. The proposed circuit utilizes a total of $\lceil \log(K) \rceil + \lceil \log(L) \rceil +n$ qubits, where $L$ is the number of terms in the Hamiltonian and $n$ is the system qubit size. Our shorter width circuit with mid-measurements protocol is implemented and evaluated using the programming language Guppy[2,3].

quant-pharXiv:2511.09461•Nov 13, 2025•1 citation

A probabilistic quantum algorithm for imaginary-time evolution based on Taylor expansion

Xin Yi, Jingyu Huo, Guanhua Liu +3 more

Imaginary-time evolution is a powerful tool for obtaining the ground state of a quantum system, but the complexity of classical algorithms designed for simulating imaginary-time evolution will increase significantly as the size of the quantum system becomes larger. Here, a probabilistic quantum algorithm based on Taylor expansion for implementing imaginary-time evolution is introduced. For Hamiltonians composed of Pauli product terms, the quantum circuit requires only a single ancillary qubit and is exclusively constructed using elementary single-qubit and two-qubit gates. Furthermore, similar principles are used to extend the algorithm to the case where the Hamiltonian takes a more general form. The algorithm only requires negligible precomputed numerical calculations, without the need for complex classical pre-mathematical calculations or optimization loops. We demonstrate the algorithm by solving the ground state energy of hydrogen molecules and Heisenberg Hamiltonians. Moreover, we conducted experiments on real quantum computers through the quantum cloud platform to find the ground state energy of Heisenberg Hamiltonians. Our work extends the methods for realizing imaginary-time evolution on quantum computers, and our algorithm exhibits potential for implementation on near-term quantum devices, particularly when the Hamiltonian consists of Pauli product terms.

EPJ Quantum Technology•Apr 3, 2025•18 citations
Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here we propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical postprocessing using a truncated Taylor series approach. While limited to short simulation times, our hybrid quantum-classical method is equipped with rigorous error bounds. It is extendable to estimate low-order Taylor approximations of smooth time-dependent functions of tractable linear combinations of measurable operators. These insights can be made use of in the context of Hamiltonian learning and device verification, short-time imaginary-time evolution, or the application of intractable operations to subuniversal quantum simulators in classical postprocessing.
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations together with a robust form of oblivious amplitude amplification.
We propose a hybrid approach to simulate quantum many-body dynamics by combining Trotter-based quantum evolution with classical dynamic mode decomposition. In quantum simulation, the interest often lies in estimating observables rather than explicitly obtaining the wave function. Instead of characterizing a quantum state, our method predicts observables of the quantum state at later times by using data from a set of short-time measurements from a quantum computer. For a fixed set of measurements, the global error bound for our method scales at most as O(t3/2)\mathcal{O}(t^{3/2})O(t3/2), with constants determined by the DMD approximation error and the conditioning of the learned modes. We apply our method to quench dynamics in the Hubbard model and nearest neighbor spin systems and show that the observable properties can be predicted up to a reasonable error by controlling the number of data points obtained from the quantum measurements.
The efficient simulation of quantum dynamics and ground states is a central challenge in physics and a key frontier for quantum advantage. While short-time evolution in one-dimensional systems can often be simulated classically, extending this to higher dimensions remains difficult. Here, we introduce an efficient classical algorithm for simulating the short-time dynamics of arbitrary local quantum systems. For any local Hamiltonian HHH and constant evolution time ttt, our method estimates expectation values of the form ⟨ψ∣eiHtOe−iHt∣ψ⟩\langleψ|e^{iHt}Oe^{-iHt}|ψ\rangle⟨ψ∣eiHtOe−iHt∣ψ⟩ for global Pauli observables OOO and stabilizer states ∣ψ⟩|ψ\rangle∣ψ⟩, with high precision and exponentially small failure probability. Furthermore, we present a classical dequantization of a tailored quantum algorithm that efficiently solves the guided local Hamiltonian (GLH) problem to constant additive error - previously considered classically hard and hence a promising candidate for quantum computational advantage. These results reveal unexpected classical tractability in constant-time quantum dynamics and fundamental connections between Hamiltonian dynamics mean value and the GLH problem. Our work refines the boundary between classical and quantum computational power, identifying sharper criteria for regimes where quantum advantage may genuinely emerge.
Recent progress in the development of quantum technologies has enabled the direct investigation of the dynamics of increasingly complex quantum many-body systems.This motivates the study of the complexity of classical algorithms for this problem in order to benchmark quantum simulators and to delineate the regime of quantum advantage.Here, we present classical algorithms for approximating the dynamics of local observables and nonlocal quantities such as the Loschmidt echo, where the evolution is governed by a local Hamiltonian.For short times, their computational cost scales polynomially with the system size and the inverse of the approximation error.In the case of local observables, the proposed algorithm has a better dependence on the approximation error than algorithms based on the Lieb-Robinson bound.Our results use cluster-expansion techniques adapted to the dynamical setting, for which we give a novel proof of their convergence.This has important physical consequences besides our efficient algorithms.In particular, we establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order KKK) makes a good candidate for simulating Hamiltonian dynamics. Here, we adapt the method but present an alternative quantum circuit that maintains an equivalent asymptotic elementary gate cost but has an exponentially reduced number of ancilla qubits. This is realized by utilizing mid-circuit measurements (with early abort-and-restart of circuit execution), and transforming a series of multi-controlled(Hk)(H^k)(Hk) to a series of singly-controlled(Hk′)(H^{k'})(Hk′), where HHH is a linear combination of unitaries and k,k′k, k'k,k′ are integers. The proposed circuit utilizes a total of ⌈log⁡(K)⌉+⌈log⁡(L)⌉+n\lceil \log(K) \rceil + \lceil \log(L) \rceil +n⌈log(K)⌉+⌈log(L)⌉+n qubits, where LLL is the number of terms in the Hamiltonian and nnn is the system qubit size. Our shorter width circuit with mid-measurements protocol is implemented and evaluated using the programming language Guppy[2,3].
Imaginary-time evolution is a powerful tool for obtaining the ground state of a quantum system, but the complexity of classical algorithms designed for simulating imaginary-time evolution will increase significantly as the size of the quantum system becomes larger. Here, a probabilistic quantum algorithm based on Taylor expansion for implementing imaginary-time evolution is introduced. For Hamiltonians composed of Pauli product terms, the quantum circuit requires only a single ancillary qubit and is exclusively constructed using elementary single-qubit and two-qubit gates. Furthermore, similar principles are used to extend the algorithm to the case where the Hamiltonian takes a more general form. The algorithm only requires negligible precomputed numerical calculations, without the need for complex classical pre-mathematical calculations or optimization loops. We demonstrate the algorithm by solving the ground state energy of hydrogen molecules and Heisenberg Hamiltonians. Moreover, we conducted experiments on real quantum computers through the quantum cloud platform to find the ground state energy of Heisenberg Hamiltonians. Our work extends the methods for realizing imaginary-time evolution on quantum computers, and our algorithm exhibits potential for implementation on near-term quantum devices, particularly when the Hamiltonian consists of Pauli product terms.