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:2404.10462 · Physical Review Research

Pulse engineering via projection of response functions

Nicolas Heimann, Lukas Broers, Ludwig Mathey

Published Jan 27, 2025• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevresearch.7.013101

Related papers

Pulse engineering via projection of response functions at infinite nonlinear order

Lia Kley, Ludwig Mathey

Optimal control problems arise in a wide range of scientific disciplines, but the corresponding optimization algorithms often display a strong dependence on hyperparameters that significantly influence performance and convergence. For the optimal implementation of quantum algorithms, these challenges are further amplified by high-dimensional control landscapes and the need for high-fidelity operations. Here, we propose an algorithm for optimal control problems in quantum computing to efficiently generate high-fidelity control protocols for multi-qubit systems in a hyperparameter and gradient free manner. The method, referred to as Pulse Engineering via Projection of response functions at infinite nonlinear order (PEPRino), leverages the framework of response theory to navigate the control landscape to find high-fidelity implementations. This is achieved by determining the control landscape via response functions to infinite order, efficiently evaluated by resummation in terms of the first and second order response function. To demonstrate the approach, we apply it to quantum systems consisting of two and three qubits for the optimal implementation of the Quantum Fourier Transform (QFT). We benchmark the proposed algorithm against the Chopped Random Basis (CRAB) algorithm utilizing the Nelder-Mead method, focusing on the 2-qubit scenario. The results indicate faster convergence regarding iteration steps and computational time, highlighting the advantages of our approach.

quant-pharXiv:2607.24725•Jul 28, 2026•0 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

Binary Control Pulse Optimization for Quantum Systems

Xinyu Fei, Lucas T. Brady, Jeffrey M. Larson +2 more

Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.

arXiv:2204.05773•Quantum•Jan 4, 2023•14 citations

Experimental demonstration of quantum optimal control via the alternating control–evolution protocol

Ruiqi Tang, Yanjun Hou, Zhenyue 臻越 Du 杜 +4 more

Abstract As a crucial component of quantum technologies, quantum optimal control enables the high-fidelity engineering of desired quantum states and operations. Conventional approaches, such as the widely used gradient ascent pulse engineering (GRAPE) algorithm, typically rely on dense pulse sequences with a large number of control parameters, leading to inefficient optimization and increased sensitivity to experimental imperfections. In this work, we propose the alternating control–evolution (ACE) protocol, a flexible framework that constructs quantum operations by interleaving elementary control operations with tunable free evolutions, thereby enabling the design of sparse pulse sequences that exploit intrinsic system dynamics. This design substantially reduces the number of control parameters while retaining high expressibility and control fidelity. Numerical simulations on nuclear magnetic resonance systems show that the ACE protocol achieves more than a 20-fold reduction in the number of control parameters compared to GRAPE, with comparable fidelity in state preparation tasks. We further experimentally validate the ACE protocol on a four-qubit NMR platform by preparing a Greenberger–Horne–Zeilinger (GHZ) state with a fidelity of 99.52%. These results demonstrate that the ACE protocol provides an efficient and experimentally robust strategy for quantum optimal control, particularly suitable for the noisy intermediate-scale quantum (NISQ) era.

Chinese Physics B•Mar 25, 2026•0 citations

Quantum gate control pulse optimization based on the Adam algorithm

Mengdi Yang, Yue Feng, Bo Lu +3 more

The efficient implementation of quantum computing is contingent upon high-fidelity quantum operations. Nevertheless, the fidelity of these operations is constrained by the precision of quantum system evolution control. The optimization of quantum control pulses is essential for improving the manipulation accuracy of superconducting qubits. Traditional optimization methods, including gradient descent and the gradient ascent pulse engineering algorithm, frequently encounter challenges such as slow convergence and susceptibility to local optima in pulse optimization problems. This study introduces an adaptive open-loop optimization algorithm based on the adaptive moment estimation (Adam) optimizer, capitalizing on the benefits of momentum and adaptive learning rate adjustments inherent in Adam. We conduct experimental analysis on the algorithm’s hyperparameters to achieve optimal solutions with a higher fidelity range at a faster convergence speed, effectively improving the fidelity and optimization efficiency of quantum gate operations. Through numerical simulations on the QuTiP platform, we validate the excellent performance of the Adam algorithm in quantum gate optimization. In optimizing the X and SWAP gates, its fidelity improved by 0.03% and 0.0016%, respectively, compared to the GRAPE algorithm. Compared to the CRAB method, the initial convergence speed of the Adam method increased fivefold, enabling it to achieve the target fidelity more rapidly. Future research will investigate closed-loop optimization strategies, utilizing feedback derived from the fidelity results of actual quantum computers to further augment quantum control performance

Quantum Information Processing•Jun 12, 2025•5 citations

Gradient-Ascent Pulse Engineering with Feedback

Riccardo Porotti, Vittorio Peano, Florian Marquardt

Efficient approaches to quantum control and feedback are essential for quantum technologies, from sensing to quantum computation.Open-loop control tasks have been successfully solved using optimization techniques, including methods such as gradient-ascent pulse engineering (GRAPE) , relying on a differentiable model of the quantum dynamics.For feedback tasks, such methods are not directly applicable, since the aim is to discover strategies conditioned on measurement outcomes.In this work, we introduce feedback GRAPE, which borrows some concepts from model-free reinforcement learning to incorporate the response to strong stochastic (discrete or continuous) measurements, while still performing direct gradient ascent through the quantum dynamics.We illustrate its power considering various scenarios based on cavity-QED setups.Our method yields interpretable feedback strategies for state preparation and stabilization in the presence of noise.Our approach could be employed for discovering strategies in a wide range of feedback tasks, from calibration of multiqubit devices to linear-optics quantum computation strategies, quantum enhanced sensing with adaptive measurements, and quantum error correction.

arXiv:2203.04271•PRX Quantum•Jul 13, 2023•49 citations
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.
Optimal control problems arise in a wide range of scientific disciplines, but the corresponding optimization algorithms often display a strong dependence on hyperparameters that significantly influence performance and convergence. For the optimal implementation of quantum algorithms, these challenges are further amplified by high-dimensional control landscapes and the need for high-fidelity operations. Here, we propose an algorithm for optimal control problems in quantum computing to efficiently generate high-fidelity control protocols for multi-qubit systems in a hyperparameter and gradient free manner. The method, referred to as Pulse Engineering via Projection of response functions at infinite nonlinear order (PEPRino), leverages the framework of response theory to navigate the control landscape to find high-fidelity implementations. This is achieved by determining the control landscape via response functions to infinite order, efficiently evaluated by resummation in terms of the first and second order response function. To demonstrate the approach, we apply it to quantum systems consisting of two and three qubits for the optimal implementation of the Quantum Fourier Transform (QFT). We benchmark the proposed algorithm against the Chopped Random Basis (CRAB) algorithm utilizing the Nelder-Mead method, focusing on the 2-qubit scenario. The results indicate faster convergence regarding iteration steps and computational time, highlighting the advantages of our approach.
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 control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.
Abstract As a crucial component of quantum technologies, quantum optimal control enables the high-fidelity engineering of desired quantum states and operations. Conventional approaches, such as the widely used gradient ascent pulse engineering (GRAPE) algorithm, typically rely on dense pulse sequences with a large number of control parameters, leading to inefficient optimization and increased sensitivity to experimental imperfections. In this work, we propose the alternating control–evolution (ACE) protocol, a flexible framework that constructs quantum operations by interleaving elementary control operations with tunable free evolutions, thereby enabling the design of sparse pulse sequences that exploit intrinsic system dynamics. This design substantially reduces the number of control parameters while retaining high expressibility and control fidelity. Numerical simulations on nuclear magnetic resonance systems show that the ACE protocol achieves more than a 20-fold reduction in the number of control parameters compared to GRAPE, with comparable fidelity in state preparation tasks. We further experimentally validate the ACE protocol on a four-qubit NMR platform by preparing a Greenberger–Horne–Zeilinger (GHZ) state with a fidelity of 99.52%. These results demonstrate that the ACE protocol provides an efficient and experimentally robust strategy for quantum optimal control, particularly suitable for the noisy intermediate-scale quantum (NISQ) era.
The efficient implementation of quantum computing is contingent upon high-fidelity quantum operations. Nevertheless, the fidelity of these operations is constrained by the precision of quantum system evolution control. The optimization of quantum control pulses is essential for improving the manipulation accuracy of superconducting qubits. Traditional optimization methods, including gradient descent and the gradient ascent pulse engineering algorithm, frequently encounter challenges such as slow convergence and susceptibility to local optima in pulse optimization problems. This study introduces an adaptive open-loop optimization algorithm based on the adaptive moment estimation (Adam) optimizer, capitalizing on the benefits of momentum and adaptive learning rate adjustments inherent in Adam. We conduct experimental analysis on the algorithm’s hyperparameters to achieve optimal solutions with a higher fidelity range at a faster convergence speed, effectively improving the fidelity and optimization efficiency of quantum gate operations. Through numerical simulations on the QuTiP platform, we validate the excellent performance of the Adam algorithm in quantum gate optimization. In optimizing the X and SWAP gates, its fidelity improved by 0.03% and 0.0016%, respectively, compared to the GRAPE algorithm. Compared to the CRAB method, the initial convergence speed of the Adam method increased fivefold, enabling it to achieve the target fidelity more rapidly. Future research will investigate closed-loop optimization strategies, utilizing feedback derived from the fidelity results of actual quantum computers to further augment quantum control performance
Efficient approaches to quantum control and feedback are essential for quantum technologies, from sensing to quantum computation.Open-loop control tasks have been successfully solved using optimization techniques, including methods such as gradient-ascent pulse engineering (GRAPE) , relying on a differentiable model of the quantum dynamics.For feedback tasks, such methods are not directly applicable, since the aim is to discover strategies conditioned on measurement outcomes.In this work, we introduce feedback GRAPE, which borrows some concepts from model-free reinforcement learning to incorporate the response to strong stochastic (discrete or continuous) measurements, while still performing direct gradient ascent through the quantum dynamics.We illustrate its power considering various scenarios based on cavity-QED setups.Our method yields interpretable feedback strategies for state preparation and stabilization in the presence of noise.Our approach could be employed for discovering strategies in a wide range of feedback tasks, from calibration of multiqubit devices to linear-optics quantum computation strategies, quantum enhanced sensing with adaptive measurements, and quantum error correction.