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:1801.09720 · Quantum Information Processing

A generalized circuit for the Hamiltonian dynamics through the truncated series

Ammar Daskin, Sabre Kais

Published Oct 22, 2018• 4 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-2099-z

Related papers

Simulating Hamiltonian Dynamics with a Truncated Taylor Series

Rolando D. Somma

Bulletin of the American Physical Society•Mar 4, 2015•0 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

Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series

Mária Kieferová, Artur Scherer, Dominic William Berry

We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model-based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the earlier proposal by Berry et al. [Phys. Rev. Lett. 114, 090502 (2015)] to evolution generated by explicitly time-dependent Hamiltonians. Two alternative strategies are proposed to implement time ordering while exploiting the superposition principle for sampling the Hamiltonian at different times. The resource cost of our simulation algorithm retains the optimal logarithmic dependence on the inverse of the desired precision.

arXiv:1805.00582•Physical Review A•Apr 5, 2019•92 citations

Classical Hamiltonian Dynamics

Mark Linne

Elsevier eBooks•Jan 1, 2002•0 citations

Information in Classical Hamiltonian Dynamics

Thomas Dittrich

The frontiers collection•Jan 1, 2022•0 citations

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
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].
We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model-based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the earlier proposal by Berry et al. [Phys. Rev. Lett. 114, 090502 (2015)] to evolution generated by explicitly time-dependent Hamiltonians. Two alternative strategies are proposed to implement time ordering while exploiting the superposition principle for sampling the Hamiltonian at different times. The resource cost of our simulation algorithm retains the optimal logarithmic dependence on the inverse of the desired precision.
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.