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:1412.2848 · Scientific Reports

Fast non-Abelian geometric gates via transitionless quantum driving

Jiang Zhang, Thi Ha Kyaw, D. M. Tong, Erik Sjöqvist, L. C. Kwek

Published Dec 21, 2015• 102 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/srep18414

Related papers

Universal, high-fidelity quantum gates based on superadiabatic, geometric phases on a solid-state spin-qubit at room temperature

Felix Kleißler, Andrii Lazariev, Silvia Arroyo-Camejo

Abstract Geometric phases and holonomies are a promising resource for the realization of high-fidelity quantum operations in noisy devices, due to their intrinsic fault-tolerance against parametric noise. However, for a long time their practical use in quantum computing was limited to proof of principle demonstrations. This was partly due to the need for adiabatic time evolution or the requirement of complex, high-dimensional state spaces and a large number of driving field parameters to achieve universal quantum gates employing holonomies. In 2016 Liang et al. proposed universal, superadiabatic, geometric quantum gates exploiting transitionless quantum driving, thereby offering fast and universal quantum gate performance on a simple two-level system. Here, we report on the experimental implementation of a set of non-commuting single-qubit superadiabatic, geometric quantum gates on the electron spin of the nitrogen-vacancy center in diamond under ambient conditions. This provides a promising and powerful tool for large-scale quantum computing under realistic, noisy experimental conditions.

arXiv:1804.10983•npj Quantum Information•Sep 25, 2018•56 citations

Non-adiabatic holonomic quantum computation

Erik Sjöqvist, D. M. Tong, L. Mauritz Andersson +3 more

We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be realized using non-Abelian geometric phases. We show how a set of non-adiabatic holonomic one- and two-qubit gates can be implemented by utilizing optical transitions in a generic three-level Λ configuration. Our scheme opens up the possibility of realizing universal holonomic quantum computation on qubits characterized by short coherence time.

arXiv:1107.5127•New Journal of Physics•Oct 23, 2012•397 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

Noncyclic nonadiabatic holonomic quantum gates via shortcuts to adiabaticity

Sai Li, Pu Shen, Tao Chen +1 more

High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.

arXiv:2105.13912•Frontiers of Physics•Jun 5, 2021•11 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•9 citations

Demonstration of a non-Abelian geometric controlled-NOT gate in a superconducting circuit

Kai Xu, Wen Ning, Xin-Jie Huang +6 more

Holonomies, arising from non-Abelian geometric transformations of quantum states in Hilbert space, offer a promising way for quantum computation. These holonomies are not commutable and thus can be used for the realization of a universal set of quantum logic gates, where the global geometric feature may result in some noise-resilient advantages. Here we report, to our knowledge, the first on-chip realization of a non-Abelian geometric controlled-NOT gate in a superconducting circuit, which is a building block for constructing a holonomic quantum computer. The conditional dynamics is achieved in an all-to-all connected architecture involving multiple frequency-tunable superconducting qubits controllably coupled to a resonator; a holonomic gate between any two qubits can be implemented by tuning their frequencies on-resonance with the resonator and applying a two-tone drive to one of them. This gate represents an important step towards the all-geometric realization of scalable quantum computation on a superconducting platform.

arXiv:2009.03610•Optica•Jun 4, 2021•32 citations
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.
Abstract Geometric phases and holonomies are a promising resource for the realization of high-fidelity quantum operations in noisy devices, due to their intrinsic fault-tolerance against parametric noise. However, for a long time their practical use in quantum computing was limited to proof of principle demonstrations. This was partly due to the need for adiabatic time evolution or the requirement of complex, high-dimensional state spaces and a large number of driving field parameters to achieve universal quantum gates employing holonomies. In 2016 Liang et al. proposed universal, superadiabatic, geometric quantum gates exploiting transitionless quantum driving, thereby offering fast and universal quantum gate performance on a simple two-level system. Here, we report on the experimental implementation of a set of non-commuting single-qubit superadiabatic, geometric quantum gates on the electron spin of the nitrogen-vacancy center in diamond under ambient conditions. This provides a promising and powerful tool for large-scale quantum computing under realistic, noisy experimental conditions.
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.
High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.
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.
Holonomies, arising from non-Abelian geometric transformations of quantum states in Hilbert space, offer a promising way for quantum computation. These holonomies are not commutable and thus can be used for the realization of a universal set of quantum logic gates, where the global geometric feature may result in some noise-resilient advantages. Here we report, to our knowledge, the first on-chip realization of a non-Abelian geometric controlled-NOT gate in a superconducting circuit, which is a building block for constructing a holonomic quantum computer. The conditional dynamics is achieved in an all-to-all connected architecture involving multiple frequency-tunable superconducting qubits controllably coupled to a resonator; a holonomic gate between any two qubits can be implemented by tuning their frequencies on-resonance with the resonator and applying a two-tone drive to one of them. This gate represents an important step towards the all-geometric realization of scalable quantum computation on a superconducting platform.