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

IFAC-PapersOnLine

Fast Quantum Gate Control with Trajectory Optimization

Shouliang Hu, Ming Li, Chunlin Chen, Daoyi Dong

Published Jan 1, 2024• 0 citations
Publisher

Abstract

Fast quantum control helps reduce the influence of unavoided disturbances and hence plays a vital role in practical quantum technology and chemical reactions. Instead of optimizing the terminal cost like standard optimal quantum control methods, this paper formulates the problem as a trajectory optimization problem, and implements the sequential quadratic programming algorithm to search for short control fields. The core idea is to minimize the cumulative intermediate error to incentivize early achievement of the designed gate. The numerical result on the Toffoli gate demonstrates the effectiveness of the proposed method.

DOI
10.1016/j.ifacol.2024.08.358

Related papers

Projection-operator-based Newton method for the trajectory optimization of closed quantum systems

Jieqiu Shao, Joshua Combes, John Hauser +1 more

Quantum optimal control is an important technology that enables fast state preparation and gate design. In the absence of an analytic solution, most quantum optimal control methods rely on an iterative scheme to update the solution estimate. At present, the convergence rate of existing solvers is, at most, superlinear. This paper develops a general-purpose solver for quantum optimal control based on the projection operator Newton method for trajectory optimization, or PRONTO. Specifically, the proposed approach uses a projection operator to incorporate the Schr\"odinger equation directly into the cost function, which is then minimized using Newton's descent method. At each iteration, the descent direction is obtained by computing the analytic solution to a linear-quadratic trajectory-optimization problem. The resulting method guarantees monotonic convergence at every iteration and quadratic convergence in the proximity of the solution. The potential of PRONTO is showcased by solving the optimal state-to-state mapping problem for a qubit and providing comparisons to a state-of-the-art quantum optimal control method.

arXiv:2111.08795•Physical Review A•Mar 9, 2022•12 citations

Robust control of single-qubit gates at the quantum speed limit

Xi Cao, Jiangyu Cui, Man Hong Yung +1 more

Fastness and robustness are both critical in the implementation of high-fidelity gates for quantum computation, but in practice a trade-off has to be made between them. In this paper, we investigate the robust time-optimal control problem that aims at the best balance. Based on the Taylor expansion of the system in terms of uncertainty parameters, we formulate the design problem as the optimal control of an augmented finite-dimensional system at its quantum speed limit (QSL), where the robustness is graded by the order of series truncation. The gradient-descent algorithm is then introduced to sequentially seek QSLs corresponding to different orders of robustness. Numerical simulations are carried out for single-qubit systems with frequency and field amplitude uncertainties, and the obtained time-optimal control pulses can effectively suppress gate errors to the prescribed robustness order. These results provide a practical guide for selecting pulse lengths in the pulse-level compilation of quantum circuits.

arXiv:2309.05360•Physical Review A•Aug 5, 2024•4 citations

Optimal control theory for continuous-variable quantum gates

Re-Bing Wu, Raj Chakrabarti, HERSCHEL A. RABITZ

The methodology of optimal control theory is applied to the problem of implementing quantum gates in continuous-variable (CV) systems with quadratic Hamiltonians. We demonstrate that it is possible to define a fidelity measure for CV gate optimization that is devoid of traps, such that the search for optimal control fields using local algorithms will not be hindered. The optimal control of several quantum computing gates, as well as that of algorithms composed of these primitives, is investigated using several typical physical models and compared for discrete-variable and continuous-variable quantum systems. Numerical simulations indicate that the optimization of generic CV quantum gates is inherently more expensive than that of generic discrete variable quantum gates, but can be routinely achieved for all the major classes of computing primitives. The exact-time controllability of CV systems, hitherto largely ignored in the design of information processing models, is shown to play an important role in determining the maximal achievable gate fidelity. Moreover, the ability to control interactions between qunits can be exploited to delimit the total control fluence. Future experimental model systems should carefully tune these parameters so as to enable the implementation of CV quantum information processing with optimal fidelity.

arXiv:0708.2118•Physical Review A•May 1, 2008•34 citations

Hybrid optimization schemes for quantum control

Michael H. Goerz, K. Birgitta Whaley, Christiane P. Koch

Optimal control theory is a powerful tool for solving control problems in quantum mechanics, ranging from the control of chemical reactions to the implementation of gates in a quantum computer. Gradient-based optimization methods are able to find high fidelity controls, but require considerable numerical effort and often yield highly complex solutions. We propose here to employ a two-stage optimization scheme to significantly speed up convergence and achieve simpler controls. The control is initially parametrized using only a few free parameters, such that optimization in this pruned search space can be performed with a simplex method. The result, considered now simply as an arbitrary function on a time grid, is the starting point for further optimization with a gradient-based method that can quickly converge to high fidelities. We illustrate the success of this hybrid technique by optimizing a geometric phase gate for two superconducting transmon qubits coupled with a shared transmission line resonator, showing that a combination of Nelder-Mead simplex and Krotov’s method yields considerably better results than either one of the two methods alone.

arXiv:1505.05331•EPJ Quantum Technology•Sep 17, 2015•47 citations

Low-Thrust Trajectory Optimization with Quantum Computing and Sequential Convex Programming

Carmine Giordano

Low-thrust trajectory optimization is a central task in interplanetary mission design, but its nonlinear dynamics and operational constraints often lead to challenging non-convex optimal-control problems. Sequential convex programming has emerged as an effective approach to address these problems, while quantum annealing offers a complementary paradigm for solving quadratic unconstrained binary optimization problems. This paper introduces quSCP, a quantum-based sequential convex programming framework that reformulates each convex subproblem as a quadratic unconstrained binary optimization problem suitable for quantum and hybrid quantum--classical solvers. Equality, inequality, and trust-region constraints are embedded through quadratic penalty terms, while an iterative refinement strategy is used to reduce the accuracy loss introduced by binary discretization. The method is assessed on a fuel-optimal Earth--Mars low-thrust transfer by comparing standard sequential convex programming, a continuous quadratic unconstrained formulation, direct quantum processing unit sampling, and D-Wave hybrid solvers. Results show that quSCP produces physically consistent trajectories with propellant consumption and nonlinear constraint violations close to classical benchmarks. Direct quantum annealing is feasible only for small instances because of embedding overhead and hardware connectivity limits, whereas hybrid solvers scale to larger discretizations. Although no computational quantum advantage is demonstrated with current hardware, the results show that quantum and hybrid quantum--classical optimization can already provide competitive solutions for demanding trajectory design problems.

arXiv:2609.00861•Sep 1, 2026•0 citations

A Guided Differential Evolution Algorithm for Control Design of Quantum Gates

Shouliang Hu, Hailan Ma, Chunlin Chen

Constructing high fidelity quantum gates is a key task in quantum information technology. Gradient-based methods (e.g., GRAPE) have been widely used for numerous implementations of quantum gate control tasks but are not practical for in-situ laboratory experiments. In this paper, for the design of optimal control fields for constructing quantum gates, we propose a Guided Differential Evolution (GDE) algorithm. Numerical results verify the effectiveness of the proposed GDE algorithm for the control design of quantum gates with short evolution time and few control pulses.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 17, 2021•1 citation
Fast quantum control helps reduce the influence of unavoided disturbances and hence plays a vital role in practical quantum technology and chemical reactions. Instead of optimizing the terminal cost like standard optimal quantum control methods, this paper formulates the problem as a trajectory optimization problem, and implements the sequential quadratic programming algorithm to search for short control fields. The core idea is to minimize the cumulative intermediate error to incentivize early achievement of the designed gate. The numerical result on the Toffoli gate demonstrates the effectiveness of the proposed method.
Quantum optimal control is an important technology that enables fast state preparation and gate design. In the absence of an analytic solution, most quantum optimal control methods rely on an iterative scheme to update the solution estimate. At present, the convergence rate of existing solvers is, at most, superlinear. This paper develops a general-purpose solver for quantum optimal control based on the projection operator Newton method for trajectory optimization, or PRONTO. Specifically, the proposed approach uses a projection operator to incorporate the Schr\"odinger equation directly into the cost function, which is then minimized using Newton's descent method. At each iteration, the descent direction is obtained by computing the analytic solution to a linear-quadratic trajectory-optimization problem. The resulting method guarantees monotonic convergence at every iteration and quadratic convergence in the proximity of the solution. The potential of PRONTO is showcased by solving the optimal state-to-state mapping problem for a qubit and providing comparisons to a state-of-the-art quantum optimal control method.
Fastness and robustness are both critical in the implementation of high-fidelity gates for quantum computation, but in practice a trade-off has to be made between them. In this paper, we investigate the robust time-optimal control problem that aims at the best balance. Based on the Taylor expansion of the system in terms of uncertainty parameters, we formulate the design problem as the optimal control of an augmented finite-dimensional system at its quantum speed limit (QSL), where the robustness is graded by the order of series truncation. The gradient-descent algorithm is then introduced to sequentially seek QSLs corresponding to different orders of robustness. Numerical simulations are carried out for single-qubit systems with frequency and field amplitude uncertainties, and the obtained time-optimal control pulses can effectively suppress gate errors to the prescribed robustness order. These results provide a practical guide for selecting pulse lengths in the pulse-level compilation of quantum circuits.
The methodology of optimal control theory is applied to the problem of implementing quantum gates in continuous-variable (CV) systems with quadratic Hamiltonians. We demonstrate that it is possible to define a fidelity measure for CV gate optimization that is devoid of traps, such that the search for optimal control fields using local algorithms will not be hindered. The optimal control of several quantum computing gates, as well as that of algorithms composed of these primitives, is investigated using several typical physical models and compared for discrete-variable and continuous-variable quantum systems. Numerical simulations indicate that the optimization of generic CV quantum gates is inherently more expensive than that of generic discrete variable quantum gates, but can be routinely achieved for all the major classes of computing primitives. The exact-time controllability of CV systems, hitherto largely ignored in the design of information processing models, is shown to play an important role in determining the maximal achievable gate fidelity. Moreover, the ability to control interactions between qunits can be exploited to delimit the total control fluence. Future experimental model systems should carefully tune these parameters so as to enable the implementation of CV quantum information processing with optimal fidelity.
Optimal control theory is a powerful tool for solving control problems in quantum mechanics, ranging from the control of chemical reactions to the implementation of gates in a quantum computer. Gradient-based optimization methods are able to find high fidelity controls, but require considerable numerical effort and often yield highly complex solutions. We propose here to employ a two-stage optimization scheme to significantly speed up convergence and achieve simpler controls. The control is initially parametrized using only a few free parameters, such that optimization in this pruned search space can be performed with a simplex method. The result, considered now simply as an arbitrary function on a time grid, is the starting point for further optimization with a gradient-based method that can quickly converge to high fidelities. We illustrate the success of this hybrid technique by optimizing a geometric phase gate for two superconducting transmon qubits coupled with a shared transmission line resonator, showing that a combination of Nelder-Mead simplex and Krotov’s method yields considerably better results than either one of the two methods alone.
Low-thrust trajectory optimization is a central task in interplanetary mission design, but its nonlinear dynamics and operational constraints often lead to challenging non-convex optimal-control problems. Sequential convex programming has emerged as an effective approach to address these problems, while quantum annealing offers a complementary paradigm for solving quadratic unconstrained binary optimization problems. This paper introduces quSCP, a quantum-based sequential convex programming framework that reformulates each convex subproblem as a quadratic unconstrained binary optimization problem suitable for quantum and hybrid quantum--classical solvers. Equality, inequality, and trust-region constraints are embedded through quadratic penalty terms, while an iterative refinement strategy is used to reduce the accuracy loss introduced by binary discretization. The method is assessed on a fuel-optimal Earth--Mars low-thrust transfer by comparing standard sequential convex programming, a continuous quadratic unconstrained formulation, direct quantum processing unit sampling, and D-Wave hybrid solvers. Results show that quSCP produces physically consistent trajectories with propellant consumption and nonlinear constraint violations close to classical benchmarks. Direct quantum annealing is feasible only for small instances because of embedding overhead and hardware connectivity limits, whereas hybrid solvers scale to larger discretizations. Although no computational quantum advantage is demonstrated with current hardware, the results show that quantum and hybrid quantum--classical optimization can already provide competitive solutions for demanding trajectory design problems.
Constructing high fidelity quantum gates is a key task in quantum information technology. Gradient-based methods (e.g., GRAPE) have been widely used for numerous implementations of quantum gate control tasks but are not practical for in-situ laboratory experiments. In this paper, for the design of optimal control fields for constructing quantum gates, we propose a Guided Differential Evolution (GDE) algorithm. Numerical results verify the effectiveness of the proposed GDE algorithm for the control design of quantum gates with short evolution time and few control pulses.