Simulating Hamiltonian dynamics with a truncated Taylor series
read the original abstract
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 to directly apply the truncated Taylor series.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
Twirled perfect tensor networks are introduced as a class satisfying computational covariance, bounding complexity by the Python's Lunch Conjecture exponent, and combining holographic features of perfect and random te...
-
Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\'er Filtering
CE-QAOA with finite layers achieves dimension-free success probability bounds q0 ≥ x/(1+x) via Fejér filtering under a wrapped phase-separation condition.
-
Quantum Algorithms for Simulating Nuclear Effective Field Theories
Resource estimates for quantum simulation of pionless and pionful nuclear lattice EFTs, including time evolution and energy estimation, with new error bounds from symmetries and locality yielding orders-of-magnitude i...
-
Unitaria: Quantum Linear Algebra via Block Encodings
Unitaria is a new open-source Python library that provides a high-level, composable interface for block encodings in quantum computing, enabling automatic circuit generation and classical simulation-based verification.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.