Superconvergence of High-order Magnus Quantum Algorithms

• URL: http://arxiv.org/abs/2509.22897v1
• Date: Fri, 26 Sep 2025 20:23:25 GMT
• Title: Superconvergence of High-order Magnus Quantum Algorithms
• Authors: Di Fang, Jiaqi Zhang,
• Abstract summary: We show that a quantum Magnus algorithm of order $p$ achieves the superconvergence of order $2p$ in time when applying to the Schr"odinger equation simulation.<n>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.
• Score: 11.435678399541343
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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\"odinger 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\"odinger 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.

Related papers

• Quantum algorithms based on quantum trajectories [0.4870012761464388]
  We show that the additive complexity of $O(T + log(1/epsilon))$ is reachable for the simulation of a large class of Lindbladian.<n>In this work we show that the additive complexity of $O(T + log(1/epsilon))$ is reachable for the simulation of a large class of Lindbladian by constructing a novel quantum algorithm based on quantum trajectories.
  arXiv  Detail & Related papers  (2025-09-12T17:27:25Z)
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation [3.5148549831413036]
  We provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points $N$.<n>We establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm.
  arXiv  Detail & Related papers  (2025-02-27T16:43:28Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence [0.0]
  We introduce a new time-dependent Hamiltonian simulation algorithm based on the Magnus series expansion.<n>We prove that the commutator in the second-order algorithm leads to a surprising fourth-order superconvergence.
  arXiv  Detail & Related papers  (2024-05-21T16:49:54Z)
• Approximation Algorithms for Quantum Max-$d$-Cut [42.248442410060946]
  The Quantum Max-$d$-Cut problem involves finding a quantum state that maximizes the expected energy associated with the projector onto the antisymmetric subspace of two, $d$-dimensional qudits over all local interactions. We develop an algorithm that finds product-state solutions of mixed states with bounded purity that achieve non-trivial performance guarantees.
  arXiv  Detail & Related papers  (2023-09-19T22:53:17Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Simulating Markovian open quantum systems using higher-order series expansion [1.713291434132985]
  We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. Our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding.
  arXiv  Detail & Related papers  (2022-12-05T06:02:50Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schr\"odinger Equation [2.973326951020451]
  We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics. 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. For the simulation of the Schr"odinger equation, our method exhibits superconvergence and achieves a surprising second order convergence rate.
  arXiv  Detail & Related papers  (2021-11-04T18:50:36Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.