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/0504205

Holonomic Quantum Computation

Angelo C. M. Carollo, Vlatko Vedral

Published Apr 27, 2005• 7 citations
arXivHTMLPDF

Abstract

In this brief review we describe the idea of holonomic quantum computation. The idea of geometric phase and holonomy is introduced in a general way and we provide few examples that should help the reader understand the issues involved.
DOI
10.48550/arxiv.quant-ph/0504205

Related papers

Holonomic Quantum Computation

Angelo C. M. Carollo, Vlatko Vedral

The contribution of a geometric phase factor originates from the very heart of the structure of quantum mechanics. An interest in geometric phenomena in quantum physics has been recently motivated by the proposal of using geometric phases for quantum computation. Geometric (or “Berry") phases depend only on the geometry of the path executed, and are therefore resilient to certain types of errors. The idea is to exploit this inherent robustness provided by the topological properties of some quantum systems as a means of constructing built-in fault tolerant quantum logic gates. Various strategies have been proposed to reach this goal, some of them making use of purely geometric evolutions, that is, non-Abelian holonomies. This chapter discusses the non-Abelian generalization of the geometric phase, or holonomy. It then discusses the implementation of holonomic quantum computation, and summarizes the potential advantages of using geometrical evolution to implement quantum gates.

Wiley eBooks•Apr 18, 2016•6 citations

GEOMETRIC PHASES AND TOPOLOGICAL QUANTUM COMPUTATION

Vlatko Vedral

In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also introduce a number of examples that will help the reader understand the basic issues involved. In the second part we show how to perform a universal quantum computation using only geometric effects appearing in quantum phases. It is then finally discussed how this geometric way of performing quantum gates can lead to a stable, large scale, intrinsically fault-tolerant quantum computer.

arXiv:quant-ph/0212133•International Journal of Quantum Information•Mar 1, 2003•64 citations

Holonomic Quantum Computation

Angelo C. M. Carollo, Vlatko Vedral

This chapter contains sections titled: Geometric Phase and Holonomy Application to Quantum Computation

Wiley eBooks•Nov 6, 2006•6 citations

Non-Adiabatic Holonomic Quantum Gates

Vera Neef, Julien Pinske, Matthias Heinrich +2 more

Implementing quantum gates as non-Abelian holonomies, a class of topologically protected unitary operators, is a particularly promising paradigm for the design of intrinsically stable quantum computers [1]. In contrast to dynamic phases, the geometric phase accumulated by a quantum system propagating through a Hilbert space$\mathcal{H}$depends exclusively on its path. In general, geometric phases can exhibit arbitrary dimensionality. Wilczek and Zee introduced the idea of multi-dimensional, non-Abelian geometric phases - so called holonomies [2]. Anandan later dropped the requirement of adiabaticity to create holonomies, that are truly time-independent [3]. Non-adiabatic holonomies rely on a subspace$\mathcal{H}_{\text{geo}}$of the Hilbert-space that is spanned by states$\{\vert \Phi_{k}\rangle\}_{k}$that fulfill$(\Phi_{k}\vert \hat{H}\vert \Phi_{j}\rangle=0$, where$\hat{H}$is the system's Hamiltonian. Restricting the propagation to$\mathcal{H}_{\text{geo}}$ensures parallel transport and, thus, a purely geometric phase (see Fig. 1a) [4], [5]. Quantum optics constitutes a particularly versatile platform for quantum information processing, and in particular for the construction of non-adiabatic holonomic quantum computers: In addition to integration and miniaturization provided by the platform, the bosonic nature of photons also conveniently allows for multiple excitations of the same mode, readily expanding$\mathcal{H}_{\text{geo}}$and enabling the synthesis of holonomies from higher symmetry groups$\mathrm{U}(N)$as larger and more capable computational units [6], [7].

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 26, 2023•0 citations

Holonomic quantum logic gates

Marie Ericsson

This is a brief overview of quantum holonomies in the context of quantum computation. We choose an adequate set of quantum logic gates, namely, a phase gate, the Hadamard gate, and a conditional-phase gate and show how they can be implemented by purely geometric means. Such gates may be more resilient to certain types of errors.

arXiv:quant-ph/0202106•Feb 19, 2002•1 citation

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
The contribution of a geometric phase factor originates from the very heart of the structure of quantum mechanics. An interest in geometric phenomena in quantum physics has been recently motivated by the proposal of using geometric phases for quantum computation. Geometric (or “Berry") phases depend only on the geometry of the path executed, and are therefore resilient to certain types of errors. The idea is to exploit this inherent robustness provided by the topological properties of some quantum systems as a means of constructing built-in fault tolerant quantum logic gates. Various strategies have been proposed to reach this goal, some of them making use of purely geometric evolutions, that is, non-Abelian holonomies. This chapter discusses the non-Abelian generalization of the geometric phase, or holonomy. It then discusses the implementation of holonomic quantum computation, and summarizes the potential advantages of using geometrical evolution to implement quantum gates.
In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also introduce a number of examples that will help the reader understand the basic issues involved. In the second part we show how to perform a universal quantum computation using only geometric effects appearing in quantum phases. It is then finally discussed how this geometric way of performing quantum gates can lead to a stable, large scale, intrinsically fault-tolerant quantum computer.
Implementing quantum gates as non-Abelian holonomies, a class of topologically protected unitary operators, is a particularly promising paradigm for the design of intrinsically stable quantum computers [1]. In contrast to dynamic phases, the geometric phase accumulated by a quantum system propagating through a Hilbert spaceH\mathcal{H}Hdepends exclusively on its path. In general, geometric phases can exhibit arbitrary dimensionality. Wilczek and Zee introduced the idea of multi-dimensional, non-Abelian geometric phases - so called holonomies [2]. Anandan later dropped the requirement of adiabaticity to create holonomies, that are truly time-independent [3]. Non-adiabatic holonomies rely on a subspaceHgeo\mathcal{H}_{\text{geo}}Hgeo​of the Hilbert-space that is spanned by states{∣Φk⟩}k\{\vert \Phi_{k}\rangle\}_{k}{∣Φk​⟩}k​that fulfill(Φk∣H^∣Φj⟩=0(\Phi_{k}\vert \hat{H}\vert \Phi_{j}\rangle=0(Φk​∣H^∣Φj​⟩=0, whereH^\hat{H}H^is the system's Hamiltonian. Restricting the propagation toHgeo\mathcal{H}_{\text{geo}}Hgeo​ensures parallel transport and, thus, a purely geometric phase (see Fig. 1a) [4], [5]. Quantum optics constitutes a particularly versatile platform for quantum information processing, and in particular for the construction of non-adiabatic holonomic quantum computers: In addition to integration and miniaturization provided by the platform, the bosonic nature of photons also conveniently allows for multiple excitations of the same mode, readily expandingHgeo\mathcal{H}_{\text{geo}}Hgeo​and enabling the synthesis of holonomies from higher symmetry groupsU(N)\mathrm{U}(N)U(N)as larger and more capable computational units [6], [7].
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.