pith. sign in

arxiv: 1805.00675 · v2 · pith:ZYLKWH3Unew · submitted 2018-05-02 · 🪐 quant-ph

Hamiltonian Simulation in the Interaction Picture

classification 🪐 quant-ph
keywords simulatingtime-dependentalgorithmcomplexityhamiltonianhamiltoniansimprovementinteraction
0
0 comments X
read the original abstract

We present a low-space overhead simulation algorithm based on the truncated Dyson series for time-dependent quantum dynamics. This algorithm is applied to simulating time-independent Hamiltonians by transitioning to the interaction picture, where some portions are made time-dependent. This can provide a favorable complexity trade-off as the algorithm scales exponentially better with derivatives of the time-dependent component than the original Hamiltonian. We show that this leads to an exponential improvement in gate complexity for simulating some classes of diagonally dominant Hamiltonian. Additionally we show that this can reduce the gate-complexity scaling for simulating $N$-site Hubbard models for time $t$ with arbitrary long-range interactions as well as reduce the cost of quantum chemistry simulations within a similar-sized plane-wave basis to $\widetilde{\mathcal{O}}(N^2t)$ from $\widetilde{\mathcal{O}}(N^{11/3}t)$. We also show a quadratic improvement in query complexity for simulating sparse time-dependent Hamiltonians, which may be of independent interest.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems

    quant-ph 2026-05 conditional novelty 8.0

    Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.

  2. Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing

    quant-ph 2026-05 unverdicted novelty 7.0

    Bivariate quantum signal processing simulates non-Hermitian Hamiltonians H_eff = H_R + i H_I with query-optimal complexity O((α_R + β_I)T + log(1/ε)/log log(1/ε)) in the separate-oracle model.

  3. Quantum simulation of electronic structure via quantum fast multipole method

    quant-ph 2025-10 conditional novelty 7.0

    Quantum fast multipole method yields electronic structure simulation gate complexity t(η^{4/3}N^{1/3} + η^{1/3}N^{2/3})(η N t / ε)^{o(1)}, providing roughly O(η) speedup over prior work for N < η^7.

  4. Matrix Product Operator Encodings of the Magnus Expansion and Dyson Series

    quant-ph 2026-05 unverdicted novelty 6.0

    Introduces MPO encodings of the Magnus expansion and Dyson series for arbitrary-order accurate time evolution in 1D quantum lattices with time-dependent Hamiltonians, applicable to finite/infinite systems and long-ran...

  5. Trotterization with Many-body Coulomb Interactions: Convergence for General Initial Conditions and State-Dependent Improvements

    quant-ph 2026-04 unverdicted novelty 6.0

    Second-order Trotterization of many-body Coulomb Hamiltonians achieves a 1/4 convergence rate for general initial conditions in the Hamiltonian domain with polynomial particle-number scaling, and improves to first or ...

  6. Quantum Gibbs sampling through the detectability lemma

    quant-ph 2026-04 conditional novelty 6.0

    Detectability lemma enables Gibbs sampling without Lindbladian simulation, yielding O(M) cost reduction for M-term local Lindbladians and quadratic speedup in spectral gap for frustration-free and commuting cases.

  7. Quantum Simulation of Non-Unitary Dynamics via Amplitude-Phase Separation

    quant-ph 2026-02 unverdicted novelty 6.0

    Introduces Amplitude-Phase Separation (APS) decomposition for quantum simulation of non-unitary dynamics, with complementary error scaling advantages in time-independent cases and unification of prior methods like LCH...

  8. Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition

    quant-ph 2025-11 unverdicted novelty 6.0

    CBMD decomposes non-Hermitian operators via contour residues to enable optimal-query quantum simulation of first-order dynamics and special functions such as Bessel and Airy evolutions without requiring diagonalizability.

  9. Quantum Algorithms for Simulating Nuclear Effective Field Theories

    quant-ph 2023-12 unverdicted novelty 6.0

    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...

  10. Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State

    physics.chem-ph 2025-09 unverdicted novelty 2.0

    Review of quantum computing methods and potential for non-ground-state quantum chemistry including reaction dynamics, mechanisms, and finite temperatures.

  11. Quantum simulation of out-of-equilibrium dynamics in gauge theories

    quant-ph 2025-09 unverdicted novelty 2.0

    The paper reviews advances in quantum simulation of out-of-equilibrium dynamics in gauge theories, covering particle production, string breaking, thermalization, and related phenomena.