Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2509.22897

Superconvergence of High-order Magnus Quantum Algorithms

Fang, Di, Jiaqi Zhang

Published Sep 26, 2025• 5 citations
arXivHTMLPDF

Abstract

The Magnus expansion has long been a celebrated subject in numerical analysis, leading to the development of many useful classical integrators. More recently, it has been discovered to be a powerful tool for designing quantum algorithms for Hamiltonian simulation in quantum computing. In particular, surprising superconvergence behavior has been observed for quantum Magnus algorithms applied to the simulation of the Schrödinger equation, with the first- and second-order methods exhibiting doubled convergence order. In this work, we provide a rigorous proof that such superconvergence extends to general high-order quantum Magnus algorithms. Specifically, we show that a quantum Magnus algorithm of order $p$ achieves the superconvergence of order $2p$ in time when applying to the Schrödinger equation simulation in the interaction picture. Our analysis combines techniques from semiclassical analysis and Weyl calculus, offering a new perspective on the mathematical foundations of quantum algorithms for time-dependent Hamiltonian simulation.

DOI
10.48550/arxiv.2509.22897

Related papers

Semiclassical Scaling Laws of Magnus Quantum Algorithms under Harmonic Confinement

Di Fang, Samuel Orellana Mateo

The simulation of semiclassical Schrödinger dynamics is often hindered by rapid oscillations, where classical numerical methods and quantum simulation algorithms can suffer severe precision loss as the semiclassical parameter $\varepsilon \to 0$. In this work, we uncover a surprising robustness of high-order Magnus quantum algorithms in the semiclassical regime. We establish two important results. First, we extend the theory of Magnus superconvergence from free-particle reference dynamics to a general class of Schrödinger operators whose reference Hamiltonian includes harmonic confinement. Second, and more importantly, we reveal a nontrivial semiclassical scaling law: while the expansion remainder term bound suggests an error prefactor of $O(\varepsilon^{-(p+1)})$ for a $p$th-order method, we prove that the loss is in fact order-independent and collapses to $O(\varepsilon^{-1})$ for all $p$. The key analytical mechanism is the exact Egorov transport associated with quadratic flows in semiclassical Weyl quantization, which enables a symbol-level analysis of the interaction-picture Hamiltonian and its Magnus commutators. Our results show that high-order Magnus quantum algorithms remain far more robust in the semiclassical regime than naive series remainder term counting would suggest.

arXiv:2611.17055•Nov 12, 2026•0 citations

Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation

Dong An, Di Fang, Lin Lin

We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm that is both insensitive to the rapid changes of the time-dependent Hamiltonian and exhibits commutator scaling. Our method can be used for efficient Hamiltonian simulation in the interaction picture. In particular, we demonstrate that for the simulation of the Schrödinger equation, our method exhibits superconvergence and achieves a surprising second order convergence rate, of which the proof rests on a careful application of pseudo-differential calculus. Numerical results verify the effectiveness and the superconvergence property of our method.

arXiv:2111.03103•Quantum•Apr 15, 2022•49 citations

High-order Magnus expansion for Hamiltonian simulation

Di Fang, Diyi Liu, Shuchen Zhu

Efficient simulation of quantum dynamics with time-dependent Hamiltonians is important not only for time-varying systems but also for time-independent Hamiltonians in the interaction picture. Such simulations are more challenging than their time-independent counterparts due to the complexity introduced by time ordering. Existing algorithms that aim to capture commutator-based scaling either exhibit polynomial cost dependence on the Hamiltonian’s time derivatives or are limited to low-order accuracy. In this work, we establish the general commutator-scaling error bounds for the truncated Magnus expansion at arbitrary order, where only Hamiltonian terms appear in the nested commutators, with no time derivatives involved. Building on this analysis, we design a high-order quantum algorithm with explicit circuit constructions. The algorithm achieves cost scaling with the commutator structure in the high-precision regime and depends only logarithmically on the Hamiltonian’s time variation, making it efficient under the standard input model for general time-dependent settings, including Hamiltonians arising in the interaction picture.

arXiv:2509.06054•npj Quantum Information•Oct 7, 2026•15 citations

Convergence of Magnus and Magnus-like expansions in the Schrödinger representation

W. R. Salzman

General and greatly simplified methods are presented for calculating terms in the exponent in Magnus and Magnus-like expansions to first order in a ‘‘small’’perturbation and to infinite order in the overall Hamiltonian in the Schrödinger representation. These techniques are applied to four simple but important models and it is shown that in each case the Magnus exponent diverges for some range of the parameters of the model. This result casts serious doubt on the utility of the Magnus expansion in the Schrödinger representation. Several of the problems are also treated in the interaction representation giving results which converge throughout the useful range of parameters. There is no evidence that a similar question exists in this representation.

The Journal of Chemical Physics•Oct 15, 1986•51 citations

Lie algebra-assisted quantum simulation and quantum optimal control via high-order Magnus expansions

R. F. dos Santos, S. J. J. M. F. Kokkelmans

The evolution of a quantum system under time-dependent driving exhibits phenomena that are absent in its stationary counterpart. However, the high dimensionality and non-commutative nature of quantum dynamics make this a challenging problem. The Magnus expansion provides an analytic framework to approximate the effective dynamics on short time-scales, but computing high-order terms with existing methods is computationally expensive. We introduce a scalable approach that reduces the computational effort to depend only on the degrees of freedom defining the time-dependent control function. We focus specifically on Hamiltonians consisting of a constant drift term and a controllable term. Our method provides a polynomial expression for the Magnus expansion which can be evaluated several orders of magnitude faster than previous techniques, enabling broad applications in the realms of quantum simulation and quantum optimal control. We showcase an application of the method by designing control pulses for the 5-qubit phase gate on a neutral-atom platform utilizing Rydberg atoms.

quant-pharXiv:2512.20357•Physical Review A•Dec 24, 2025•0 citations

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Yonah Borns-Weil, Di Fang, Jiaqi Zhang

arXiv:2502.20255•Communications in Mathematical Physics•Jan 14, 2026•7 citations
The Magnus expansion has long been a celebrated subject in numerical analysis, leading to the development of many useful classical integrators. More recently, it has been discovered to be a powerful tool for designing quantum algorithms for Hamiltonian simulation in quantum computing. In particular, surprising superconvergence behavior has been observed for quantum Magnus algorithms applied to the simulation of the Schrödinger equation, with the first- and second-order methods exhibiting doubled convergence order. In this work, we provide a rigorous proof that such superconvergence extends to general high-order quantum Magnus algorithms. Specifically, we show that a quantum Magnus algorithm of order ppp achieves the superconvergence of order 2p2p2p in time when applying to the Schrödinger equation simulation in the interaction picture. Our analysis combines techniques from semiclassical analysis and Weyl calculus, offering a new perspective on the mathematical foundations of quantum algorithms for time-dependent Hamiltonian simulation.
The simulation of semiclassical Schrödinger dynamics is often hindered by rapid oscillations, where classical numerical methods and quantum simulation algorithms can suffer severe precision loss as the semiclassical parameter ε→0\varepsilon \to 0ε→0. In this work, we uncover a surprising robustness of high-order Magnus quantum algorithms in the semiclassical regime. We establish two important results. First, we extend the theory of Magnus superconvergence from free-particle reference dynamics to a general class of Schrödinger operators whose reference Hamiltonian includes harmonic confinement. Second, and more importantly, we reveal a nontrivial semiclassical scaling law: while the expansion remainder term bound suggests an error prefactor of O(ε−(p+1))O(\varepsilon^{-(p+1)})O(ε−(p+1)) for a pppth-order method, we prove that the loss is in fact order-independent and collapses to O(ε−1)O(\varepsilon^{-1})O(ε−1) for all ppp. The key analytical mechanism is the exact Egorov transport associated with quadratic flows in semiclassical Weyl quantization, which enables a symbol-level analysis of the interaction-picture Hamiltonian and its Magnus commutators. Our results show that high-order Magnus quantum algorithms remain far more robust in the semiclassical regime than naive series remainder term counting would suggest.
We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm that is both insensitive to the rapid changes of the time-dependent Hamiltonian and exhibits commutator scaling. Our method can be used for efficient Hamiltonian simulation in the interaction picture. In particular, we demonstrate that for the simulation of the Schrödinger equation, our method exhibits superconvergence and achieves a surprising second order convergence rate, of which the proof rests on a careful application of pseudo-differential calculus. Numerical results verify the effectiveness and the superconvergence property of our method.
Efficient simulation of quantum dynamics with time-dependent Hamiltonians is important not only for time-varying systems but also for time-independent Hamiltonians in the interaction picture. Such simulations are more challenging than their time-independent counterparts due to the complexity introduced by time ordering. Existing algorithms that aim to capture commutator-based scaling either exhibit polynomial cost dependence on the Hamiltonian’s time derivatives or are limited to low-order accuracy. In this work, we establish the general commutator-scaling error bounds for the truncated Magnus expansion at arbitrary order, where only Hamiltonian terms appear in the nested commutators, with no time derivatives involved. Building on this analysis, we design a high-order quantum algorithm with explicit circuit constructions. The algorithm achieves cost scaling with the commutator structure in the high-precision regime and depends only logarithmically on the Hamiltonian’s time variation, making it efficient under the standard input model for general time-dependent settings, including Hamiltonians arising in the interaction picture.
General and greatly simplified methods are presented for calculating terms in the exponent in Magnus and Magnus-like expansions to first order in a ‘‘small’’perturbation and to infinite order in the overall Hamiltonian in the Schrödinger representation. These techniques are applied to four simple but important models and it is shown that in each case the Magnus exponent diverges for some range of the parameters of the model. This result casts serious doubt on the utility of the Magnus expansion in the Schrödinger representation. Several of the problems are also treated in the interaction representation giving results which converge throughout the useful range of parameters. There is no evidence that a similar question exists in this representation.
The evolution of a quantum system under time-dependent driving exhibits phenomena that are absent in its stationary counterpart. However, the high dimensionality and non-commutative nature of quantum dynamics make this a challenging problem. The Magnus expansion provides an analytic framework to approximate the effective dynamics on short time-scales, but computing high-order terms with existing methods is computationally expensive. We introduce a scalable approach that reduces the computational effort to depend only on the degrees of freedom defining the time-dependent control function. We focus specifically on Hamiltonians consisting of a constant drift term and a controllable term. Our method provides a polynomial expression for the Magnus expansion which can be evaluated several orders of magnitude faster than previous techniques, enabling broad applications in the realms of quantum simulation and quantum optimal control. We showcase an application of the method by designing control pulses for the 5-qubit phase gate on a neutral-atom platform utilizing Rydberg atoms.