Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation
arXiv:2502.20255 · doi:10.1007/s00220-025-05531-y
Abstract
Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. In this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points , and show that it holds with an error constant uniform in . The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.
References in corpus (35)
- The Magnus expansion and some of its applications
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
- Nearly optimal lattice simulation by product formulas
- Black-box quantum state preparation without arithmetic
- Time-dependent Hamiltonian simulation with -norm scaling
- Hamiltonian simulation in the low-energy subspace
- Provably accurate simulation of gauge theories and bosonic systems
- Learning many-body Hamiltonians with Heisenberg-limited scaling
- Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
- Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Bounding the costs of quantum simulation of many-body physics in real space
- Nearly tight Trotterization of interacting electrons
- Hamiltonian simulation with random inputs
- Hybridized Methods for Quantum Simulation in the Interaction Picture
- First-Order Trotter Error from a Second-Order Perspective
- Destructive Error Interference in Product-Formula Lattice Simulation
- Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
- On the complexity of implementing Trotter steps
- Quantum simulation of real-space dynamics
- Quantum computation of stopping power for inertial fusion target design
- Effective light cone and digital quantum simulation of interacting bosons
- On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
- Hamiltonian simulation for low-energy states with optimal time dependence
- Quantum algorithms for escaping from saddle points
- Probabilistic Weyl laws for quantized tori
- Efficient and practical Hamiltonian simulation from time-dependent product formulas
- Weyl laws for partially open quantum maps
- Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence
- Observable Error Bounds of the Time-splitting Scheme for Quantum-Classical Molecular Dynamics
- Uniform observable error bounds of Trotter formulae for the semiclassical Schrödinger equation