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:2611.17055

Semiclassical Scaling Laws of Magnus Quantum Algorithms under Harmonic Confinement

Di Fang, Samuel Orellana Mateo

Published Nov 12, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2611.17055

Related papers

Superconvergence of High-order Magnus Quantum Algorithms

Fang, Di, Jiaqi Zhang

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.

arXiv:2509.22897•Sep 26, 2025•5 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

Propagators for Quantum-Classical Models: Commutator-Free Magnus Methods

Adrián Gómez Pueyo, Sergio Blanes, Alberto Castro

We consider the numerical propagation of models that combine both quantum and classical degrees of freedom, usually, electrons and nuclei, respectively. We focus, in our computational examples, on the case in which the quantum electrons are modeled with time-dependent density-functional theory, although the methods discussed below can be used with any other level of theory. Often, for these so-called quantum-classical molecular dynamics models, one uses some propagation technique to deal with the quantum part and a different one for the classical equations. While the resulting procedure may, in principle, be consistent, it can however spoil some of the properties of the methods, such as the accuracy order with respect to the time step or the preservation of the geometrical structure of the equations. Few methods have been developed specifically for hybrid quantum-classical models. We propose using the same method for both the quantum and classical particles, in particular, one family of techniques that proves to be very efficient for the propagation of Schrödinger-like equations: the (quasi)-commutator free Magnus expansions. These have been developed, however, for linear systems, yet our problem is nonlinear: formally, the full quantum-classical system can be rewritten as a nonlinear Schrödinger equation, i.e., one in which the Hamiltonian depends on the system itself. The Magnus expansion algorithms for linear systems require the application of the Hamiltonian at intermediate points in a given propagating interval. For nonlinear systems, this poses a problem as this Hamiltonian is unknown due to its dependence on the state. We approximate it by employing a higher order extrapolation using previous steps as input. The resulting technique can then be regarded as a multistep technique or, alternatively, as a predictor corrector formula.

Journal of Chemical Theory and Computation•Jan 30, 2020•6 citations

The Floquet-Magnus expansion of unbounded operators

Daniel Burgarth, Robin Hillier, Davide Lonigro +1 more

The Floquet-Magnus expansion is a widely used tool to derive effective descriptions of time-periodic quantum systems by approximating their dynamics with a time-independent Hamiltonian. However, its standard formulation is, strictly speaking, restricted to bounded Hamiltonians. In this work, we extend its definition and analysis to a broad class of time-periodic unbounded Hamiltonians. Our approach is based on an a priori distinct nonperturbative framework for the construction of effective Hamiltonians, which we show to reproduce the Floquet-Magnus expansion. A particular strength of our framework is that it allows us to prove that the resulting effective dynamics approximates the original time evolution propagators to arbitrary order in the high-frequency limit without requiring convergence of the Floquet-Magnus expansion, a condition that is already highly restrictive even in the bounded setting. We illustrate the scope of the method on representative models: the quantum Rabi Hamiltonian in the interaction picture, and the periodically driven quantum harmonic oscillator.

math-phCross-listedarXiv:2605.23734•May 25, 2026

Frozen Gaussian sampling algorithms for simulating Markovian open quantum systems in the semiclassical regime

Limin Xu, Zhen Huang, Zhennan Zhou

Simulating Markovian open quantum systems in the semiclassical regime poses a grand challenge for computational physics, as the highly oscillatory nature of the dynamics imposes prohibitive resolution requirements on traditional grid-based methods. To overcome this barrier, this paper introduces an efficient Frozen Gaussian Sampling (FGS) algorithm based on the Wigner-Fokker-Planck phase-space formulation. The proposed algorithm exhibits two transformative advantages. First, for the computation of physical observables, its sampling error is independent of the semiclassical parameter $\varepsilon$, thus fundamentally breaking the prohibitive computational scaling faced by grid methods in the semiclassical limit. Second, its mesh-free nature entirely eliminates the boundary-induced instabilities that constrain long-time grid-based simulations. Leveraging these capabilities, the FGS algorithm serves as a powerful investigatory tool for exploring the long-time behavior of open quantum systems. Specifically, we provide compelling numerical evidence for the existence of steady states in strongly non-harmonic potentials-a regime where rigorous analytical results are currently lacking.

quant-pharXiv:2512.14015•Journal of Computational Physics•Dec 17, 2025•0 citations

Towards Robust Variational Quantum Simulation of Lindblad Dynamics via Stochastic Magnus Expansion

Jia-Cheng Huang, Hao-En Li, Yi-Cheng Wang +3 more

In this paper, we introduce a novel and general framework for the variational quantum simulation of Lindblad equations. Building on the close relationship between the unraveled Lindblad dynamics, stochastic Magnus integrators, and variational quantum simulation, we propose a high-order scheme for solving the quantum state diffusion equation using exponential integrators. This formulation facilitates the simulation of wavefunction trajectories within the established framework of variational quantum algorithms for time evolution. Our algorithm significantly enhances robustness in two key aspects: the stability of the simulation with large time steps, and the reduction in the number of quantum trajectories required to accurately simulate the Lindblad dynamics in terms of the ensemble average. We demonstrate the effectiveness of our algorithm through numerical examples in both classical and quantum implementations, including the transverse-field Ising model (TFIM) with damping, the Fenna-Matthews-Olson (FMO) complex, and the radical pair model (RPM). The simulation accuracy can be systematically improved, and the algorithm remains reliable even in highly oscillatory regimes. These methods are expected to be applicable to a broader class of open quantum systems beyond the specific models considered in this study.

arXiv:2503.22099•PRX Quantum•Sep 16, 2025•6 citations
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.
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.
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.
We consider the numerical propagation of models that combine both quantum and classical degrees of freedom, usually, electrons and nuclei, respectively. We focus, in our computational examples, on the case in which the quantum electrons are modeled with time-dependent density-functional theory, although the methods discussed below can be used with any other level of theory. Often, for these so-called quantum-classical molecular dynamics models, one uses some propagation technique to deal with the quantum part and a different one for the classical equations. While the resulting procedure may, in principle, be consistent, it can however spoil some of the properties of the methods, such as the accuracy order with respect to the time step or the preservation of the geometrical structure of the equations. Few methods have been developed specifically for hybrid quantum-classical models. We propose using the same method for both the quantum and classical particles, in particular, one family of techniques that proves to be very efficient for the propagation of Schrödinger-like equations: the (quasi)-commutator free Magnus expansions. These have been developed, however, for linear systems, yet our problem is nonlinear: formally, the full quantum-classical system can be rewritten as a nonlinear Schrödinger equation, i.e., one in which the Hamiltonian depends on the system itself. The Magnus expansion algorithms for linear systems require the application of the Hamiltonian at intermediate points in a given propagating interval. For nonlinear systems, this poses a problem as this Hamiltonian is unknown due to its dependence on the state. We approximate it by employing a higher order extrapolation using previous steps as input. The resulting technique can then be regarded as a multistep technique or, alternatively, as a predictor corrector formula.
The Floquet-Magnus expansion is a widely used tool to derive effective descriptions of time-periodic quantum systems by approximating their dynamics with a time-independent Hamiltonian. However, its standard formulation is, strictly speaking, restricted to bounded Hamiltonians. In this work, we extend its definition and analysis to a broad class of time-periodic unbounded Hamiltonians. Our approach is based on an a priori distinct nonperturbative framework for the construction of effective Hamiltonians, which we show to reproduce the Floquet-Magnus expansion. A particular strength of our framework is that it allows us to prove that the resulting effective dynamics approximates the original time evolution propagators to arbitrary order in the high-frequency limit without requiring convergence of the Floquet-Magnus expansion, a condition that is already highly restrictive even in the bounded setting. We illustrate the scope of the method on representative models: the quantum Rabi Hamiltonian in the interaction picture, and the periodically driven quantum harmonic oscillator.
Simulating Markovian open quantum systems in the semiclassical regime poses a grand challenge for computational physics, as the highly oscillatory nature of the dynamics imposes prohibitive resolution requirements on traditional grid-based methods. To overcome this barrier, this paper introduces an efficient Frozen Gaussian Sampling (FGS) algorithm based on the Wigner-Fokker-Planck phase-space formulation. The proposed algorithm exhibits two transformative advantages. First, for the computation of physical observables, its sampling error is independent of the semiclassical parameter ε\varepsilonε, thus fundamentally breaking the prohibitive computational scaling faced by grid methods in the semiclassical limit. Second, its mesh-free nature entirely eliminates the boundary-induced instabilities that constrain long-time grid-based simulations. Leveraging these capabilities, the FGS algorithm serves as a powerful investigatory tool for exploring the long-time behavior of open quantum systems. Specifically, we provide compelling numerical evidence for the existence of steady states in strongly non-harmonic potentials-a regime where rigorous analytical results are currently lacking.
In this paper, we introduce a novel and general framework for the variational quantum simulation of Lindblad equations. Building on the close relationship between the unraveled Lindblad dynamics, stochastic Magnus integrators, and variational quantum simulation, we propose a high-order scheme for solving the quantum state diffusion equation using exponential integrators. This formulation facilitates the simulation of wavefunction trajectories within the established framework of variational quantum algorithms for time evolution. Our algorithm significantly enhances robustness in two key aspects: the stability of the simulation with large time steps, and the reduction in the number of quantum trajectories required to accurately simulate the Lindblad dynamics in terms of the ensemble average. We demonstrate the effectiveness of our algorithm through numerical examples in both classical and quantum implementations, including the transverse-field Ising model (TFIM) with damping, the Fenna-Matthews-Olson (FMO) complex, and the radical pair model (RPM). The simulation accuracy can be systematically improved, and the algorithm remains reliable even in highly oscillatory regimes. These methods are expected to be applicable to a broader class of open quantum systems beyond the specific models considered in this study.