A simple quantum simulation algorithm with near-optimal precision scaling

Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer from suboptimal scaling with respect to simulation precision, existing simulation techniques are, for the most part, too intricate to implement on early fault-tolerant quantum hardware. We propose a quantum Hamiltonian dynamics simulation algorithm that aims to be both straightforward to implement and, at the same time, have near-optimal scaling in simulation precision.

💡 Research Summary

The paper addresses a central challenge in quantum computing: efficiently simulating Hamiltonian dynamics with high precision on fault‑tolerant hardware. While Trotter‑Suzuki product formulas are simple, they scale poorly with respect to the target error ε, typically requiring O(t²/ε) gate operations. More recent techniques based on quantum signal processing (QSP) and the linear combination of unitaries (LCU) achieve near‑optimal error scaling—often logarithmic in 1/ε—but they demand complex select unitaries, such as multi‑controlled Pauli strings, which are costly to implement on early fault‑tolerant devices.

The authors propose a new algorithm that combines a permutation‑matrix representation (PMR) of the Hamiltonian with the LCU framework, while restricting the elementary gates to CNOTs and controlled phase rotations. The Hamiltonian H is first decomposed as
 H = D₀ + Σ_{i=1}^{M} D_i P_i,
where D_i are diagonal operators (classical energy contributions) and P_i are permutation operators that swap computational basis states (for qubits, strings of Pauli‑X). This decomposition is straightforward for a wide class of physical Hamiltonians, including those arising in quantum chemistry and lattice models.

Time evolution over a total interval t is split into r short steps of duration Δt = t/r. For each step, the authors expand the propagator e^{-iHΔt} as a power series in the off‑diagonal part, yielding a sum over ordered products of the permutation operators P_i and diagonal factors A_{i_q}. The diagonal factors contain divided‑difference exponentials of the form e^{-iΔt}