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

Chinese Control Conference (CCC)

Time Scaling Transformation in Quantum Optimal Control Computation

Bin Shi, Chao Xu, Re-Bing Wu

Published Jul 1, 2018• 0 citations
Publisher

Abstract

The optimal control problem of the closed quantum systems can be equivalent to the parameters optimization problem of bilinear control systems. Numerical optimization techniques such as time scaling transformation are introduced to the Gradient Ascent Pulse Engineering (GRAPE) algorithm. The modified scheme can improve the fidelity, reduce the optimal evolutionary time and errors caused by the nonlinear hardware as illustrated in the numerical simulation of homonuclear optimal control.

DOI
10.23919/chicc.2018.8482909

Related papers

GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls

Vadim N. Petruhanov, Alexander Nikolaevich Pechen

Abstract The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. GRAPE is gradient search method based on exact expressions for gradient of the control objective. It has been applied to various coherently controlled closed and open quantum systems. In this work, we adopt the GRAPE method for optimizing objective functionals in open quantum systems driven by both coherent and incoherent controls. In our case, a tailored or engineered environment acts on the controlled system as control via time-dependent decoherence rates γ i ( t ) or, equivalently, via spectral density n ω ( t ) of the environment . To develop the GRAPE approach for this problem, we compute gradient of various objectives for general N -level open quantum systems for the piecewise constant class of control. The case of a single qubit is considered in details and solved analytically. For this case, an explicit analytical expression for evolution and objective gradient is obtained via diagonalization of a 3 × 3 matrix determining the system’s dynamics in the Bloch ball. The diagonalization is obtained by solving a cubic equation via Cardano’s method. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem and its complexity is estimated. Robustness of the optimal controls is also studied.

arXiv:2307.08479•Journal of Physics A Mathematical and Theoretical•Jul 11, 2023•36 citations

Iterative Gradient Ascent Pulse Engineering algorithm for quantum optimal control

Yuquan Chen, Yajie Hao, Ze Wu +6 more

Gradient ascent pulse engineering algorithm (GRAPE) is a typical method to solve quantum optimal control problems. However, it suffers from an exponential resource in computing the time evolution of quantum systems with the increasing number of qubits, which is a barrier for its application in large-qubit systems. To mitigate this issue, we propose an iterative GRAPE algorithm (iGRAPE) for preparing a desired quantum state, where the large-scale, resource-consuming optimization problem is decomposed into a set of lower-dimensional optimization subproblems by disentanglement operations. Consequently these subproblems can be solved in parallel with less computing resources. For physical platforms such as nuclear magnetic resonance (NMR) and superconducting quantum systems, we show that iGRAPE can provide up to 13-fold speedup over GRAPE when preparing desired quantum states in systems within 12 qubits. Using a four-qubit NMR system, we also experimentally verify the feasibility of the iGRAPE algorithm.

arXiv:2212.02806•Dec 6, 2022•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.

Physical Review A•Nov 7, 2023•10 citations

Optimal control of a quantum measurement

Daniel J. Egger, Frank K. Wilhelm

Pulses to steer the time evolution of quantum systems can be designed with optimal control theory. In most cases it is the coherent processes that can be controlled and one optimizes the time evolution toward a target unitary process, sometimes also in the presence of noncontrollable incoherent processes. Here we show how to extend the gradient ascent pulse engineering (GRAPE) algorithm in the case where the incoherent processes are controllable and the target time evolution is a nonunitary quantum channel. We perform a gradient search on a fidelity measure based on Choi matrices. We illustrate our algorithm by optimizing a phase qubit measurement pulse. We show how this technique can lead to a large measurement contrast close to $99%$. We also show, within the validity of our model, that this algorithm can produce short $1.4$-ns pulses with $98.2%$ contrast.

arXiv:1408.6086•Physical Review A•Nov 24, 2014•21 citations

GRAPE.jl: Gradient Ascent Pulse Engineering in Julia

Michael H. Goerz, Sebastián C. Carrasco, Alastair Marshall +1 more

The GRAPE$.$jl package (https://github.com/JuliaQuantumControl/GRAPE.jl) implements Gradient Ascent Pulse Engineering, a widely used method of quantum optimal control. Its purpose is to find controls that steer a quantum system in a particular way. This is a prerequisite for next-generation quantum technology, such as quantum computing or quantum sensing. GRAPE$.$jl exploits the unique strengths of the Julia programming language to achieve both flexibility and numerical performance. It builds on the QuantumControl$.$jl framework.

quant-pharXiv:2511.01217•The Journal of Open Source Software•Nov 4, 2025•0 citations

EO-GRAPE and EO-DRLPE: Open and Closed Loop Approaches for Energy Efficient Quantum Optimal Control

Sebastiaan Fauquenot, Aritra Sarkar, Sebastian Feld

This research investigates the possibility of using quantum optimal control techniques to co-optimize the energetic cost and the process fidelity of a quantum unitary gate. The energetic cost is theoretically defined, and thereby, the gradient of the energetic cost for pulse engineering is derived. We empirically demonstrate the Pareto optimality in the trade-off between process fidelity and energetic cost. Thereafter, two novel numerical quantum optimal control approaches are proposed: (i) energy-optimized gradient ascent pulse engineering (EO-GRAPE) as an open-loop gradient-based method, and (ii) energy-optimized deep reinforcement learning for pulse engineering (EO-DRLPE) as a closed-loop method. The performance of both methods is probed in the presence of increasing noise. We find that the EO-GRAPE method performs better than the EO-DRLPE methods with and without a warm start for most experimental settings. Additionally, for one qubit unitary gate, we illustrate the correlation between the Bloch sphere path length and the energetic cost.

arXiv:2411.06556•Nov 10, 2024•0 citations
The optimal control problem of the closed quantum systems can be equivalent to the parameters optimization problem of bilinear control systems. Numerical optimization techniques such as time scaling transformation are introduced to the Gradient Ascent Pulse Engineering (GRAPE) algorithm. The modified scheme can improve the fidelity, reduce the optimal evolutionary time and errors caused by the nonlinear hardware as illustrated in the numerical simulation of homonuclear optimal control.
Abstract The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. GRAPE is gradient search method based on exact expressions for gradient of the control objective. It has been applied to various coherently controlled closed and open quantum systems. In this work, we adopt the GRAPE method for optimizing objective functionals in open quantum systems driven by both coherent and incoherent controls. In our case, a tailored or engineered environment acts on the controlled system as control via time-dependent decoherence rates γ i ( t ) or, equivalently, via spectral density n ω ( t ) of the environment . To develop the GRAPE approach for this problem, we compute gradient of various objectives for general N -level open quantum systems for the piecewise constant class of control. The case of a single qubit is considered in details and solved analytically. For this case, an explicit analytical expression for evolution and objective gradient is obtained via diagonalization of a 3 × 3 matrix determining the system’s dynamics in the Bloch ball. The diagonalization is obtained by solving a cubic equation via Cardano’s method. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem and its complexity is estimated. Robustness of the optimal controls is also studied.
Gradient ascent pulse engineering algorithm (GRAPE) is a typical method to solve quantum optimal control problems. However, it suffers from an exponential resource in computing the time evolution of quantum systems with the increasing number of qubits, which is a barrier for its application in large-qubit systems. To mitigate this issue, we propose an iterative GRAPE algorithm (iGRAPE) for preparing a desired quantum state, where the large-scale, resource-consuming optimization problem is decomposed into a set of lower-dimensional optimization subproblems by disentanglement operations. Consequently these subproblems can be solved in parallel with less computing resources. For physical platforms such as nuclear magnetic resonance (NMR) and superconducting quantum systems, we show that iGRAPE can provide up to 13-fold speedup over GRAPE when preparing desired quantum states in systems within 12 qubits. Using a four-qubit NMR system, we also experimentally verify the feasibility of the iGRAPE algorithm.
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.
Pulses to steer the time evolution of quantum systems can be designed with optimal control theory. In most cases it is the coherent processes that can be controlled and one optimizes the time evolution toward a target unitary process, sometimes also in the presence of noncontrollable incoherent processes. Here we show how to extend the gradient ascent pulse engineering (GRAPE) algorithm in the case where the incoherent processes are controllable and the target time evolution is a nonunitary quantum channel. We perform a gradient search on a fidelity measure based on Choi matrices. We illustrate our algorithm by optimizing a phase qubit measurement pulse. We show how this technique can lead to a large measurement contrast close to 9999%99. We also show, within the validity of our model, that this algorithm can produce short 1.41.41.4-ns pulses with 98.298.2%98.2 contrast.
The GRAPE...jl package (https://github.com/JuliaQuantumControl/GRAPE.jl) implements Gradient Ascent Pulse Engineering, a widely used method of quantum optimal control. Its purpose is to find controls that steer a quantum system in a particular way. This is a prerequisite for next-generation quantum technology, such as quantum computing or quantum sensing. GRAPE...jl exploits the unique strengths of the Julia programming language to achieve both flexibility and numerical performance. It builds on the QuantumControl...jl framework.
This research investigates the possibility of using quantum optimal control techniques to co-optimize the energetic cost and the process fidelity of a quantum unitary gate. The energetic cost is theoretically defined, and thereby, the gradient of the energetic cost for pulse engineering is derived. We empirically demonstrate the Pareto optimality in the trade-off between process fidelity and energetic cost. Thereafter, two novel numerical quantum optimal control approaches are proposed: (i) energy-optimized gradient ascent pulse engineering (EO-GRAPE) as an open-loop gradient-based method, and (ii) energy-optimized deep reinforcement learning for pulse engineering (EO-DRLPE) as a closed-loop method. The performance of both methods is probed in the presence of increasing noise. We find that the EO-GRAPE method performs better than the EO-DRLPE methods with and without a warm start for most experimental settings. Additionally, for one qubit unitary gate, we illustrate the correlation between the Bloch sphere path length and the energetic cost.