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:2110.06187 · Journal of Physics B Atomic Molecular and Optical Physics

Fast, high precision dynamics in quantum optimal control theory

Mogens Dalgaard, Felix Motzoi

Published Apr 2, 2022• 14 citations
arXivHTMLPDF

Abstract

Abstract Quantum optimal control theory is becoming increasingly crucial as quantum devices become more precise, but the need to quickly optimize these systems classically remains a significant bottleneck in their operation. Here we present a new theoretical quantum control framework for much faster optimization than the state of the art by replacing standard time propagation with a product of short-time propagators, each calculated using the Magnus expansion. The derived formulas for exact series terms and their gradients, based on earlier approximate integrals in a simulation setting, allow us to subsume the high cost of calculating commutators and integrals as an initial overhead. This provides an order of magnitude speedup for quantum control optimization.

DOI
10.1088/1361-6455/ac6366

Related papers

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

Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control

Ashutosh Mishra, Elena Lupo, Frank K. Wilhelm +1 more

Gradient-based quantum optimal control and the theory of operator evolution are rarely discussed together. In this Letter, we bridge this gap by showing that the gradient of the time-evolved propagator involves the Heisenberg evolution of local operators. We present a unifying framework by deriving from first principles the formal solution for the gradient under an arbitrary pulse parameterization, and show that the same construction extends to derivatives of any order. We obtain a series of nested, time-independent commutators weighted by time-dependent scalar coefficients. The commutators are thus computed once, and each optimization step only updates the scalars. The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions, which is a common situation in large multi-qubit platforms. In this setting, light-cone arguments and sparse-Pauli truncation heuristics may be used to keep the number of relevant terms in the series small. We compare the computational cost required for the series with the Gradient Optimization of Analytic conTrols (GOAT) method, and, focusing on the problem of preparation of a GHZ state, demonstrate more than an order of magnitude speedup for a qubit ladder and a chain geometry.

quant-pharXiv:2607.26867•Jul 30, 2026•0 citations

Approximate dynamics leading to more optimal control: Efficient exact derivatives

Jesper Hasseriis Mohr Jensen, Frederik Møller, Jens Jakob Sørensen +1 more

Accurate derivatives are important for locally traversing and converging efficiently in quantum optimization landscapes. By deriving analytically exact control derivatives (gradient and Hessian) for unitary control tasks, we show here that the computational feasibility of meeting this accuracy requirement depends on the choice of propagation scheme and problem representation. Even when exact propagation is sufficiently cheap it is, perhaps surprisingly, much more efficient to optimize the (appropriately) approximate propagators: Approximations in the dynamics are traded off for significant complexity reductions in the exact derivative calculations. Importantly, past the initial analytical considerations, only standard numerical techniques are explicitly required with straightforward application to realistic systems. These results are numerically verified for two concrete problems of increasing Hilbert space dimensionality. The best schemes obtain unit fidelity to machine precision, whereas the results for other schemes are separated consistently by orders of magnitude in computation time and in worst-case ten orders of magnitude in achievable fidelity. Since these gaps continually increase with system size and complexity, this methodology allows numerically efficient optimization of very high-dimensional dynamics, e.g., in many-body contexts, operating in the high-fidelity regime.

arXiv:2005.09943•Physical Review A•Jun 21, 2021•19 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•0 citations

Approximating exponentials of commutators by optimized product formulas

Fernando Casas, Alejandro Escorihuela-Tomàs, Pablo A. M. Casares

Abstract Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. However, the efficient implementation of Hamiltonian evolution of nested commutators remains an under explored area.In this work, we construct optimized product formulas of orders 3 to 6 approximating the exponential of a commutator of two arbitrary operators in terms of the exponentials of the operators involved. The new schemes require a reduced number of exponentials and thus provide more efficient approximations than other previouslypublished alternatives. They can also be used as basic methods in recursive procedures to increasethe order of approximation.We expect this research will improve the efficiency of quantum control protocols, as well as quantum algorithms such as the Zassenhaus-based product formula, Magnus operator-based time-dependent simulation, and product formula schemes with modified potentials.

arXiv:2407.10533•Quantum Information Processing•Jan 31, 2025•3 citations

Optimal control of open-quantum-system dynamics predicted by long short-term memory

Jun-Dong Zhong, Zhao-Ming Wang

The realization of high-fidelity quantum control is crucial for quantum information processing, particularly in noisy environments where control strategies must simultaneously achieve precise manipulation and effective noise suppression. Conventional optimal control designs typically require numerical calculations of the system dynamics. Recent studies have demonstrated that long short-term memory neural networks (LSTM) can accurately predict the time evolution of open quantum systems. Based on LSTM predicted dynamics, we propose an optimal control framework for rapid and efficient optimal control design in open quantum systems. As illustrative examples, we apply the proposed framework to design optimal control for adiabatic speedup in a two-level system and for quantum state transfer in a spin chain, both under non-Markovian environments. For adiabatic speedup, our optimization procedure involves two steps: driving trajectory optimization and zero-area pulse optimization. Fidelity improvements for both steps have been obtained, demonstrating the effectiveness of the scheme. Furthermore, this effectiveness is validated for quantum state transfer in a spin chain, which is a high dimensional control problem. Our optimal control design scheme utilizes predicted dynamics to generate optimized controls, offering broad application potential in quantum computing, communication, and sensing.

quant-pharXiv:2602.04480•Feb 5, 2026•0 citations
Abstract Quantum optimal control theory is becoming increasingly crucial as quantum devices become more precise, but the need to quickly optimize these systems classically remains a significant bottleneck in their operation. Here we present a new theoretical quantum control framework for much faster optimization than the state of the art by replacing standard time propagation with a product of short-time propagators, each calculated using the Magnus expansion. The derived formulas for exact series terms and their gradients, based on earlier approximate integrals in a simulation setting, allow us to subsume the high cost of calculating commutators and integrals as an initial overhead. This provides an order of magnitude speedup for quantum control optimization.
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.
Gradient-based quantum optimal control and the theory of operator evolution are rarely discussed together. In this Letter, we bridge this gap by showing that the gradient of the time-evolved propagator involves the Heisenberg evolution of local operators. We present a unifying framework by deriving from first principles the formal solution for the gradient under an arbitrary pulse parameterization, and show that the same construction extends to derivatives of any order. We obtain a series of nested, time-independent commutators weighted by time-dependent scalar coefficients. The commutators are thus computed once, and each optimization step only updates the scalars. The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions, which is a common situation in large multi-qubit platforms. In this setting, light-cone arguments and sparse-Pauli truncation heuristics may be used to keep the number of relevant terms in the series small. We compare the computational cost required for the series with the Gradient Optimization of Analytic conTrols (GOAT) method, and, focusing on the problem of preparation of a GHZ state, demonstrate more than an order of magnitude speedup for a qubit ladder and a chain geometry.
Accurate derivatives are important for locally traversing and converging efficiently in quantum optimization landscapes. By deriving analytically exact control derivatives (gradient and Hessian) for unitary control tasks, we show here that the computational feasibility of meeting this accuracy requirement depends on the choice of propagation scheme and problem representation. Even when exact propagation is sufficiently cheap it is, perhaps surprisingly, much more efficient to optimize the (appropriately) approximate propagators: Approximations in the dynamics are traded off for significant complexity reductions in the exact derivative calculations. Importantly, past the initial analytical considerations, only standard numerical techniques are explicitly required with straightforward application to realistic systems. These results are numerically verified for two concrete problems of increasing Hilbert space dimensionality. The best schemes obtain unit fidelity to machine precision, whereas the results for other schemes are separated consistently by orders of magnitude in computation time and in worst-case ten orders of magnitude in achievable fidelity. Since these gaps continually increase with system size and complexity, this methodology allows numerically efficient optimization of very high-dimensional dynamics, e.g., in many-body contexts, operating in the high-fidelity regime.
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.
Abstract Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. However, the efficient implementation of Hamiltonian evolution of nested commutators remains an under explored area.In this work, we construct optimized product formulas of orders 3 to 6 approximating the exponential of a commutator of two arbitrary operators in terms of the exponentials of the operators involved. The new schemes require a reduced number of exponentials and thus provide more efficient approximations than other previouslypublished alternatives. They can also be used as basic methods in recursive procedures to increasethe order of approximation.We expect this research will improve the efficiency of quantum control protocols, as well as quantum algorithms such as the Zassenhaus-based product formula, Magnus operator-based time-dependent simulation, and product formula schemes with modified potentials.
The realization of high-fidelity quantum control is crucial for quantum information processing, particularly in noisy environments where control strategies must simultaneously achieve precise manipulation and effective noise suppression. Conventional optimal control designs typically require numerical calculations of the system dynamics. Recent studies have demonstrated that long short-term memory neural networks (LSTM) can accurately predict the time evolution of open quantum systems. Based on LSTM predicted dynamics, we propose an optimal control framework for rapid and efficient optimal control design in open quantum systems. As illustrative examples, we apply the proposed framework to design optimal control for adiabatic speedup in a two-level system and for quantum state transfer in a spin chain, both under non-Markovian environments. For adiabatic speedup, our optimization procedure involves two steps: driving trajectory optimization and zero-area pulse optimization. Fidelity improvements for both steps have been obtained, demonstrating the effectiveness of the scheme. Furthermore, this effectiveness is validated for quantum state transfer in a spin chain, which is a high dimensional control problem. Our optimal control design scheme utilizes predicted dynamics to generate optimized controls, offering broad application potential in quantum computing, communication, and sensing.