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:1510.02420 · The Journal of Chemical Physics

Modified Newton-Raphson GRAPE methods for optimal control of spin systems

David L. Goodwin, Ilya Kuprov

Published May 25, 2016• 74 citations
arXivHTMLPDF

Abstract

Quadratic convergence throughout the active space is achieved for the gradient ascent pulse engineering (GRAPE) family of quantum optimal control algorithms. We demonstrate in this communication that the Hessian of the GRAPE fidelity functional is unusually cheap, having the same asymptotic complexity scaling as the functional itself. This leads to the possibility of using very efficient numerical optimization techniques. In particular, the Newton-Raphson method with a rational function optimization (RFO) regularized Hessian is shown in this work to require fewer system trajectory evaluations than any other algorithm in the GRAPE family. This communication describes algebraic and numerical implementation aspects (matrix exponential recycling, Hessian regularization, etc.) for the RFO Newton-Raphson version of GRAPE and reports benchmarks for common spin state control problems in magnetic resonance spectroscopy.

DOI
10.1063/1.4949534

Related papers

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

Accelerated Newton-Raphson GRAPE methods for optimal control

David L. Goodwin, Mads Sloth Vinding

Improvements to the optimal control Newton-Raphson GRAPE method for exact Hessian calculations are shown with examples of auxiliary matrix and ESCALADE methods. For an ensemble of two-level systems with realistic MRI conditions, the new accelerated Hessian calculations are between 200 and 600 times faster for auxiliary matrix and ESCALADE, respectively.

arXiv:2207.09882•Physical Review Research•Mar 22, 2023•22 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

Krylov-subspace approach for the efficient control of quantum many-body dynamics

Martín Larocca, Diego A. Wisniacki

The gradient ascent pulse engineering (GRAPE) algorithm is a celebrated control algorithm with excellent converging rates, owing to a piecewise-constant ansatz for the control function that allows for cheap objective gradients. However, the computational effort involved in the exact simulation of quantum dynamics quickly becomes a bottleneck limiting the control of large systems. In this paper, we experiment with a modified version of GRAPE that uses Krylov approximations (K-GRAPE) to deal efficiently with high-dimensional state spaces. Even though the number of parameters required by an arbitrary control task scale linearly with the dimension of the system, we find a constant elementary computational effort (the effort per parameter). Since the elementary effort of GRAPE is superquadratic, this speed up allows us to reach dimensions far beyond. The performance of the K-GRAPE algorithm is benchmarked in the paradigmatic $XXZ$ spin-chain model.

arXiv:2010.03598•Physical Review A•Feb 11, 2021•23 citations

Instrumental distortions in quantum optimal control

Uluk Rasulov, Ilya Kuprov

Quantum optimal control methods, such as gradient ascent pulse engineering (GRAPE), are used for precise manipulation of quantum states. Many of those methods were pioneered in magnetic resonance spectroscopy, where instrumental distortions are often negligible. However, that is not the case elsewhere: the usual jumble of cables, resonators, modulators, splitters, amplifiers, and filters can and would distort control signals. Those distortions may be non-linear; their inverse functions may be ill-defined and unstable; they may even vary from one day to the next and across the sample. Here we introduce the response-aware gradient ascent pulse engineering framework, which accounts for any cascade of differentiable distortions within the GRAPE optimization loop, does not require filter function inversion, and produces control sequences that are resilient to user-specified distortion cascades with user-specified parameter ensembles. The framework is implemented into the optimal control module supplied with versions 2.10 and later of the open-source Spinach library; the user needs to provide function handles returning the actions by the distortions and, optionally, parameter ensembles for those actions.

arXiv:2502.02198•The Journal of Chemical Physics•Apr 25, 2025•10 citations

Pulse engineering via projection of response functions

Nicolas Heimann, Lukas Broers, Ludwig Mathey

We present an iterative optimal control method of quantum systems, aimed at an implementation of a desired operation with optimal fidelity. The update step of the method is based on the linear response of the fidelity to the control operators, and its projection onto the mode functions of the corresponding operator. Our method extends methods such as gradient-ascent pulse engineering (GRAPE) and variational quantum algorithms, by determining the fidelity gradient in a hyperparameter-free manner, and using it for a multiparameter update, capitalizing on the multimode overlap of the perturbation and the mode functions. This directly reduces the number of dynamical trajectories that need to be evaluated in order to update a set of parameters. We demonstrate this approach, and compare it to the standard GRAPE algorithm, for the example of a quantum gate on two qubits, demonstrating a clear improvement in convergence and optimal fidelity of the generated protocol.

arXiv:2404.10462•Physical Review Research•Jan 27, 2025•1 citation
Quadratic convergence throughout the active space is achieved for the gradient ascent pulse engineering (GRAPE) family of quantum optimal control algorithms. We demonstrate in this communication that the Hessian of the GRAPE fidelity functional is unusually cheap, having the same asymptotic complexity scaling as the functional itself. This leads to the possibility of using very efficient numerical optimization techniques. In particular, the Newton-Raphson method with a rational function optimization (RFO) regularized Hessian is shown in this work to require fewer system trajectory evaluations than any other algorithm in the GRAPE family. This communication describes algebraic and numerical implementation aspects (matrix exponential recycling, Hessian regularization, etc.) for the RFO Newton-Raphson version of GRAPE and reports benchmarks for common spin state control problems in magnetic resonance spectroscopy.
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.
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.
The gradient ascent pulse engineering (GRAPE) algorithm is a celebrated control algorithm with excellent converging rates, owing to a piecewise-constant ansatz for the control function that allows for cheap objective gradients. However, the computational effort involved in the exact simulation of quantum dynamics quickly becomes a bottleneck limiting the control of large systems. In this paper, we experiment with a modified version of GRAPE that uses Krylov approximations (K-GRAPE) to deal efficiently with high-dimensional state spaces. Even though the number of parameters required by an arbitrary control task scale linearly with the dimension of the system, we find a constant elementary computational effort (the effort per parameter). Since the elementary effort of GRAPE is superquadratic, this speed up allows us to reach dimensions far beyond. The performance of the K-GRAPE algorithm is benchmarked in the paradigmatic XXZXXZXXZ spin-chain model.
Quantum optimal control methods, such as gradient ascent pulse engineering (GRAPE), are used for precise manipulation of quantum states. Many of those methods were pioneered in magnetic resonance spectroscopy, where instrumental distortions are often negligible. However, that is not the case elsewhere: the usual jumble of cables, resonators, modulators, splitters, amplifiers, and filters can and would distort control signals. Those distortions may be non-linear; their inverse functions may be ill-defined and unstable; they may even vary from one day to the next and across the sample. Here we introduce the response-aware gradient ascent pulse engineering framework, which accounts for any cascade of differentiable distortions within the GRAPE optimization loop, does not require filter function inversion, and produces control sequences that are resilient to user-specified distortion cascades with user-specified parameter ensembles. The framework is implemented into the optimal control module supplied with versions 2.10 and later of the open-source Spinach library; the user needs to provide function handles returning the actions by the distortions and, optionally, parameter ensembles for those actions.
We present an iterative optimal control method of quantum systems, aimed at an implementation of a desired operation with optimal fidelity. The update step of the method is based on the linear response of the fidelity to the control operators, and its projection onto the mode functions of the corresponding operator. Our method extends methods such as gradient-ascent pulse engineering (GRAPE) and variational quantum algorithms, by determining the fidelity gradient in a hyperparameter-free manner, and using it for a multiparameter update, capitalizing on the multimode overlap of the perturbation and the mode functions. This directly reduces the number of dynamical trajectories that need to be evaluated in order to update a set of parameters. We demonstrate this approach, and compare it to the standard GRAPE algorithm, for the example of a quantum gate on two qubits, demonstrating a clear improvement in convergence and optimal fidelity of the generated protocol.