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:1802.07147 · Frontiers of Physics

Practical pulse engineering: Gradient ascent without matrix exponentiation

Gaurav Bhole, Jonathan A. Jones

Published May 18, 2018• 17 citations
arXivHTMLPDF

Abstract

Since 2005, there has been a huge growth in the use of engineered control pulses to perform desired quantum operations in systems such as nuclear magnetic resonance quantum information processors. These approaches, which build on the original gradient ascent pulse engineering algorithm, remain computationally intensive because of the need to calculate matrix exponentials for each time step in the control pulse. In this study, we discuss how the propagators for each time step can be approximated using the Trotter–Suzuki formula, and a further speedup achieved by avoiding unnecessary operations. The resulting procedure can provide substantial speed gain with negligible costs in the propagator error, providing a more practical approach to pulse engineering.

DOI
10.1007/s11467-018-0791-1

Related papers

Improved quantum computing with higher-order Trotter decomposition

Xiaodong Yang, Xinfang Nie, Yunlan Ji +3 more

In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource consuming since the total Hamiltonian is often hard to diagonalize. In this paper, we mitigate this issue by substituting the time evolution segments with their Trotter decompositions, which reduces the propagator into a combination of single-qubit operations and fixed-time system evolutions. The resulting procedure can provide substantial speed gain with acceptable costs in the propagator error. As a demonstration, we apply the proposed strategy to improve the efficiency of the gradient ascent pulse engineering algorithm for searching optimal control fields. Furthermore, we show that the higher-order Trotter decompositions can provide efficient Ans\"atze for the variational quantum algorithm, leading to improved performance in solving the ground-state problem. The strategy presented here is also applicable for many other quantum optimization and simulation tasks.

arXiv:2205.02520•Physical Review A•Oct 3, 2022•17 citations

Implementing quantum logic gates with gradient ascent pulse engineering: principles and practicalities

Benjamin D. Rowland, Jonathan A. Jones

We briefly describe the use of gradient ascent pulse engineering (GRAPE) pulses to implement quantum logic gates in nuclear magnetic resonance quantum computers, and discuss a range of simple extensions to the core technique. We then consider a range of difficulties that can arise in practical implementations of GRAPE sequences, reflecting non-idealities in the experimental systems used.

arXiv:1203.6260•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Sep 3, 2012•49 citations

Accelerating quantum optimal control through iterative gradient-ascent pulse engineering

Yuquan Chen, Yajie Hao, Ze Wu +6 more

Quantum optimal control, a powerful toolbox for engineering an optimal control field modulation that most precisely implements a desired quantum operation in the best way possible, has evolved into one of the cornerstones for enabling quantum technologies. The gradient ascent pulse engineering (GRAPE) algorithm is a widely used method in quantum optimal control, which has achieved great success in different physical platforms. However, its computational complexity increases exponentially with the number of qubits, making it challenging to be implemented for large-scale quantum systems. To mitigate this issue, we present the iterative GRAPE algorithm (iGRAPE), which reduces the optimization problem into a series of lower-dimensional subproblems by incorporating disentanglement operations. Our numerical simulations on physical platforms such as nuclear magnetic resonance and superconducting quantum systems demonstrate that iGRAPE significantly enhances state preparation speed. Specifically, compared to GRAPE, iGRAPE achieves up to a five-fold acceleration in preparing Greenberger--Horne--Zeilinger states using a 12-qubit implementation, and up to a 13-fold acceleration for arbitrary state preparation with eight qubits. To further validate our findings, we conduct experimental validation of iGRAPE on a four-qubit nuclear magnetic resonance system. Overall, iGRAPE offers an efficient solution for implementing optimal control in large-scale quantum systems, holding great potential for advancing quantum technologies during the noisy intermediate-scale quantum era.

arXiv:2212.02806•Physical Review A•Nov 7, 2023•15 citations

Gradient ascent pulse engineering (GRAPE)–a primer on quality functions and pulse shape penalties

Armin J. Römer, Josef Granwehr, S. Kocher

Quantum optimal control is a versatile, powerful method to tailor quantum experiments. In NMR, numerical quantum optimal control algorithms such as the gradient ascent pulse engineering (GRAPE) algorithm have sparked many developments in pulse shaping, pushing the limits of pulse selectivity and robustness. To provide an overview of its core principles and the many expansions it has undergone ever since its introduction, the most common quality functions are benchmarked in their ability to guide the spin state transfer for facilitating excitation, inversion, and maximum quantum coherence. Explicit derivations of gradient and Hessian formulas are given, both summarizing what is known from the literature and complementing it. The derivations also give due consideration to the fact that spin states can be represented as density operators or spin operators. Analogously, the most common penalties to guide optimization toward experimentally feasible controls are discussed along with their explicit gradient and Hessian formula derivations. The discussion is complemented by thorough benchmarking for the most commonly used optimization algorithms.

•Nov 11, 2026•0 citations

Exponentiation of parametric Hamiltonians via unitary interpolation

Michael Schilling, Francesco Preti, Matthias M. Müller +2 more

The effort to generate matrix exponentials and associated differentials, required to determine the time evolution of quantum systems, frequently constrains the evaluation of problems in quantum control theory, variational circuit compilation, or Monte Carlo sampling. We introduce two ideas for the time-efficient approximation of matrix exponentials of linear multiparametric Hamiltonians. We modify the Suzuki-Trotter product formula from an approximation to an interpolation scheme to improve both accuracy and walltime. This allows us to achieve high fidelities within a single interpolation step, which can be computed directly from cached matrices. Furthermore, we define the interpolation on a grid of system parameters, and show that the interpolation infidelity converges with fourth-order accuracy in the number of interpolation bins. Published by the American Physical Society 2024

arXiv:2402.01498•Physical Review Research•Dec 16, 2024•5 citations

Beyond Trotterization: Variational Product Formulas for Quantum Simulation

Ibsal Assi, Michael Vogl, Meenu Kumari +1 more

We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.

quant-pharXiv:2511.15124•Physical review. B./Physical review. B•Nov 20, 2025•1 citation
Since 2005, there has been a huge growth in the use of engineered control pulses to perform desired quantum operations in systems such as nuclear magnetic resonance quantum information processors. These approaches, which build on the original gradient ascent pulse engineering algorithm, remain computationally intensive because of the need to calculate matrix exponentials for each time step in the control pulse. In this study, we discuss how the propagators for each time step can be approximated using the Trotter–Suzuki formula, and a further speedup achieved by avoiding unnecessary operations. The resulting procedure can provide substantial speed gain with negligible costs in the propagator error, providing a more practical approach to pulse engineering.
In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource consuming since the total Hamiltonian is often hard to diagonalize. In this paper, we mitigate this issue by substituting the time evolution segments with their Trotter decompositions, which reduces the propagator into a combination of single-qubit operations and fixed-time system evolutions. The resulting procedure can provide substantial speed gain with acceptable costs in the propagator error. As a demonstration, we apply the proposed strategy to improve the efficiency of the gradient ascent pulse engineering algorithm for searching optimal control fields. Furthermore, we show that the higher-order Trotter decompositions can provide efficient Ans\"atze for the variational quantum algorithm, leading to improved performance in solving the ground-state problem. The strategy presented here is also applicable for many other quantum optimization and simulation tasks.
Quantum optimal control, a powerful toolbox for engineering an optimal control field modulation that most precisely implements a desired quantum operation in the best way possible, has evolved into one of the cornerstones for enabling quantum technologies. The gradient ascent pulse engineering (GRAPE) algorithm is a widely used method in quantum optimal control, which has achieved great success in different physical platforms. However, its computational complexity increases exponentially with the number of qubits, making it challenging to be implemented for large-scale quantum systems. To mitigate this issue, we present the iterative GRAPE algorithm (iGRAPE), which reduces the optimization problem into a series of lower-dimensional subproblems by incorporating disentanglement operations. Our numerical simulations on physical platforms such as nuclear magnetic resonance and superconducting quantum systems demonstrate that iGRAPE significantly enhances state preparation speed. Specifically, compared to GRAPE, iGRAPE achieves up to a five-fold acceleration in preparing Greenberger--Horne--Zeilinger states using a 12-qubit implementation, and up to a 13-fold acceleration for arbitrary state preparation with eight qubits. To further validate our findings, we conduct experimental validation of iGRAPE on a four-qubit nuclear magnetic resonance system. Overall, iGRAPE offers an efficient solution for implementing optimal control in large-scale quantum systems, holding great potential for advancing quantum technologies during the noisy intermediate-scale quantum era.
Quantum optimal control is a versatile, powerful method to tailor quantum experiments. In NMR, numerical quantum optimal control algorithms such as the gradient ascent pulse engineering (GRAPE) algorithm have sparked many developments in pulse shaping, pushing the limits of pulse selectivity and robustness. To provide an overview of its core principles and the many expansions it has undergone ever since its introduction, the most common quality functions are benchmarked in their ability to guide the spin state transfer for facilitating excitation, inversion, and maximum quantum coherence. Explicit derivations of gradient and Hessian formulas are given, both summarizing what is known from the literature and complementing it. The derivations also give due consideration to the fact that spin states can be represented as density operators or spin operators. Analogously, the most common penalties to guide optimization toward experimentally feasible controls are discussed along with their explicit gradient and Hessian formula derivations. The discussion is complemented by thorough benchmarking for the most commonly used optimization algorithms.
The effort to generate matrix exponentials and associated differentials, required to determine the time evolution of quantum systems, frequently constrains the evaluation of problems in quantum control theory, variational circuit compilation, or Monte Carlo sampling. We introduce two ideas for the time-efficient approximation of matrix exponentials of linear multiparametric Hamiltonians. We modify the Suzuki-Trotter product formula from an approximation to an interpolation scheme to improve both accuracy and walltime. This allows us to achieve high fidelities within a single interpolation step, which can be computed directly from cached matrices. Furthermore, we define the interpolation on a grid of system parameters, and show that the interpolation infidelity converges with fourth-order accuracy in the number of interpolation bins. Published by the American Physical Society 2024
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.