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

Bulletin of the American Physical Society

Simulating Hamiltonian Dynamics with a Truncated Taylor Series

Rolando D. Somma

Published Mar 4, 2015• 0 citations
OpenAlex

Related papers

A generalized circuit for the Hamiltonian dynamics through the truncated series

Ammar Daskin, Sabre Kais

arXiv:1801.09720•Quantum Information Processing•Oct 22, 2018•4 citations

Taylor expansion of effective Hamiltonians by Monte Carlo simulations with fixed block spins

K. Pinn

The European Physical Journal C•Jun 1, 1990•0 citations

Classical Hamiltonian Dynamics

Mark Linne

Elsevier eBooks•Jan 1, 2002•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

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

Hamiltonian Simulation Techniques

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations
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.
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].