Pith. sign in

REVIEW 3 cited by

Hamiltonian Simulation in the Interaction Picture Using the Magnus Expansion

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.02966 v1 pith:3L2O3NR4 submitted 2024-04-03 quant-ph

classification quant-ph
keywords magnusalgorithmhamiltonianboundcomputingexpansiongeometricallyinteraction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We propose an algorithm for simulating the dynamics of a geometrically local Hamiltonian $A$ under a small geometrically local perturbation $\alpha B$. In certain regimes, the algorithm achieves the optimal scaling and outperforms the state-of-the-art algorithms. By moving into the interaction frame of $A$ and classically computing the Magnus expansion of the interaction-picture Hamiltonian, our algorithm bypasses the need for ancillary qubits. In analyzing its performance, we develop a framework to capture the quasi-locality of the Magnus operators, leading to a tightened bound for the error of the Magnus truncation. The Lieb-Robinson bound also guarantees the efficiency of computing the Magnus operators and of their subsequent decomposition into elementary quantum gates. These features make our algorithm appealing for near-term and early-fault-tolerant simulations.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. High-order Magnus Expansion for Hamiltonian Simulation

    quant-ph 2025-09 conditional novelty 7.0 of 10

    Arbitrary-order Magnus expansion is shown to have commutator-scaling error bounds and a polynomial-cost quantum circuit, yielding a time-dependent Hamiltonian simulation algorithm with O~(αbar^{1+1/p} T^{1+1/p}/ε^{1/p...

  2. Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer

    quant-ph 2025-06 conditional novelty 7.0 of 10

    An optimized Trotter-based quantum algorithm reduces the estimated cost of simulating X-ray absorption spectra for a Li4Mn2O cathode cluster to 100 logical qubits and 3.1e8 Toffoli gates per circuit.

  3. Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control

    quant-ph 2026-07 conditional novelty 6.0 of 10

    A Heisenberg-picture series of time-independent commutators and nested pulse integrals yields propagator gradients for arbitrary pulse shapes, giving >10× speedup over GOAT on local multi-qubit GHZ tasks.

Pith tools