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

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)

Non-Adiabatic Holonomic Quantum Gates

Vera Neef, Julien Pinske, Matthias Heinrich, Stefan Scheel, Alexander Szameit

Published Jun 26, 2023• 0 citations
Publisher

Abstract

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].

DOI
10.1109/cleo/europe-eqec57999.2023.10231394

Related papers

Fast non-Abelian geometric gates via transitionless quantum driving

Jiang Zhang, Thi Ha Kyaw, D. M. Tong +2 more

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.

arXiv:1412.2848•Scientific Reports•Dec 21, 2015•103 citations

Nonadiabatic holonomic quantum computation with atom-cavity system

Tonghao Xing, D. M. Tong

Quantum computation is much more effective than classical computation in solving many problems such as factoring large integers and searching unsorted databases. However, such effectiveness relies on the ability to perform universal high-fidelity quantum gates. One main challenge in achieving such high-fidelity gates is to reduce control errors of a quantum system. To overcome this problem, various proposals of fault-tolerant quantum computation are proposed. A promising one of such proposals is nonadiabatic holonomic quantum computation. Nonadiabatic holonomic quantum computation is realized by using a quantum system with a subspace satisfying both the cyclic evolution and parallel transport conditions. For an N dimensional quantum system with Hamiltonian H(t) and evolution operator U(t)=Texp[−i∫0tH(t')dt'] , if there exists a time-dependent L dimensional subspace S(t) spanned by the orthonormal vectors {|ϕk(t)〉=U(t)|ϕk(0)〉}k=1L that satisfy the two conditions: (1) ∑k=1L|ϕk(τ)〉〈ϕk(τ)|= ∑k=1L|ϕk(0)〉〈ϕk(0)| , with τ being the evolution period, and (2) 〈ϕk(t)|H(t)|ϕl(t)〉=0, k,l=1,2,⋯,L, then the unitary transformation U(τ) is a holonomic gate on the L dimensional subspace S(0) spanned by {|ϕk(0)〉}k=1L . The work of realizing nonadiabatic holonomic gate is to build a physical system with a Hamiltonian satisfying both the cyclic evolution condition and the parallel transport condition. Nonadiabatic holonomic quantum computation is based on nonadiabatic non-Abelian geometric phases. Since nonadiabatic non-Abelian geometric phases are only dependent on evolution paths but independent of evolution details, nonadiabatic holonomic gates are robust against control errors. Besides, nonadiabatic holonomic gates do not require the long run-time evolution that is necessary for adiabatic holonomic gates. Due to the merits of both robustness against control errors and high-speed realization, nonadiabatic holonomic quantum computation has received increasing attention in theory and experiment. Various schemes of nonadiabatic holonomic quantum computation have been proposed based on different physical systems, and a number of these schemes have been experimentally demonstrated with nuclear magnetic resonance systems, nitrogen-vacancy center systems, and superconducting systems. The progress of nonadiabatic holonomic quantum computation is also reflected in the improvement of the methods of designing quantum gates. The single-shot scheme, single-loop multiple-pulse scheme and composite gate scheme of nonadiabatic quantum gate are based on the improved methods. In particular, the single-shot scheme simplifies the operation of the one-qubit gate, so that the operation of any one-qubit gate, which needs to be realized by combining two non-commuting π-rotation gate in the original scheme, can be simply realized by a single-shot operation. In this paper, we propose a scheme of nonadiabatic holonomic quantum computation with atom-cavity system. The universal set of quantum gates in our scheme consists of an arbitrary one-qubit nonadiabatic holonomic gate and a two-qubit nonadiabatic holonomic controlled-PHASE gate. To realize the arbitrary one-qubit gate, we use two resonant laser pulses and an off-resonant laser pulse to drive a single four-level atom. With the aid of Stark shifts, the one-qubit gate can be performed in one-step only by changing the Rabi frequencies and the phases of the laser pulses. To realize the two-qubit controlled-PHASE gate, we use two off-resonant laser pulses to drive the two four-level atoms in the cavity. The transitions between the two-atom ground state and the two-atom auxiliary state is facilitated by exchanging virtual photons through a common cavity mode. In this process, the effective two-atom transition is disentangled from the cavity mode and therefore the two-qubit gate is insensitive to the cavity decay.

Chinese Science Bulletin (Chinese Version)•Apr 10, 2020•3 citations

Non-adiabatic holonomies as photonic quantum gates

Vera Neef, Julien Pinske, Tom A. W. Wolterink +4 more

One of the most promising nascent technologies, quantum computation faces a major challenge: The need for stable computational building blocks. We present the quantum-optical realization of non-adiabatic holonomies that can be used as single-qubit quantum gates. The hallmark topological protection of non-Abelian geometric phases reduces the need for quantum error correction on a fundamental physical level, while the inherent non-adiabaticity of the structures paves the way for unprecedented miniaturization. To demonstrate their versatility, we realize the Hadamard and Pauli-X gates, experimentally show their non-Abelian nature, and combine them into a single-qubit quantum algorithm, the PQ penny flipover. The planar geometry of such designs enables them to be substituted for the conventional directional coupler meshes currently in wide-spread use in photonic quantum architectures across all platforms.

arXiv:2401.04014•Jan 8, 2024•0 citations

Advances in nonadiabatic holonomic quantum computation

Peizi Zhao, Guofu Xu, D. M. Tong

Quantum computation has been shown to be superior to classical computation in solving some problems, and therefore can substantially change our life. However, the realization of quantum computation is still challenging, even if quantum technologies have been improved significantly. Two main obstacles to the realization of practical quantum computation are control errors and decoherence. Control errors are caused by inaccurate manipulations of quantum systems and decoherence is caused by the inevitable interaction between the system and its environment. Geometric phases are only dependent on evolution paths of quantum systems but independent of the evolution details and therefore quantum computation based on geometric phases, i.e., geometric quantum computation, is robust against control errors, benefiting the realization of practical quantum computation. The early proposals of geometric quantum computation are based on adiabatic geometric phases. These proposals require quantum systems to undergo adiabatic evolution, which makes quantum systems evolve for a long time. To circumvent this, nonadiabatic geometric quantum computation based on nonadiabatic Abelian geometric phases was proposed soon after. In 2012, nonadiabatic holonomic quantum computation based on nonadiabatic non-Abelian geometric phases was proposed, which also circumvents long-time evolutions. Moreover, compared with nonadiabatic geometric quantum computation that uses the geometric phase as one parameter of a quantum gate, nonadiabatic holonomic quantum computation uses the holonomic matrix itself as a quantum gate. This makes nonadiabatic holonomic quantum computation possess whole-geometric property. Due to the merits of both geometric robustness and high-speed implementation without the limit of adiabatic evolution, nonadiabatic holonomic quantum computation has been attracting much attention. Until now, much progress has been achieved in the field of nonadiabatic holonomic quantum computation. On one hand, various methods have been proposed to design more efficient nonadiabatic holonomic gates. Nonadiabatic holonomic gates were first realized by using resonant laser fields to drive a three-level system. After this, the single-shot proposal and the single-loop proposal were proposed, allowing us to realize one-qubit gates by a shorter path and thereby reducing the exposure time of nonadiabatic holonomic gates to the environment. To further shorten the exposure time, the path-shortening protocol was put forward, where nonadiabatic holonomic gates can be realized based on a class of extended evolution paths that are shorter than the former ones. Recently, a general approach of constructing Hamiltonians for nonadiabatic holonomic quantum computation was put forward, by using which one can easily find a Hamiltonian making the quantum system evolve along a desired path so that nonadiabatic holonomic gates can be realized with an economical evolution time. On the other hand, various methods have been proposed to combine nonadiabatic holonomic gates and various decoherence-resilient methods, making the resulting schemes robust against both control errors and decoherence. The first proposal in this aspect is combining nonadiabatic holonomic gates and decoherence-free subspaces. Gradually, proposals combining nonadiabatic holonomic gates with noiseless subsystems, dynamical decoupling and surface codes were put forward. Last but not least, various proposals suitable for specific physical systems have been proposed and particularly various experimental platforms have been used to demonstrate nonadiabatic holonomic gates. This also significantly improves the development of nonadiabatic holonomic quantum computation. In this paper, we review the above research advances on nonadiabatic holonomic quantum computation, aiming to help readers understand the main developments of nonadiabatic holonomic quantum computation.

Chinese Science Bulletin (Chinese Version)•Mar 2, 2021•10 citations

Geometry of Grover Search : A Comparison between Geometric and Holonomic Quantum Computation

Rasmus Wallentin

Geometric quantum phases enable the construction geometric quantum gates, whose action only depend on the evolution path in state space. Geometric gates may offer increased robustness to control parameter noise. In this report, the conditions under which non-adiabatic geometric and holonomic quantum gates preserve their geometric character under sequential composition are analysed. Grover’s search algorithm requiring non-commuting operations is used as a representative example. The basic concepts of qubits, quantum gates and quantum circuits are explained. The concept of geometric phases is introduced and derivations of Abelian and non-Abelian non-adiabatic geometric phases are provided (Aharonov-Anandan and Anandan phase respectively). Construction of geometric and holonomic universal quantum gate sets with the aforementioned geometric phases are briefly described.Explicit calculation of two non-commuting Abelian and non-adiabatic geometric time evolutions show that the successively combined operation is not geometric. A proof of successive combinations of non-Abelian and non-adiabatic geometric time evolutions preserving their non-adiabatic Abelian and geometric properties is given. The report concludes that it is in general not possible to perform quantum circuits completely geometrically with a geometric universal quantum gate set. However, performing quantum computations with gates from a holonomic universal gate set is geometric and holonomic throughout the computation.

•Jan 1, 2026•0 citations

Experimental Realization of Non-Adiabatic Holonomic Quantum Gates

Vera Neef, Julien Pinske, Matthias Heinrich +2 more

We present the experimental realization of non-adiabatic holonomic quantum gates, paving the way towards noise-resilient quantum computing in integrated quantum optics. Their topologically protected functionalities are realized solely by means of non-Abelian geometric phases.

Conference on Lasers and Electro-Optics•Jan 1, 2022•0 citations
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].
A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.
Quantum computation is much more effective than classical computation in solving many problems such as factoring large integers and searching unsorted databases. However, such effectiveness relies on the ability to perform universal high-fidelity quantum gates. One main challenge in achieving such high-fidelity gates is to reduce control errors of a quantum system. To overcome this problem, various proposals of fault-tolerant quantum computation are proposed. A promising one of such proposals is nonadiabatic holonomic quantum computation. Nonadiabatic holonomic quantum computation is realized by using a quantum system with a subspace satisfying both the cyclic evolution and parallel transport conditions. For an N dimensional quantum system with Hamiltonian H(t) and evolution operator U(t)=Texp[−i∫0tH(t')dt'] , if there exists a time-dependent L dimensional subspace S(t) spanned by the orthonormal vectors {|ϕk(t)〉=U(t)|ϕk(0)〉}k=1L that satisfy the two conditions: (1) ∑k=1L|ϕk(τ)〉〈ϕk(τ)|= ∑k=1L|ϕk(0)〉〈ϕk(0)| , with τ being the evolution period, and (2) 〈ϕk(t)|H(t)|ϕl(t)〉=0, k,l=1,2,⋯,L, then the unitary transformation U(τ) is a holonomic gate on the L dimensional subspace S(0) spanned by {|ϕk(0)〉}k=1L . The work of realizing nonadiabatic holonomic gate is to build a physical system with a Hamiltonian satisfying both the cyclic evolution condition and the parallel transport condition. Nonadiabatic holonomic quantum computation is based on nonadiabatic non-Abelian geometric phases. Since nonadiabatic non-Abelian geometric phases are only dependent on evolution paths but independent of evolution details, nonadiabatic holonomic gates are robust against control errors. Besides, nonadiabatic holonomic gates do not require the long run-time evolution that is necessary for adiabatic holonomic gates. Due to the merits of both robustness against control errors and high-speed realization, nonadiabatic holonomic quantum computation has received increasing attention in theory and experiment. Various schemes of nonadiabatic holonomic quantum computation have been proposed based on different physical systems, and a number of these schemes have been experimentally demonstrated with nuclear magnetic resonance systems, nitrogen-vacancy center systems, and superconducting systems. The progress of nonadiabatic holonomic quantum computation is also reflected in the improvement of the methods of designing quantum gates. The single-shot scheme, single-loop multiple-pulse scheme and composite gate scheme of nonadiabatic quantum gate are based on the improved methods. In particular, the single-shot scheme simplifies the operation of the one-qubit gate, so that the operation of any one-qubit gate, which needs to be realized by combining two non-commuting π-rotation gate in the original scheme, can be simply realized by a single-shot operation. In this paper, we propose a scheme of nonadiabatic holonomic quantum computation with atom-cavity system. The universal set of quantum gates in our scheme consists of an arbitrary one-qubit nonadiabatic holonomic gate and a two-qubit nonadiabatic holonomic controlled-PHASE gate. To realize the arbitrary one-qubit gate, we use two resonant laser pulses and an off-resonant laser pulse to drive a single four-level atom. With the aid of Stark shifts, the one-qubit gate can be performed in one-step only by changing the Rabi frequencies and the phases of the laser pulses. To realize the two-qubit controlled-PHASE gate, we use two off-resonant laser pulses to drive the two four-level atoms in the cavity. The transitions between the two-atom ground state and the two-atom auxiliary state is facilitated by exchanging virtual photons through a common cavity mode. In this process, the effective two-atom transition is disentangled from the cavity mode and therefore the two-qubit gate is insensitive to the cavity decay.
One of the most promising nascent technologies, quantum computation faces a major challenge: The need for stable computational building blocks. We present the quantum-optical realization of non-adiabatic holonomies that can be used as single-qubit quantum gates. The hallmark topological protection of non-Abelian geometric phases reduces the need for quantum error correction on a fundamental physical level, while the inherent non-adiabaticity of the structures paves the way for unprecedented miniaturization. To demonstrate their versatility, we realize the Hadamard and Pauli-X gates, experimentally show their non-Abelian nature, and combine them into a single-qubit quantum algorithm, the PQ penny flipover. The planar geometry of such designs enables them to be substituted for the conventional directional coupler meshes currently in wide-spread use in photonic quantum architectures across all platforms.
Quantum computation has been shown to be superior to classical computation in solving some problems, and therefore can substantially change our life. However, the realization of quantum computation is still challenging, even if quantum technologies have been improved significantly. Two main obstacles to the realization of practical quantum computation are control errors and decoherence. Control errors are caused by inaccurate manipulations of quantum systems and decoherence is caused by the inevitable interaction between the system and its environment. Geometric phases are only dependent on evolution paths of quantum systems but independent of the evolution details and therefore quantum computation based on geometric phases, i.e., geometric quantum computation, is robust against control errors, benefiting the realization of practical quantum computation. The early proposals of geometric quantum computation are based on adiabatic geometric phases. These proposals require quantum systems to undergo adiabatic evolution, which makes quantum systems evolve for a long time. To circumvent this, nonadiabatic geometric quantum computation based on nonadiabatic Abelian geometric phases was proposed soon after. In 2012, nonadiabatic holonomic quantum computation based on nonadiabatic non-Abelian geometric phases was proposed, which also circumvents long-time evolutions. Moreover, compared with nonadiabatic geometric quantum computation that uses the geometric phase as one parameter of a quantum gate, nonadiabatic holonomic quantum computation uses the holonomic matrix itself as a quantum gate. This makes nonadiabatic holonomic quantum computation possess whole-geometric property. Due to the merits of both geometric robustness and high-speed implementation without the limit of adiabatic evolution, nonadiabatic holonomic quantum computation has been attracting much attention. Until now, much progress has been achieved in the field of nonadiabatic holonomic quantum computation. On one hand, various methods have been proposed to design more efficient nonadiabatic holonomic gates. Nonadiabatic holonomic gates were first realized by using resonant laser fields to drive a three-level system. After this, the single-shot proposal and the single-loop proposal were proposed, allowing us to realize one-qubit gates by a shorter path and thereby reducing the exposure time of nonadiabatic holonomic gates to the environment. To further shorten the exposure time, the path-shortening protocol was put forward, where nonadiabatic holonomic gates can be realized based on a class of extended evolution paths that are shorter than the former ones. Recently, a general approach of constructing Hamiltonians for nonadiabatic holonomic quantum computation was put forward, by using which one can easily find a Hamiltonian making the quantum system evolve along a desired path so that nonadiabatic holonomic gates can be realized with an economical evolution time. On the other hand, various methods have been proposed to combine nonadiabatic holonomic gates and various decoherence-resilient methods, making the resulting schemes robust against both control errors and decoherence. The first proposal in this aspect is combining nonadiabatic holonomic gates and decoherence-free subspaces. Gradually, proposals combining nonadiabatic holonomic gates with noiseless subsystems, dynamical decoupling and surface codes were put forward. Last but not least, various proposals suitable for specific physical systems have been proposed and particularly various experimental platforms have been used to demonstrate nonadiabatic holonomic gates. This also significantly improves the development of nonadiabatic holonomic quantum computation. In this paper, we review the above research advances on nonadiabatic holonomic quantum computation, aiming to help readers understand the main developments of nonadiabatic holonomic quantum computation.
Geometric quantum phases enable the construction geometric quantum gates, whose action only depend on the evolution path in state space. Geometric gates may offer increased robustness to control parameter noise. In this report, the conditions under which non-adiabatic geometric and holonomic quantum gates preserve their geometric character under sequential composition are analysed. Grover’s search algorithm requiring non-commuting operations is used as a representative example. The basic concepts of qubits, quantum gates and quantum circuits are explained. The concept of geometric phases is introduced and derivations of Abelian and non-Abelian non-adiabatic geometric phases are provided (Aharonov-Anandan and Anandan phase respectively). Construction of geometric and holonomic universal quantum gate sets with the aforementioned geometric phases are briefly described.Explicit calculation of two non-commuting Abelian and non-adiabatic geometric time evolutions show that the successively combined operation is not geometric. A proof of successive combinations of non-Abelian and non-adiabatic geometric time evolutions preserving their non-adiabatic Abelian and geometric properties is given. The report concludes that it is in general not possible to perform quantum circuits completely geometrically with a geometric universal quantum gate set. However, performing quantum computations with gates from a holonomic universal gate set is geometric and holonomic throughout the computation.