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

Mathematics of Computation

Simulating Hamiltonian dynamics.

Ernst Hairer, Gerhard Wanner

Published Jan 1, 2006• 0 citations
OpenAlex

Related papers

Simulating Hamiltonian Dynamics with a Truncated Taylor Series

Rolando D. Somma

Bulletin of the American Physical Society•Mar 4, 2015•0 citations

Simplifying the simulation of local Hamiltonian dynamics

Ayaka Usui, Anna Sanpera, María García Díaz

Local Hamiltonians H k describe nontrivial k -body interactions in quantum many-body systems. Here, we address the dynamical simulatability of a k -local Hamiltonian by a simpler one H k ′ with k ′ < k , under the realistic constraint that both Hamiltonians act on the same Hilbert space. When it comes to exact simulation, we build upon known methods to derive examples of H k and H k ′ that simulate the same physics. We also address the most realistic case of approximate simulation. There, we upper-bound the error up to which a Hamiltonian can simulate another one, regardless of their internal structure, and show an example suggesting that the accuracy of a ( k ′ = 2 ) -local Hamiltonian to simulate H k with k > 2 increases with k . Finally, we propose a method to search for the k ′ -local Hamiltonian that simulates, with the highest possible precision, the short time dynamics of a given H k Hamiltonian. Published by the American Physical Society 2024

arXiv:2310.07054•Physical Review Research•Jun 4, 2024•3 citations

Hamiltonian Simulation Techniques

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations

Quantum simulation of Hamiltonian dynamics

Riccardo Manenti, Mário Motta

Abstract This chapter presents some quantum algorithms to simulate the dynamics of a quantum system, one of the most important applications of a quantum computer. We introduce the conditions for efficient simulation of Hamiltonian dynamics. We then present some Trotterization methods, in which the time evolution operator is approximated as a product of terms, each of which can be implemented by a quantum circuit at polynomial cost. We show high-order decompositions and illustrate the use of a Trotterization method to simulate sparse Hamiltonians. We discuss the Taylor series method and the qubitization method. The latter achieves optimal cost in simulation time and target accuracy. We conclude the chapter with a proof that simulating Hamiltonian dynamics is BQP-complete

Oxford University Press eBooks•Aug 25, 2023•0 citations

MODEL HAMILTONIANS

WORLD SCIENTIFIC eBooks•Nov 1, 1990•0 citations

Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation

Benjamin Commeau, Marco Cerezo, Zoë Holmes +3 more

Dynamical quantum simulation may be one of the first applications to see quantum advantage. However, the circuit depth of standard Trotterization methods can rapidly exceed the coherence time of noisy quantum computers. This has led to recent proposals for variational approaches to dynamical simulation. In this work, we aim to make variational dynamical simulation even more practical and near-term. We propose a new algorithm called Variational Hamiltonian Diagonalization (VHD), which approximately transforms a given Hamiltonian into a diagonal form that can be easily exponentiated. VHD allows for fast forwarding, i.e., simulation beyond the coherence time of the quantum computer with a fixed-depth quantum circuit. It also removes Trotterization error and allows simulation of the entire Hilbert space. We prove an operational meaning for the VHD cost function in terms of the average simulation fidelity. Moreover, we prove that the VHD cost function does not exhibit a shallow-depth barren plateau, i.e., its gradient does not vanish exponentially. Our proof relies on locality of the Hamiltonian, and hence we connect locality to trainability. Our numerical simulations verify that VHD can be used for fast-forwarding dynamics.

arXiv:2009.02559•Bulletin of the American Physical Society•Sep 5, 2020•91 citations
Local Hamiltonians H k describe nontrivial k -body interactions in quantum many-body systems. Here, we address the dynamical simulatability of a k -local Hamiltonian by a simpler one H k ′ with k ′ < k , under the realistic constraint that both Hamiltonians act on the same Hilbert space. When it comes to exact simulation, we build upon known methods to derive examples of H k and H k ′ that simulate the same physics. We also address the most realistic case of approximate simulation. There, we upper-bound the error up to which a Hamiltonian can simulate another one, regardless of their internal structure, and show an example suggesting that the accuracy of a ( k ′ = 2 ) -local Hamiltonian to simulate H k with k > 2 increases with k . Finally, we propose a method to search for the k ′ -local Hamiltonian that simulates, with the highest possible precision, the short time dynamics of a given H k Hamiltonian. Published by the American Physical Society 2024
Abstract This chapter presents some quantum algorithms to simulate the dynamics of a quantum system, one of the most important applications of a quantum computer. We introduce the conditions for efficient simulation of Hamiltonian dynamics. We then present some Trotterization methods, in which the time evolution operator is approximated as a product of terms, each of which can be implemented by a quantum circuit at polynomial cost. We show high-order decompositions and illustrate the use of a Trotterization method to simulate sparse Hamiltonians. We discuss the Taylor series method and the qubitization method. The latter achieves optimal cost in simulation time and target accuracy. We conclude the chapter with a proof that simulating Hamiltonian dynamics is BQP-complete
Dynamical quantum simulation may be one of the first applications to see quantum advantage. However, the circuit depth of standard Trotterization methods can rapidly exceed the coherence time of noisy quantum computers. This has led to recent proposals for variational approaches to dynamical simulation. In this work, we aim to make variational dynamical simulation even more practical and near-term. We propose a new algorithm called Variational Hamiltonian Diagonalization (VHD), which approximately transforms a given Hamiltonian into a diagonal form that can be easily exponentiated. VHD allows for fast forwarding, i.e., simulation beyond the coherence time of the quantum computer with a fixed-depth quantum circuit. It also removes Trotterization error and allows simulation of the entire Hilbert space. We prove an operational meaning for the VHD cost function in terms of the average simulation fidelity. Moreover, we prove that the VHD cost function does not exhibit a shallow-depth barren plateau, i.e., its gradient does not vanish exponentially. Our proof relies on locality of the Hamiltonian, and hence we connect locality to trainability. Our numerical simulations verify that VHD can be used for fast-forwarding dynamics.