High-order Magnus Expansion for Hamiltonian Simulation

• URL: http://arxiv.org/abs/2509.06054v1
• Date: Sun, 07 Sep 2025 13:44:55 GMT
• Title: High-order Magnus Expansion for Hamiltonian Simulation
• Authors: Di Fang, Diyi Liu, Shuchen Zhu,
• Abstract summary: We develop a high-order quantum algorithm for quantum dynamics with time-dependent Hamiltonians.<n>The algorithm achieves cost scaling with the commutator structure in the high-precision regime and only logarithmically on the Hamiltonian's time variation.
• Score: 2.6968321526169508
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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 for general time-dependent settings, including the interaction picture.

Related papers

• Time-Dependent Hamiltonian Simulation via Time-Independent Dynamics in a Larger Space [4.527270266697463]
  We present a proof-of-concept quantum algorithm for simulating time-dependent Hamiltonian evolution.<n>Our approach demonstrates that time-dependent Hamiltonian simulation can be as efficient in a simpler framework.
  arXiv  Detail & Related papers  (2025-07-25T14:55:44Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Quantum Simulation of Nonlinear Dynamical Systems Using Repeated Measurement [42.896772730859645]
  We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations. We apply this approach to the classic logistic and Lorenz systems in both integrable and chaotic regimes.
  arXiv  Detail & Related papers  (2024-10-04T18:06:12Z)
• Quantum simulation of highly-oscillatory many-body Hamiltonians for near-term devices [2.487329273327606]
  We develop a fourth-order Magnus expansion based quantum algorithm for the simulation of many-body problems. We exploit symmetries of the Hamiltonian and achieve a surprising reduction in the expansion. Our algorithms are able to take time-steps that are larger than the wavelength of oscillation of the time-dependent Hamiltonian.
  arXiv  Detail & Related papers  (2023-12-13T17:29:29Z)
• Optimal/Nearly-optimal simulation of multi-periodic time-dependent Hamiltonians [0.0]
  We establish a QET-based approach for simulating time-dependent Hamiltonians with multiple time-periodicity. Overcoming the difficulty of time-dependency, our protocol can simulate the dynamics under multi-periodic time-dependent Hamiltonians.
  arXiv  Detail & Related papers  (2023-01-16T01:53:09Z)
• Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions [42.3779227963298]
  We provide a framework for encoding time dependent dynamics as time independent systems. First, we create a time dependent simulation algorithm based on performing qubitization on the augmented clock system. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials.
  arXiv  Detail & Related papers  (2022-03-21T21:29:22Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• 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)
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion [6.338178373376447]
  We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies.
  arXiv  Detail & Related papers  (2021-03-29T05:02:02Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)

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.