Superconvergence of High-order Magnus Quantum Algorithms
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911179462410240 |
|---|---|
| author | Fang, Di Zhang, Jiaqi |
| author_facet | Fang, Di Zhang, Jiaqi |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_22897 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Superconvergence of High-order Magnus Quantum Algorithms Fang, Di Zhang, Jiaqi Numerical Analysis Quantum Physics 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. |
| title | Superconvergence of High-order Magnus Quantum Algorithms |
| topic | Numerical Analysis Quantum Physics |
| url | https://arxiv.org/abs/2509.22897 |