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/0004015 · Journal of Modern Optics

Geometric quantum computation

ARTUR K. EKERT, Marie Ericsson, Patrick M. Hayden, Hitoshi Inamori, Jonathan A. Jones, Daniel K. L. Oi, Vlatko Vedral

Published Nov 1, 2000• 274 citations
arXivHTMLPDF

Abstract

We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for quantum computation, in that any unitary transformation can be implemented with arbitrary precision using only single-spin operations and conditional phase shifts. Thus quantum geometrical phases can form the basis of any quantum computation. Moreover, as the induced conditional phase depends only on the geometry of the paths executed by the spins it is resilient to certain types of errors and offers the potential of a naturally fault-tolerant way of performing quantum computation.

DOI
10.1080/09500340008232177

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

State-Independent Nonadiabatic Geometric Quantum Gates

Yan Liang, Pu Shen, Li‐Na Ji +1 more

Quantum computation has demonstrated advantages over classical computation for special hard problems, where a set of universal quantum gates is essential. Geometric phases, which have built-in resilience to local noise, have been used to construct quantum gates with excellent performance. However, this advantage has been smeared in previous schemes. Here, we propose a state-independent nonadiabatic geometric quantum-gate scheme that is able to realize a more fully geometric gate than previous approaches, allowing for the cancelation of dynamical phases accumulated by an arbitrary state. Numerical simulations demonstrate that our scheme has significantly stronger gate robustness than the previous geometric and dynamical ones. Meanwhile, we give a detailed physical implementation of our scheme with the Rydberg atom system based on the Rydberg blockade effect, specifically for multiqubit control-phase gates, which exceeds the fault-tolerance threshold of multiqubit quantum gates within the considered error range. Therefore, our scheme provides a promising way for fault-tolerant quantum computation in atomic systems.

arXiv:2211.09312•Physical Review Applied•Feb 17, 2023•11 citations

Dynamical-corrected nonadiabatic geometric quantum computation

Cheng-Yun Ding, Li Chen, Lihua Zhang +1 more

Recently, nonadiabatic geometric quantum computation has been received great attentions, due to its fast operation and intrinsic error resilience. However, compared with the corresponding dynamical gates, the robustness of implemented nonadiabatic geometric gates based on the conventional single-loop geometric scheme still has the same order of magnitude due to the requirement of strict multi-segment geometric controls, and the inherent geometric fault-tolerance characteristic is not fully explored. Here, we present an effective geometric scheme combined with a general dynamical-corrected technique, with which the super-robust nonadiabatic geometric quantum gates can be constructed over the conventional single-loop geometric and two-loop composite-pulse geometric strategies, in terms of resisting the systematic error, i.e., σx error. In addition, combined with the decoherence-free subspace (DFS) coding, the resulting geometric gates can also effectively suppress the σz error caused by the collective dephasing. Notably, our protocol is a general one with simple experimental setups, which can be potentially implemented in different quantum systems, such as Rydberg atoms, trapped ions and superconducting qubits. These results indicate that our scheme represents a promising way to explore large-scale fault-tolerant quantum computation.

arXiv:2302.04167•Frontiers of Physics•Jul 14, 2023•2 citations

Unconventional Geometric Quantum Computation

Shi-Liang Zhu, Ziang Wang

We propose a new class of unconventional geometric gates involving nonzero dynamic phases, and elucidate that geometric quantum computation can be implemented by using these gates. Comparing with the conventional geometric gate operation, in which the dynamic phase shift must be removed or avoided, the gates proposed here may be operated more simply. We illustrate in detail that unconventional nontrivial two-qubit geometric gates with built-in fault-tolerant geometric features can be implemented in real physical systems.

arXiv:quant-ph/0306166•Physical Review Letters•Oct 30, 2003•269 citations

Recent Advances on Nonadiabatic Geometric Quantum Computation

Zheng-Yuan Xue, Cheng-Yun Ding

The geometric phase stands as a foundational concept in quantum physics, revealing deep connections between geometric structures and quantum dynamical evolution. Unlike dynamical phases, geometric phases exhibit intrinsic resilience to certain types of perturbation, making them particularly valuable for quantum information processing, where maintaining coherent quantum operations is essential. This article provides a review of geometric phases in the context of universal quantum gate construction, i.e., the geometric quantum computation (GQC), with special attention to recent progress in nonadiabatic implementations that enhance gate fidelity and/or operational robustness. We first review a unified theoretical framework that can encompass all existing nonadiabatic GQC approaches, then systematically examine the design principles of nonadiabatic geometric gates with a particular focus on how optimal control techniques can be leveraged to improve the accuracy and noise resistance. In addition, we conducted detailed numerical comparisons of various nonadiabatic GQC protocols, offering a quantitative assessment of their respective performance characteristics and practical limitations. Through this focused investigation, our aim is to provide researchers with both fundamental insights and practical guidance for advancing geometric approaches in quantum computing.

quant-pharXiv:2511.07119•Frontiers of Physics•Nov 11, 2025•3 citations

Nonadiabatic Conditional Geometric Phase Shift with NMR

Xiang‐Bin Wang, Matsumoto Keiji

A conditional geometric phase shift gate, which is fault tolerant to certain types of errors due to its geometric nature, was realized recently via nuclear magnetic resonance (NMR) under adiabatic conditions. However, in quantum computation, everything must be completed within the decoherence time. The adiabatic condition makes any fast conditional Berry phase (cyclic adiabatic geometric phase) shift gate impossible. Here we show that by using a newly designed sequence of simple operations with an additional vertical magnetic field, the conditional geometric phase shift gate can be run nonadiabatically. Therefore geometric quantum computation can be done at the same rate as usual quantum computation.

arXiv:quant-ph/0101038•Physical Review Letters•Aug 8, 2001•312 citations
We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for quantum computation, in that any unitary transformation can be implemented with arbitrary precision using only single-spin operations and conditional phase shifts. Thus quantum geometrical phases can form the basis of any quantum computation. Moreover, as the induced conditional phase depends only on the geometry of the paths executed by the spins it is resilient to certain types of errors and offers the potential of a naturally fault-tolerant way of performing quantum computation.
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.
Quantum computation has demonstrated advantages over classical computation for special hard problems, where a set of universal quantum gates is essential. Geometric phases, which have built-in resilience to local noise, have been used to construct quantum gates with excellent performance. However, this advantage has been smeared in previous schemes. Here, we propose a state-independent nonadiabatic geometric quantum-gate scheme that is able to realize a more fully geometric gate than previous approaches, allowing for the cancelation of dynamical phases accumulated by an arbitrary state. Numerical simulations demonstrate that our scheme has significantly stronger gate robustness than the previous geometric and dynamical ones. Meanwhile, we give a detailed physical implementation of our scheme with the Rydberg atom system based on the Rydberg blockade effect, specifically for multiqubit control-phase gates, which exceeds the fault-tolerance threshold of multiqubit quantum gates within the considered error range. Therefore, our scheme provides a promising way for fault-tolerant quantum computation in atomic systems.
Recently, nonadiabatic geometric quantum computation has been received great attentions, due to its fast operation and intrinsic error resilience. However, compared with the corresponding dynamical gates, the robustness of implemented nonadiabatic geometric gates based on the conventional single-loop geometric scheme still has the same order of magnitude due to the requirement of strict multi-segment geometric controls, and the inherent geometric fault-tolerance characteristic is not fully explored. Here, we present an effective geometric scheme combined with a general dynamical-corrected technique, with which the super-robust nonadiabatic geometric quantum gates can be constructed over the conventional single-loop geometric and two-loop composite-pulse geometric strategies, in terms of resisting the systematic error, i.e., σx error. In addition, combined with the decoherence-free subspace (DFS) coding, the resulting geometric gates can also effectively suppress the σz error caused by the collective dephasing. Notably, our protocol is a general one with simple experimental setups, which can be potentially implemented in different quantum systems, such as Rydberg atoms, trapped ions and superconducting qubits. These results indicate that our scheme represents a promising way to explore large-scale fault-tolerant quantum computation.
We propose a new class of unconventional geometric gates involving nonzero dynamic phases, and elucidate that geometric quantum computation can be implemented by using these gates. Comparing with the conventional geometric gate operation, in which the dynamic phase shift must be removed or avoided, the gates proposed here may be operated more simply. We illustrate in detail that unconventional nontrivial two-qubit geometric gates with built-in fault-tolerant geometric features can be implemented in real physical systems.
The geometric phase stands as a foundational concept in quantum physics, revealing deep connections between geometric structures and quantum dynamical evolution. Unlike dynamical phases, geometric phases exhibit intrinsic resilience to certain types of perturbation, making them particularly valuable for quantum information processing, where maintaining coherent quantum operations is essential. This article provides a review of geometric phases in the context of universal quantum gate construction, i.e., the geometric quantum computation (GQC), with special attention to recent progress in nonadiabatic implementations that enhance gate fidelity and/or operational robustness. We first review a unified theoretical framework that can encompass all existing nonadiabatic GQC approaches, then systematically examine the design principles of nonadiabatic geometric gates with a particular focus on how optimal control techniques can be leveraged to improve the accuracy and noise resistance. In addition, we conducted detailed numerical comparisons of various nonadiabatic GQC protocols, offering a quantitative assessment of their respective performance characteristics and practical limitations. Through this focused investigation, our aim is to provide researchers with both fundamental insights and practical guidance for advancing geometric approaches in quantum computing.
A conditional geometric phase shift gate, which is fault tolerant to certain types of errors due to its geometric nature, was realized recently via nuclear magnetic resonance (NMR) under adiabatic conditions. However, in quantum computation, everything must be completed within the decoherence time. The adiabatic condition makes any fast conditional Berry phase (cyclic adiabatic geometric phase) shift gate impossible. Here we show that by using a newly designed sequence of simple operations with an additional vertical magnetic field, the conditional geometric phase shift gate can be run nonadiabatically. Therefore geometric quantum computation can be done at the same rate as usual quantum computation.