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:2503.09593 · Physical Review A

Monte Carlo approach for finding optimally controlled quantum gates with differential geometry

Adonai Hilário da Silva, L. K. Castelano, Reginaldo de Jesus Napolitano

Published Oct 8, 2025• 3 citations
arXivHTMLPDF

Abstract

A unitary evolution in time may be treated as a curve in the manifold of the special unitary group. The length of such a curve can be related to the energetic cost of the associated computation, meaning a geodesic curve identifies an energetically optimal path. In this work, we employ sub-Riemannian geometry on the manifold of the unitary group to obtain optimally designed Hamiltonians for generating single-qubit gates in an environment with the presence of dephasing noise as well as a two-qubit gate under a time-constant crosstalk interaction. The resulting geodesic equation involves knowing the initial conditions of the parameters that cannot be obtained analytically. We then introduce a random sampling method combined with a minimization function and a cost function to find initial conditions that lead to optimal control fields. We also compare the optimized control fields obtained from the solutions of the geodesic equation with those extracted from the well-known Krotov method. Both approaches provide high-fidelity values for the desired quantum gate implementation, but the geodesic method has the advantage of minimizing the required energy to execute the same task. These findings bring insights for the design of more efficient fields in the arsenal of optimal control theory.

DOI
10.1103/c76s-d7pw

Related papers

Optimal control for one- and two-qubit gates as a geodesic problem

Adonai Hilário da Silva

The main goal of this work is to make use of sub-Riemannian geometry and Pontryagins Maximum Principle to investigate optimal control for computing one- and two-qubit quantum gates, as well as to analyze how the presence of uncontrollable interactions, such as noise and cross-talk operators, influence on the energetic cost of performing such unitary operations. Initially, we study the case of a single noisy qubit. We aim to identify sub-Riemannian geodesics that connect the identity to a unitary operation, sufficiently close to the ideal case, despite the presence of decoherence noise. Next, we expand the study to the case of two qubits, initially only under a time-constant cross-talk interaction, and then, under both: cross-talk interaction and decoherence noise. For all case studies, the main challenge lies in determining the unknown parameters in the geodesic equation for the desired unitary operator. We present a novel method, based on random sampling, for determining such parameters and how they can lead to high-fidelity quantum gates which are synthesized through smooth external control fields.

•Dec 5, 2025•0 citations

Optimized continuous dynamical decoupling via differential geometry and machine learning

Nicolas André da Costa Morazotti, Adonai Hilário da Silva, Gabriel Audi +2 more

We introduce a strategy to develop optimally designed fields for continuous dynamical decoupling. Using our methodology, we obtain the optimal continuous field configuration to maximize the fidelity of a general one-qubit quantum gate. To achieve this, considering dephasing-noise perturbations, we employ an auxiliary qubit instead of the boson bath to implement a purification scheme, which results in unitary dynamics. Employing the sub-Riemannian geometry framework for the two-qubit unitary group, we derive and numerically solve the geodesic equations, obtaining the optimal time-dependent control Hamiltonian. Also, due to the extended time required to find solutions to the geodesic equations, we train a neural network on a subset of geodesic solutions, enabling us to promptly generate the time-dependent control Hamiltonian for any desired gate, which is crucial in circuit optimization.

arXiv:2310.08417•Physical Review A•Oct 1, 2024•10 citations

Quantum Computational Riemannian and Sub-Riemannian Geodesics

Kosuke Shizume, Takao Nakajima, Ryo Nakayama +1 more

Nielsen et al. have introduced a Riemannian metric on the space of n-qubit unitary operators [M. A. Nielsen, M. R. Dowling, M. Gu and A. C. Doherty, Science 311 (2006), 1133]. The length of the shortest curve connecting the identity I and a desired unitary operator W defined by this metric is essentially equivalent to the quantum gate complexity of W. This metric, and thus, the Riemannian geodesic equation for this metric, has a parameter q called “penalty” that must be large enough. In this paper, we investigate the sub-Riemannian geodesic equation obtained by taking the limit of the Riemannian geodesic equation as q →∞, and show that the Riemannian geodesics for finite q can be explicitly constructed from the sub-Riemannian geodesics. We also present a numerical algorithm for finding the (sub-)Riemannian geodesics connecting I and W, which is based on the Krotov method in optimal control theory. As an example, we give an exact sub-Riemannian geodesic connecting I and the controlled-controlled-Z gate, which is obtained by guessing from the numerical results of the algorithm.

Progress of Theoretical Physics•Jun 1, 2012•9 citations

Time-optimal quantum control via differential geometry

Xiaoting Wang, Michele Allegra, Kurt A. Jacobs +3 more

Compared with many other methods which only give time sub-optimal designs, the quantum brachistochrone equation has a great potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far it has been of limited use, however, due to the inadequacy of conventional numerical methods to solve it. Here, using differential geometry, we reformulate the quantum brachistochrone curves as geodesics on the unitary group. This identification allows us to design a numerical method that can efficiently solve the brachistochrone problem by first solving a family of geodesic equations.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 20, 2017•4 citations

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

The geometry of quantum computation

Mark R. Dowling, Michael A. Nielsen

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.

Quantum Information and Computation•Nov 1, 2008•130 citations
A unitary evolution in time may be treated as a curve in the manifold of the special unitary group. The length of such a curve can be related to the energetic cost of the associated computation, meaning a geodesic curve identifies an energetically optimal path. In this work, we employ sub-Riemannian geometry on the manifold of the unitary group to obtain optimally designed Hamiltonians for generating single-qubit gates in an environment with the presence of dephasing noise as well as a two-qubit gate under a time-constant crosstalk interaction. The resulting geodesic equation involves knowing the initial conditions of the parameters that cannot be obtained analytically. We then introduce a random sampling method combined with a minimization function and a cost function to find initial conditions that lead to optimal control fields. We also compare the optimized control fields obtained from the solutions of the geodesic equation with those extracted from the well-known Krotov method. Both approaches provide high-fidelity values for the desired quantum gate implementation, but the geodesic method has the advantage of minimizing the required energy to execute the same task. These findings bring insights for the design of more efficient fields in the arsenal of optimal control theory.
The main goal of this work is to make use of sub-Riemannian geometry and Pontryagins Maximum Principle to investigate optimal control for computing one- and two-qubit quantum gates, as well as to analyze how the presence of uncontrollable interactions, such as noise and cross-talk operators, influence on the energetic cost of performing such unitary operations. Initially, we study the case of a single noisy qubit. We aim to identify sub-Riemannian geodesics that connect the identity to a unitary operation, sufficiently close to the ideal case, despite the presence of decoherence noise. Next, we expand the study to the case of two qubits, initially only under a time-constant cross-talk interaction, and then, under both: cross-talk interaction and decoherence noise. For all case studies, the main challenge lies in determining the unknown parameters in the geodesic equation for the desired unitary operator. We present a novel method, based on random sampling, for determining such parameters and how they can lead to high-fidelity quantum gates which are synthesized through smooth external control fields.
We introduce a strategy to develop optimally designed fields for continuous dynamical decoupling. Using our methodology, we obtain the optimal continuous field configuration to maximize the fidelity of a general one-qubit quantum gate. To achieve this, considering dephasing-noise perturbations, we employ an auxiliary qubit instead of the boson bath to implement a purification scheme, which results in unitary dynamics. Employing the sub-Riemannian geometry framework for the two-qubit unitary group, we derive and numerically solve the geodesic equations, obtaining the optimal time-dependent control Hamiltonian. Also, due to the extended time required to find solutions to the geodesic equations, we train a neural network on a subset of geodesic solutions, enabling us to promptly generate the time-dependent control Hamiltonian for any desired gate, which is crucial in circuit optimization.
Nielsen et al. have introduced a Riemannian metric on the space of n-qubit unitary operators [M. A. Nielsen, M. R. Dowling, M. Gu and A. C. Doherty, Science 311 (2006), 1133]. The length of the shortest curve connecting the identity I and a desired unitary operator W defined by this metric is essentially equivalent to the quantum gate complexity of W. This metric, and thus, the Riemannian geodesic equation for this metric, has a parameter q called “penalty” that must be large enough. In this paper, we investigate the sub-Riemannian geodesic equation obtained by taking the limit of the Riemannian geodesic equation as q →∞, and show that the Riemannian geodesics for finite q can be explicitly constructed from the sub-Riemannian geodesics. We also present a numerical algorithm for finding the (sub-)Riemannian geodesics connecting I and W, which is based on the Krotov method in optimal control theory. As an example, we give an exact sub-Riemannian geodesic connecting I and the controlled-controlled-Z gate, which is obtained by guessing from the numerical results of the algorithm.
Compared with many other methods which only give time sub-optimal designs, the quantum brachistochrone equation has a great potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far it has been of limited use, however, due to the inadequacy of conventional numerical methods to solve it. Here, using differential geometry, we reformulate the quantum brachistochrone curves as geodesics on the unitary group. This identification allows us to design a numerical method that can efficiently solve the brachistochrone problem by first solving a family of geodesic equations.
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.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.