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.15828

Robust Quantum Gate Complexity: Foundations

Johannes Aspman, Vyacheslav Kungurtsev, Jakub Mareček

Published Apr 24, 2024• 1 citation
arXivHTMLPDF

Abstract

Optimal control of closed quantum systems is a well studied geometrically elegant set of computational theory and techniques that have proven pivotal in the implementation and understanding of quantum computers. The design of a circuit itself corresponds to an optimal control problem of choosing the appropriate set of gates (which appear as control operands) in order to steer a qubit from an initial, easily prepared state, to one that is informative to the user in some sense, for e.g., an oracle whose evaluation is part of the circuit. However, contemporary devices are known to be noisy, and it is not certain that a circuit will behave as intended. Yet, although the computational tools exist in broader optimal control theory, robustness of adequate operation of a quantum control system with respect to uncertainty and errors has not yet been broadly studied in the literature. In this paper, we propose a new approach inspired by the closed quantum optimal control and its connection to geometric interpretations. To this end, we present the appropriate problem definitions of robustness in the context of quantum control, focusing on its broader implications for gate complexity.

DOI
10.48550/arxiv.2404.15828

Related papers

Semi-Analytical Geometric Synthesis of Robust Quantum Controls

Eduardo Willwock Lussi, Rafael de Santiago, Eduardo I. Duzzioni +1 more

High-fidelity quantum gates are a central requirement for fault-tolerant quantum computation, yet their implementation is limited by the sensitivity of qubits to environmental noise and by control non-idealities. To mitigate these effects, quantum gates can be designed as dynamically corrected gates (DCGs), where control sequences are engineered to suppress the impact of errors on the resulting operation. Many methods in the literature are able to synthesize DCGs, but they typically rely on numerical optimization, with synthesis times on the order of minutes per gate. Here, we propose an automated semi-analytical method that reduces this cost by orders of magnitude, synthesizing smooth, robust control pulses in tens of milliseconds rather than minutes, with comparable fidelity and robustness. Our approach is based on the Space Curve Quantum Control (SCQC) formalism, where quantum evolution is mapped onto a geometric space curve whose geometric properties determine the target gate and its robustness. We parameterize the curve in the Frenet-Serret frame and employ the Pontryagin Maximum Principle (PMP) to design controls that are robust against both amplitude and dephasing errors. The PMP is formulated as a boundary-value problem and solved using a shooting method. The Frenet-Serret frame is integrated using Rodrigues' formula. Starting from a reference solution, we gradually vary the target rotation angle to construct a library of solutions, whose interpolation provides initial guesses for the shooting parameters of new target gates. We evaluated the method on 2,000 single-qubit rotations, obtaining a mean local optimization time of 39.945 ms per gate after preparation of the interpolation base. Quantum propagation yielded nominal gate infidelities below 10^-9 after virtual phase correction, with verified robustness against quasistatic amplitude and dephasing errors.

arXiv:2611.08107•Nov 5, 2026•0 citations

Designing Robust Quantum Gates

Yuanxing Hao, Marin Bukov

For given control channels, quantum control theory determines whether quantum gates can be realized, but not their resilience to errors. We address this problem by establishing existence criteria for robust gate implementation in $d$-level systems. Our criteria reveal that implementability of all gates is not enough: a universal family of robust gates exists if and only if the driven Hamiltonians share no common symmetry. When these criteria hold, we can make gates resilient to any combination of static perturbations, uniform Hamiltonian rescaling, perturbations at a finite set of selected frequencies, and perturbations with arbitrary selected waveforms. We can impose robustness conditions broadly with limited information about errors, e.g., against any static perturbations; we can also tailor these conditions to the platform, e.g., against environment-induced noise with dominant spectral peaks, requiring no spectral details beyond the peak frequencies. We numerically construct explicit protocols for robust gates, reducing average gate infidelity by approximately two to seven orders of magnitude under Hamiltonian perturbations and environment-induced noise. Together, our existence criteria and numerical constructions provide practical guidance for evaluating the potential of quantum platforms and designing robust quantum gates.

quant-pharXiv:2610.24039•Oct 19, 2026•0 citations

Computational complexity of quantum optimal control landscapes

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

We study the Hamiltonian-independent contribution to the complexity of quantum optimal control problems. The optimization of controls that steer quantum systems to desired objectives can itself be considered a classical dynamical system that executes an analog computation. The system-independent component of the equations of motion of this dynamical system can be integrated analytically for various classes of discrete quantum control problems. For the maximization of observable expectation values from an initial pure state and the maximization of the fidelity of quantum gates, the time complexity of the corresponding computation belongs to the class continuous log (CLOG), the lowest analog complexity class, equivalent to the discrete complexity class NC. The simple scaling of the Hamiltonian-independent contribution to these problems with quantum system dimension indicates that with appropriately designed search algorithms, quantum optimal control can be rendered efficient even for large systems.

arXiv:0708.3513•Aug 27, 2007•4 citations

Robustness of dynamic quantum control: Differential sensitivity bounds

Sean P. O’Neil, Carrie Ann Weidner, EDMOND A. JONCKHEERE +2 more

Dynamic control via optimized, piecewise-constant pulses is a common paradigm for open-loop control to implement quantum gates. While numerous methods exist for the synthesis of such controls, there are many open questions regarding the robustness of the resulting control schemes in the presence of model uncertainty; unlike in classical control, there are generally no analytical guarantees on the control performance with respect to inexact modeling of the system. In this paper, a new robustness measure based on the differential sensitivity of the gate fidelity error to parametric (structured) uncertainties is introduced, and bounds on the differential sensitivity to parametric uncertainties are used to establish performance guarantees for optimal controllers for a variety of quantum gate types, system sizes, and control implementations. Specifically, it is shown how a maximum allowable perturbation over a set of Hamiltonian uncertainties that guarantees a given fidelity error can be reliably computed. This measure of robustness is inversely proportional to the upper bound on the differential sensitivity of the fidelity error evaluated under nominal operating conditions. Finally, the results show that the nominal fidelity error and differential sensitivity upper bound are positively correlated across a wide range of problems and control implementations, suggesting that in the high-fidelity control regime, rather than there being a trade-off between fidelity and robustness, higher nominal gate fidelities are positively correlated with increased robustness of the controls in the presence of parametric uncertainties.

arXiv:2401.00301•AVS Quantum Science•Jul 1, 2024•4 citations

Quantum Robust Control using Geometric Optimal Control Theory

Francesca Albertini, Domenico D'Alessandro

In this paper, we demonstrate an approach to quantum robust control based on the tools of geometric optimal control. The central objects of interest are the sensitivity functions defined as the coefficients in the Taylor expansion of the trajectory with respect to the (unknown, small) parameters which describe the deviation of the actual model from nominal one. In terms of these quantities, we formalize an optimal control problem where one searches for the optimal nominal trajectory which minimizes the size of the sensitivity while taking into account other aspects of the control design such as the energy of the control field. We consider in detail the case of a single qubit with a dephasing Hamiltonian term, and the optimal control problem of obtaining a state transfer by minimizing the weighted sum of the energy of the controlling field and the first order sensitivity. At the limit of a very large weight on the sensitivity, we obtain the optimal control which zeros the sensitivity and minimizes the control field energy. This problem has a rich mathematical structure which enables its solution in terms of elliptic integrals. For this problem, we obtain an explicit solution which is particularly simple and also smooth, avoiding discontinuities which are present in other approaches. We extend the results to the robust control of two quantum bits minimizing cross-talk contamination, as we show that such a problem decouples in two independent one qubit problems.

quant-pharXiv:2603.27894•Mar 31, 2026•2 citations

Improving quantum gate performance through neighboring optimal control

Yuchen Peng, Frank Gaitan

Successful implementation of a fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold ${P}_{a}$ exists for any quantum gate that is to be used in such a computation. Specifically, the error probability ${P}_{e}$ for such a gate must fall below the accuracy threshold: ${P}_{e}<{P}_{a}$. Estimates of ${P}_{a}$ vary widely, although ${P}_{a}\ensuremath{\sim}{10}^{\ensuremath{-}4}$ has emerged as a challenging target for hardware designers. In this paper, we present a theoretical framework based on neighboring optimal control that takes as input a good quantum gate and returns a new gate with better performance. We illustrate this approach by applying it to all gates in a universal set of quantum gates produced using nonadiabatic rapid passage that has appeared in the literature. Performance improvements are substantial, both for ideal and nonideal controls. Under suitable conditions detailed in this paper, all gate error probabilities fall well below the target threshold of ${10}^{\ensuremath{-}4}$.

arXiv:1407.8074•Physical Review A•Aug 13, 2014•2 citations
Optimal control of closed quantum systems is a well studied geometrically elegant set of computational theory and techniques that have proven pivotal in the implementation and understanding of quantum computers. The design of a circuit itself corresponds to an optimal control problem of choosing the appropriate set of gates (which appear as control operands) in order to steer a qubit from an initial, easily prepared state, to one that is informative to the user in some sense, for e.g., an oracle whose evaluation is part of the circuit. However, contemporary devices are known to be noisy, and it is not certain that a circuit will behave as intended. Yet, although the computational tools exist in broader optimal control theory, robustness of adequate operation of a quantum control system with respect to uncertainty and errors has not yet been broadly studied in the literature. In this paper, we propose a new approach inspired by the closed quantum optimal control and its connection to geometric interpretations. To this end, we present the appropriate problem definitions of robustness in the context of quantum control, focusing on its broader implications for gate complexity.
High-fidelity quantum gates are a central requirement for fault-tolerant quantum computation, yet their implementation is limited by the sensitivity of qubits to environmental noise and by control non-idealities. To mitigate these effects, quantum gates can be designed as dynamically corrected gates (DCGs), where control sequences are engineered to suppress the impact of errors on the resulting operation. Many methods in the literature are able to synthesize DCGs, but they typically rely on numerical optimization, with synthesis times on the order of minutes per gate. Here, we propose an automated semi-analytical method that reduces this cost by orders of magnitude, synthesizing smooth, robust control pulses in tens of milliseconds rather than minutes, with comparable fidelity and robustness. Our approach is based on the Space Curve Quantum Control (SCQC) formalism, where quantum evolution is mapped onto a geometric space curve whose geometric properties determine the target gate and its robustness. We parameterize the curve in the Frenet-Serret frame and employ the Pontryagin Maximum Principle (PMP) to design controls that are robust against both amplitude and dephasing errors. The PMP is formulated as a boundary-value problem and solved using a shooting method. The Frenet-Serret frame is integrated using Rodrigues' formula. Starting from a reference solution, we gradually vary the target rotation angle to construct a library of solutions, whose interpolation provides initial guesses for the shooting parameters of new target gates. We evaluated the method on 2,000 single-qubit rotations, obtaining a mean local optimization time of 39.945 ms per gate after preparation of the interpolation base. Quantum propagation yielded nominal gate infidelities below 10^-9 after virtual phase correction, with verified robustness against quasistatic amplitude and dephasing errors.
For given control channels, quantum control theory determines whether quantum gates can be realized, but not their resilience to errors. We address this problem by establishing existence criteria for robust gate implementation in ddd-level systems. Our criteria reveal that implementability of all gates is not enough: a universal family of robust gates exists if and only if the driven Hamiltonians share no common symmetry. When these criteria hold, we can make gates resilient to any combination of static perturbations, uniform Hamiltonian rescaling, perturbations at a finite set of selected frequencies, and perturbations with arbitrary selected waveforms. We can impose robustness conditions broadly with limited information about errors, e.g., against any static perturbations; we can also tailor these conditions to the platform, e.g., against environment-induced noise with dominant spectral peaks, requiring no spectral details beyond the peak frequencies. We numerically construct explicit protocols for robust gates, reducing average gate infidelity by approximately two to seven orders of magnitude under Hamiltonian perturbations and environment-induced noise. Together, our existence criteria and numerical constructions provide practical guidance for evaluating the potential of quantum platforms and designing robust quantum gates.
We study the Hamiltonian-independent contribution to the complexity of quantum optimal control problems. The optimization of controls that steer quantum systems to desired objectives can itself be considered a classical dynamical system that executes an analog computation. The system-independent component of the equations of motion of this dynamical system can be integrated analytically for various classes of discrete quantum control problems. For the maximization of observable expectation values from an initial pure state and the maximization of the fidelity of quantum gates, the time complexity of the corresponding computation belongs to the class continuous log (CLOG), the lowest analog complexity class, equivalent to the discrete complexity class NC. The simple scaling of the Hamiltonian-independent contribution to these problems with quantum system dimension indicates that with appropriately designed search algorithms, quantum optimal control can be rendered efficient even for large systems.
Dynamic control via optimized, piecewise-constant pulses is a common paradigm for open-loop control to implement quantum gates. While numerous methods exist for the synthesis of such controls, there are many open questions regarding the robustness of the resulting control schemes in the presence of model uncertainty; unlike in classical control, there are generally no analytical guarantees on the control performance with respect to inexact modeling of the system. In this paper, a new robustness measure based on the differential sensitivity of the gate fidelity error to parametric (structured) uncertainties is introduced, and bounds on the differential sensitivity to parametric uncertainties are used to establish performance guarantees for optimal controllers for a variety of quantum gate types, system sizes, and control implementations. Specifically, it is shown how a maximum allowable perturbation over a set of Hamiltonian uncertainties that guarantees a given fidelity error can be reliably computed. This measure of robustness is inversely proportional to the upper bound on the differential sensitivity of the fidelity error evaluated under nominal operating conditions. Finally, the results show that the nominal fidelity error and differential sensitivity upper bound are positively correlated across a wide range of problems and control implementations, suggesting that in the high-fidelity control regime, rather than there being a trade-off between fidelity and robustness, higher nominal gate fidelities are positively correlated with increased robustness of the controls in the presence of parametric uncertainties.
In this paper, we demonstrate an approach to quantum robust control based on the tools of geometric optimal control. The central objects of interest are the sensitivity functions defined as the coefficients in the Taylor expansion of the trajectory with respect to the (unknown, small) parameters which describe the deviation of the actual model from nominal one. In terms of these quantities, we formalize an optimal control problem where one searches for the optimal nominal trajectory which minimizes the size of the sensitivity while taking into account other aspects of the control design such as the energy of the control field. We consider in detail the case of a single qubit with a dephasing Hamiltonian term, and the optimal control problem of obtaining a state transfer by minimizing the weighted sum of the energy of the controlling field and the first order sensitivity. At the limit of a very large weight on the sensitivity, we obtain the optimal control which zeros the sensitivity and minimizes the control field energy. This problem has a rich mathematical structure which enables its solution in terms of elliptic integrals. For this problem, we obtain an explicit solution which is particularly simple and also smooth, avoiding discontinuities which are present in other approaches. We extend the results to the robust control of two quantum bits minimizing cross-talk contamination, as we show that such a problem decouples in two independent one qubit problems.
Successful implementation of a fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold Pa{P}_{a}Pa​ exists for any quantum gate that is to be used in such a computation. Specifically, the error probability Pe{P}_{e}Pe​ for such a gate must fall below the accuracy threshold: Pe<Pa{P}_{e}<{P}_{a}Pe​<Pa​. Estimates of Pa{P}_{a}Pa​ vary widely, although ${P}_{a}\ensuremath{\sim}{10}^{\ensuremath{-}4}$ has emerged as a challenging target for hardware designers. In this paper, we present a theoretical framework based on neighboring optimal control that takes as input a good quantum gate and returns a new gate with better performance. We illustrate this approach by applying it to all gates in a universal set of quantum gates produced using nonadiabatic rapid passage that has appeared in the literature. Performance improvements are substantial, both for ideal and nonideal controls. Under suitable conditions detailed in this paper, all gate error probabilities fall well below the target threshold of ${10}^{\ensuremath{-}4}$.