pith. sign in

hub

Hamiltonian Simulation in the Interaction Picture

15 Pith papers cite this work. Polarity classification is still indexing.

15 Pith papers citing it
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.

hub tools

citation-role summary

background 2 method 2

citation-polarity summary

representative citing papers

Low-ancilla block encodings via Hamiltonian simulation

quant-ph · 2026-07-02 · unverdicted · novelty 6.0

Single-ancilla approximate block encoding of A = sum alpha_j H_j is achieved via generalized quantum signal processing applied to Hamiltonian simulation, yielding near-optimal depth with one or O(log log(1/epsilon)) ancilla.

Quantum Algorithms for Simulating Nuclear Effective Field Theories

quant-ph · 2023-12-08 · 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 improvements for the pionless case.

Quantum Gibbs sampling through the detectability lemma

quant-ph · 2026-04-08 · 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.

Nanostructure modelling with early fault tolerant quantum computers

quant-ph · 2026-06-04 · unverdicted · novelty 5.0

Quantum simulation framework for ground-state energies of 4- and 8-electron double quantum dots on surface-code fault-tolerant hardware, with resource estimates of 226k-314k physical qubits and 24 hours to 3.4 days runtime at 10^{-3} noise.

citing papers explorer

Showing 15 of 15 citing papers.