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:quant-ph/0007110 · International Journal of Modern Physics B

QUANTUM HOLONOMIES FOR QUANTUM COMPUTING

Jiannis K. Pachos, Paolo Zanardi A

Published Apr 10, 2001• 135 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1142/s0217979201004836

Related papers

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•0 citations

Optical Holonomic Quantum Computation

Demosthenes Ellinas, Jiannis K. Pachos

Holonomic quantum computation (HQC) is materialized here with quantum optics components. Holonomies are the generalization of the Berry phases to unitary matrices. In a nonlinear Kerr medium the degenerate states of a laser beams are interpreted as qubits. Control manipulations with displacers, squeezers and two-mode interfering devices in a cyclic, adiabatic fashion produces holonomies. Hence, they are employed as logical gates for our HQC proposal. The effects of errors from imperfect control of classical parameters, the looping variation of which builds up holonomic gates, are also investigated. Additionally, the influence of quantum decoherence on holonomic tele-portation used as a computational primitive is studied, and particular features of control error resilience are discussed.

arXiv:quant-ph/0111075•Optical Fiber Communication Conference•Jan 1, 2001•0 citations

Holonomic quantum computation

Paolo Zanardi A

We show that the notion of generalized Berry phase i.e., non-abelian holonomy, can be used for enabling quantum computation. The computational space is realized by a $n$-fold degenerate eigenspace of a family of Hamiltonians parametrized by a manifold $\\cal M$. The point of $\\cal M$ represents classical configuration of control fields and, for multi-partite systems, couplings between subsystem. Adiabatic loops in the control manifold $\\cal M$ induce non trivial unitary transformations on the computational space. For a generic system it is shown that this mechanism allows for universal quantum computation by composing a generic pair of loops in $\\cal M.$

Cambridge University Press eBooks•Sep 5, 2013•1 citation

Non-Abelian Berry connections for quantum computation

Jiannis K. Pachos, Paolo Zanardi A, Mario Rasetti

In the holonomic approach to quantum computation, information is encoded in a degenerate eigenspace of a parametric family of Hamiltonians and manipulated by the associated holonomic gates. These are realized in terms of the non-Abelian Berry connection and are obtained by driving the control parameters along adiabatic loops. We show how it is possible for a specific model to explicitly determine the loops generating any desired logical gate, thus producing a universal set of unitary transformations. In a multipartite system unitary transformations can be implemented efficiently by sequences of local holonomic gates. Moreover, a conceptual scheme for obtaining the required Hamiltonian family, based on frequently repeated pulses, is discussed, together with a possible process whereby the initial state can be prepared and the final one can be measured.

arXiv:quant-ph/9907103•Physical Review A•Dec 13, 1999•316 citations

Scheme for fault-tolerant holonomic computation on stabilizer codes

Ognyan Oreshkov, Todd A. Brun, Daniel A. Lidar

This paper generalizes and expands upon the work [O. Oreshkov, T. A. Brun, and D. A. Lidar, Phys. Rev. Lett. 102, 070502 (2009)] where we introduced a scheme for fault-tolerant holonomic quantum computation (HQC) on stabilizer codes. HQC is an all-geometric strategy based on non-Abelian adiabatic holonomies, which is known to be robust against various types of errors in the control parameters. The scheme we present shows that HQC is a scalable method of computation and opens the possibility for combining the benefits of error correction with the inherent resilience of the holonomic approach. We show that with the Bacon-Shor code the scheme can be implemented using Hamiltonian operators of weights 2 and 3.

arXiv:0904.2143•Physical Review A•Aug 19, 2009•18 citations

Speeding up adiabatic holonomic quantum gates via π-pulse modulation

Jiang Zhang, Tonghao Xing, Guilu Long

Holonomic quantum computation (HQC) offers an inherently robust approach to quantum gate implementation by exploiting quantum holonomies. While adiabatic HQC benefits from robustness against certain control errors, its long runtime limits practical utility due to increased exposure to environmental noise. Nonadiabatic HQC addresses this issue by enabling faster gate operations but compromises robustness. In this work, we propose a scheme for fast holonomic quantum gates based on the π -pulse method, which accelerates adiabatic evolution while preserving its robustness. By guiding the system Hamiltonian along geodesic paths in the parameter space and applying phase-modulating π pulses at discrete points, we realize a universal set of holonomic gates beyond the conventional adiabatic limit. Our scheme allows for arbitrary single-qubit and two-qubit controlled gates within a single-loop evolution and provides additional tunable parameters for flexible gate design. These results demonstrate a promising path toward high-fidelity, fast, and robust quantum computation .

arXiv:2506.09326•Fundamental Research•May 13, 2025•2 citations
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.
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.
Holonomic quantum computation (HQC) is materialized here with quantum optics components. Holonomies are the generalization of the Berry phases to unitary matrices. In a nonlinear Kerr medium the degenerate states of a laser beams are interpreted as qubits. Control manipulations with displacers, squeezers and two-mode interfering devices in a cyclic, adiabatic fashion produces holonomies. Hence, they are employed as logical gates for our HQC proposal. The effects of errors from imperfect control of classical parameters, the looping variation of which builds up holonomic gates, are also investigated. Additionally, the influence of quantum decoherence on holonomic tele-portation used as a computational primitive is studied, and particular features of control error resilience are discussed.
We show that the notion of generalized Berry phase i.e., non-abelian holonomy, can be used for enabling quantum computation. The computational space is realized by a nnn-fold degenerate eigenspace of a family of Hamiltonians parametrized by a manifold calM\\cal McalM. The point of calM\\cal McalM represents classical configuration of control fields and, for multi-partite systems, couplings between subsystem. Adiabatic loops in the control manifold calM\\cal McalM induce non trivial unitary transformations on the computational space. For a generic system it is shown that this mechanism allows for universal quantum computation by composing a generic pair of loops in calM.\\cal M.calM.
In the holonomic approach to quantum computation, information is encoded in a degenerate eigenspace of a parametric family of Hamiltonians and manipulated by the associated holonomic gates. These are realized in terms of the non-Abelian Berry connection and are obtained by driving the control parameters along adiabatic loops. We show how it is possible for a specific model to explicitly determine the loops generating any desired logical gate, thus producing a universal set of unitary transformations. In a multipartite system unitary transformations can be implemented efficiently by sequences of local holonomic gates. Moreover, a conceptual scheme for obtaining the required Hamiltonian family, based on frequently repeated pulses, is discussed, together with a possible process whereby the initial state can be prepared and the final one can be measured.
This paper generalizes and expands upon the work [O. Oreshkov, T. A. Brun, and D. A. Lidar, Phys. Rev. Lett. 102, 070502 (2009)] where we introduced a scheme for fault-tolerant holonomic quantum computation (HQC) on stabilizer codes. HQC is an all-geometric strategy based on non-Abelian adiabatic holonomies, which is known to be robust against various types of errors in the control parameters. The scheme we present shows that HQC is a scalable method of computation and opens the possibility for combining the benefits of error correction with the inherent resilience of the holonomic approach. We show that with the Bacon-Shor code the scheme can be implemented using Hamiltonian operators of weights 2 and 3.
Holonomic quantum computation (HQC) offers an inherently robust approach to quantum gate implementation by exploiting quantum holonomies. While adiabatic HQC benefits from robustness against certain control errors, its long runtime limits practical utility due to increased exposure to environmental noise. Nonadiabatic HQC addresses this issue by enabling faster gate operations but compromises robustness. In this work, we propose a scheme for fast holonomic quantum gates based on the π -pulse method, which accelerates adiabatic evolution while preserving its robustness. By guiding the system Hamiltonian along geodesic paths in the parameter space and applying phase-modulating π pulses at discrete points, we realize a universal set of holonomic gates beyond the conventional adiabatic limit. Our scheme allows for arbitrary single-qubit and two-qubit controlled gates within a single-loop evolution and provides additional tunable parameters for flexible gate design. These results demonstrate a promising path toward high-fidelity, fast, and robust quantum computation .