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

Quantum Information and Computation

Optimal holonomic quantum gates

A. O. Niskanen, Mikio Nakahara, M.M. Salomaa

Published Nov 1, 2002• 4 citations
Publisher

Abstract

We study the construction of holonomy loops numerically in a realization-independent model of holonomic quantum computation. The aim is twofold. First, we present our technique of finding the suitable loop in the control manifold for any one-qubit and two-qubit unitary gates. Second, we develop the formalism further and add a penalty term for the length of the loop, thereby aiming to minimize the execution time for the quantum computation. Our method provides a general means by which holonomy loops can be realized in an experimental setup. Since holonomic quantum computation is adiabatic, optimizing with respect to the length of the loop may prove crucial.

DOI
10.26421/qic2.s-6

Related papers

Realization of arbitrary gates in holonomic quantum computation

A. O. Niskanen, Mikio Nakahara, Martti M. Salomaa

Among the many proposals for the realization of a quantum computer, holonomic quantum computation is distinguished from the rest as it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space generating this matrix as a holonomy. We demonstrate that such a one-qubit gate as the Hadamard gate and such two-qubit gates as the controlled-NOT gate and the SWAP gate, and the discrete Fourier transformation can be obtained with a single loop.

arXiv:quant-ph/0209015•Physical Review A•Jan 29, 2003•29 citations

HOLONOMIC QUANTUM COMPUTING AND ITS OPTIMIZATION

Shogo Tanimura

Holonomic quantum computer uses a non-Abelian adiabatic phase associated with a control-parameter loop as a unitary gate. Holonomic computation should be processed slowly for keeping adiabaticity. On the other hand, holonomic computation should be executed in a short time for avoiding decoherence. These two requests, the slow process and the quick execution, seem contradictory each other and lead to a kind of optimization problem, which is called the isoholonomic problem. In this lecture we review the formulation of the holonomy in quantum mechanics and the solution of the optimal control problem of the holonomy. We also discuss possible implementations of the holonomic quantum computer.

•Apr 1, 2008•0 citations

QUANTUM HOLONOMIES FOR QUANTUM COMPUTING

Jiannis K. Pachos, Paolo Zanardi

Holonomic Quantum Computation (HQC) is an all-geometrical approach to quantum information processing. In the HQC strategy information is encoded in degenerate eigen-spaces of a parametric family of Hamiltonians. The computational network of unitary quantum gates is realized by driving adiabatically the Hamiltonian parameters along loops in a control manifold. By properly designing such loops the nontrivial curvature of the underlying bundle geometry gives rise to unitary transformations i.e., holonomies that implement the desired unitary transformations. Conditions necessary for universal QC are stated in terms of the curvature associated to the non-abelian gauge potential (connection) over the control manifold. In view of their geometrical nature the holonomic gates are robust against several kind of perturbations and imperfections. This fact along with the adiabatic fashion in which gates are performed makes in principle HQC an appealing way towards universal fault-tolerant QC.

arXiv:quant-ph/0007110•International Journal of Modern Physics B•Apr 10, 2001•138 citations

Single-loop realization of universal nonadiabatic holonomic gates in decoherence-free subspaces

Chang Wang, Zhenping Guo

Control errors and decoherence are two main obstacles for realization of quantum computation. Nonadiabatic holonomic quantum computation in decoherence-free subspaces can protect quantum gates from both control errors and decoherence, and, therefore, it has received increasing attention. The original protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces needs two loops in the Grassmann manifold to generate an arbitrary nonadiabatic holonomic one-qubit gate. In this paper, we proposed a protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, where an arbitrary one-qubit gate is generated by only a single loop in the Grassmann manifold and an entangling two-qubit gate assisted by two single-qubit gates can be used to construct a two-qubit controlled unitary gate. In addition, the encoding of our protocol for nonadiabatic holonomic gates requires a lower number of physical qubits compared with previous schemes. Our scheme not only maintains the merits of the original protocol but it also avoids the extra work of combining two gates to realize an arbitrary one-qubit gate.

Europhysics Letters (EPL)•Dec 10, 2018•8 citations

Single-loop multiple-pulse nonadiabatic holonomic quantum gates

Emmi Herterich, Erik Sjöqvist

Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [E. Sj\"oqvist et al., New J. Phys. 14, 103035 (2012)] needs two loops in the Grassmann manifold (i.e., the space of computational subspaces of the full state space) to generate an arbitrary holonomic one-qubit gate, we propose single-loop one-qubit gates that constitute an efficient universal set of holonomic gates when combined with an entangling holonomic two-qubit gate. Our one-qubit gate is realized by dividing the loop into path segments, each of which is generated by a $\mathrm{\ensuremath{\Lambda}}$-type Hamiltonian. We demonstrate that two path segments are sufficient to realize arbitrary single-loop holonomic one-qubit gates. We describe how our scheme can be implemented experimentally in a generic atomic system exhibiting a three-level $\mathrm{\ensuremath{\Lambda}}$-coupling structure by utilizing carefully chosen laser pulses.

arXiv:1608.07418•Physical Review A•Nov 9, 2016•97 citations

Holonomic Quantum Computing

Deep Bhattacharjee

We present a geometric framework for holonomic quantum computing in which quantum gates arise from global properties of control manifolds rather than fine-tuned dynamical evolution. Quantum states are modeled as complex projective fibers over a classical control manifold, and adiabatic loops induce unitary gates through Berry and Wilczek–Zee holonomy. Within this setting, we introduce _Quantum Inner State Manifolds_ (QISMs) as symplectic fiber bundles equipped with a natural unitary connection governed by the Fubini–Study form. Using the Ambrose–Singer theorem, we show that generic QISMs generate holonomy groups dense in \(U{(N)}\), establishing universality. Fault tolerance emerges from global geometric features, providing a robust geometric foundation for quantum gate design.

Qeios•Jan 17, 2026•1 citation
We study the construction of holonomy loops numerically in a realization-independent model of holonomic quantum computation. The aim is twofold. First, we present our technique of finding the suitable loop in the control manifold for any one-qubit and two-qubit unitary gates. Second, we develop the formalism further and add a penalty term for the length of the loop, thereby aiming to minimize the execution time for the quantum computation. Our method provides a general means by which holonomy loops can be realized in an experimental setup. Since holonomic quantum computation is adiabatic, optimizing with respect to the length of the loop may prove crucial.
Among the many proposals for the realization of a quantum computer, holonomic quantum computation is distinguished from the rest as it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space generating this matrix as a holonomy. We demonstrate that such a one-qubit gate as the Hadamard gate and such two-qubit gates as the controlled-NOT gate and the SWAP gate, and the discrete Fourier transformation can be obtained with a single loop.
Holonomic quantum computer uses a non-Abelian adiabatic phase associated with a control-parameter loop as a unitary gate. Holonomic computation should be processed slowly for keeping adiabaticity. On the other hand, holonomic computation should be executed in a short time for avoiding decoherence. These two requests, the slow process and the quick execution, seem contradictory each other and lead to a kind of optimization problem, which is called the isoholonomic problem. In this lecture we review the formulation of the holonomy in quantum mechanics and the solution of the optimal control problem of the holonomy. We also discuss possible implementations of the holonomic quantum computer.
Holonomic Quantum Computation (HQC) is an all-geometrical approach to quantum information processing. In the HQC strategy information is encoded in degenerate eigen-spaces of a parametric family of Hamiltonians. The computational network of unitary quantum gates is realized by driving adiabatically the Hamiltonian parameters along loops in a control manifold. By properly designing such loops the nontrivial curvature of the underlying bundle geometry gives rise to unitary transformations i.e., holonomies that implement the desired unitary transformations. Conditions necessary for universal QC are stated in terms of the curvature associated to the non-abelian gauge potential (connection) over the control manifold. In view of their geometrical nature the holonomic gates are robust against several kind of perturbations and imperfections. This fact along with the adiabatic fashion in which gates are performed makes in principle HQC an appealing way towards universal fault-tolerant QC.
Control errors and decoherence are two main obstacles for realization of quantum computation. Nonadiabatic holonomic quantum computation in decoherence-free subspaces can protect quantum gates from both control errors and decoherence, and, therefore, it has received increasing attention. The original protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces needs two loops in the Grassmann manifold to generate an arbitrary nonadiabatic holonomic one-qubit gate. In this paper, we proposed a protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, where an arbitrary one-qubit gate is generated by only a single loop in the Grassmann manifold and an entangling two-qubit gate assisted by two single-qubit gates can be used to construct a two-qubit controlled unitary gate. In addition, the encoding of our protocol for nonadiabatic holonomic gates requires a lower number of physical qubits compared with previous schemes. Our scheme not only maintains the merits of the original protocol but it also avoids the extra work of combining two gates to realize an arbitrary one-qubit gate.
Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [E. Sj\"oqvist et al., New J. Phys. 14, 103035 (2012)] needs two loops in the Grassmann manifold (i.e., the space of computational subspaces of the full state space) to generate an arbitrary holonomic one-qubit gate, we propose single-loop one-qubit gates that constitute an efficient universal set of holonomic gates when combined with an entangling holonomic two-qubit gate. Our one-qubit gate is realized by dividing the loop into path segments, each of which is generated by a $\mathrm{\ensuremath{\Lambda}}$-type Hamiltonian. We demonstrate that two path segments are sufficient to realize arbitrary single-loop holonomic one-qubit gates. We describe how our scheme can be implemented experimentally in a generic atomic system exhibiting a three-level $\mathrm{\ensuremath{\Lambda}}$-coupling structure by utilizing carefully chosen laser pulses.
We present a geometric framework for holonomic quantum computing in which quantum gates arise from global properties of control manifolds rather than fine-tuned dynamical evolution. Quantum states are modeled as complex projective fibers over a classical control manifold, and adiabatic loops induce unitary gates through Berry and Wilczek–Zee holonomy. Within this setting, we introduce _Quantum Inner State Manifolds_ (QISMs) as symplectic fiber bundles equipped with a natural unitary connection governed by the Fubini–Study form. Using the Ambrose–Singer theorem, we show that generic QISMs generate holonomy groups dense in U(N)U{(N)}U(N), establishing universality. Fault tolerance emerges from global geometric features, providing a robust geometric foundation for quantum gate design.