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/0111075 · Optical Fiber Communication Conference

Optical Holonomic Quantum Computation

Demosthenes Ellinas, Jiannis K. Pachos

Published Jan 1, 2001• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1364/icqi.2001.pb15

Related papers

Optical holonomic quantum computer

Jiannis K. Pachos, Spiros Chountasis

In this paper the idea of holonomic quantum computation is realized within quantum optics. In a nonlinear Kerr medium the degenerate states of laser beams are interpreted as qubits. Displacing devices, squeezing devices, and interferometers provide the classical control parameter space where the adiabatic loops are performed. This results in logical gates acting on the states of the combined degenerate subspaces of the lasers, producing any one qubit rotations and interactions between any two qubits. Issues such as universality, complexity, scalability, and reversibility are addressed and several steps are taken towards the physical implementation of this model.

arXiv:quant-ph/9912093•Physical Review A•Oct 19, 2000•100 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

Holonomic quantum computation

Paolo Zanardi

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, 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•317 citations

Universal quantum computation by holonomic and nonlocal gates with imperfections

Demosthenes Ellinas, Jiannis K. Pachos

We present a nonlocal construction of universal gates by means of holonomic (geometric) quantum teleportation. The effect of the errors from imperfect control of the classical parameters, the looping variation of which builds up holonomic gates, is investigated. Additionally, the influence of quantum decoherence on holonomic teleportation used as a computational primitive is studied. Advantages of the holonomic implementation with respect to control errors and dissipation are presented.

arXiv:quant-ph/0009043•Physical Review A•Jul 12, 2001•30 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
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.
In this paper the idea of holonomic quantum computation is realized within quantum optics. In a nonlinear Kerr medium the degenerate states of laser beams are interpreted as qubits. Displacing devices, squeezing devices, and interferometers provide the classical control parameter space where the adiabatic loops are performed. This results in logical gates acting on the states of the combined degenerate subspaces of the lasers, producing any one qubit rotations and interactions between any two qubits. Issues such as universality, complexity, scalability, and reversibility are addressed and several steps are taken towards the physical implementation of this model.
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 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.
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.