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:2511.07119 · Frontiers of Physics

Recent Advances on Nonadiabatic Geometric Quantum Computation

Zheng-Yuan Xue, Cheng-Yun Ding

quant-phSubmitted Nov 10, 2025• Announced Nov 11, 2025• 3 citations
arXivHTMLPDF

Abstract

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.

Journal reference
Frontiers of physics, 21(3), 033202 (2026)
DOI
10.15302/frontphys.2026.033202
Comments
16 pages, 10 figures

Related papers

Path-optimized nonadiabatic geometric quantum computation on superconducting qubits

Cheng-Yun Ding, Li‐Na Ji, Tao Chen +1 more

Abstract Quantum computation based on nonadiabatic geometric phases has attracted a broad range of interests, due to its fast manipulation and inherent noise resistance. However, it is limited to some special evolution paths, and the gate-times are typically longer than conventional dynamical gates, resulting in weakening of robustness and more infidelities of the implemented geometric gates. Here, we propose a path-optimized scheme for geometric quantum computation (GQC) on superconducting transmon qubits, where high-fidelity and robust universal nonadiabatic geometric gates can be implemented, based on conventional experimental setups. Specifically, we find that, by selecting appropriate evolution paths, the constructed geometric gates can be superior to their corresponding dynamical ones under different local errors. Numerical simulations show that the fidelities for single-qubit geometric phase, π /8 and Hadamard gates can be obtained as 99.93%, 99.95% and 99.95%, respectively. Remarkably, the fidelity for two-qubit control-phase gate can be as high as 99.87%. Therefore, our scheme provides a new perspective for GQC, making it more promising in the application of large-scale fault-tolerant quantum computation.

arXiv:2110.06074•Quantum Science and Technology•Nov 3, 2021•26 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

Nonadiabatic geometric quantum gates that are robust against systematic errors

Yan Liang, Yi-Xuan Wu, Zheng‐Yuan Xue

A nonadiabatic geometric quantum gate is realized by integrating nonadiabatic geometric phases with global geometric features into the unitary quantum control, thereby removing the limitation of a long evolution time in the adiabatic case. However, systematic errors are inevitable in practical quantum control; these lead to the deviation of the evolution from target conditions to inducing geometric phases, smearing the robustness of the induced geometric quantum gates. Here, we present a general theoretical framework with enhanced robustness for geometric quantum gates by preserving fundamental geometric conditions. We first analytically evaluate the influence of systematic errors on geometric gates and then propose an optimized approach to mitigate this influence. Numerical simulations indicate that, as the geometric conditions are still maintained in the presence of systematic errors in our scheme, the constructed geometric quantum gates exhibit strong robustness, far superior to that of conventional schemes. Furthermore, we propose implementing the scheme in superconducting quantum circuits, where geometric quantum gates can achieve high fidelity with current experimental parameters. Therefore, the enhanced gate performance highlights the promise of our scheme for large-scale quantum computations.

Physical Review Applied•Aug 23, 2024•14 citations

Robust nonadiabatic geometric quantum computation by dynamical correction

Ming-Jie Liang, Zheng‐Yuan Xue

Besides the intrinsic noise resilience property, nonadiabatic geometric phases are of the fast evolution nature, and thus can naturally be used in constructing quantum gates with excellent performance, i.e., the so-called nonadiabatic geometric quantum computation (NGQC). However, previous single-loop NGQC schemes are sensitive to the operational control error, i.e., the $X$ error, due to the limitations of the implementation. Here, we propose a robust scheme for NGQC combining with the dynamical correction technique, which still uses only simplified pulses, and thus being experimental friendly. We numerically show that our scheme can greatly improve the gate robustness in previous protocols, retaining the intrinsic merit of geometric phases. Furthermore, to fight against the dephasing noise, due to the $Z$ error, we can incorporate the decoherence-free subspace encoding strategy. In this way, our scheme can be robust against both types of errors. Finally, we also propose how to implement the scheme with encoding on superconducting quantum circuits with experimentally demonstrated technology. Therefore, due to the intrinsic robustness, our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.

arXiv:2208.01472•Physical Review A•Jul 6, 2022•8 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

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
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.
Abstract Quantum computation based on nonadiabatic geometric phases has attracted a broad range of interests, due to its fast manipulation and inherent noise resistance. However, it is limited to some special evolution paths, and the gate-times are typically longer than conventional dynamical gates, resulting in weakening of robustness and more infidelities of the implemented geometric gates. Here, we propose a path-optimized scheme for geometric quantum computation (GQC) on superconducting transmon qubits, where high-fidelity and robust universal nonadiabatic geometric gates can be implemented, based on conventional experimental setups. Specifically, we find that, by selecting appropriate evolution paths, the constructed geometric gates can be superior to their corresponding dynamical ones under different local errors. Numerical simulations show that the fidelities for single-qubit geometric phase, π /8 and Hadamard gates can be obtained as 99.93%, 99.95% and 99.95%, respectively. Remarkably, the fidelity for two-qubit control-phase gate can be as high as 99.87%. Therefore, our scheme provides a new perspective for GQC, making it more promising in the application of large-scale fault-tolerant 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.
A nonadiabatic geometric quantum gate is realized by integrating nonadiabatic geometric phases with global geometric features into the unitary quantum control, thereby removing the limitation of a long evolution time in the adiabatic case. However, systematic errors are inevitable in practical quantum control; these lead to the deviation of the evolution from target conditions to inducing geometric phases, smearing the robustness of the induced geometric quantum gates. Here, we present a general theoretical framework with enhanced robustness for geometric quantum gates by preserving fundamental geometric conditions. We first analytically evaluate the influence of systematic errors on geometric gates and then propose an optimized approach to mitigate this influence. Numerical simulations indicate that, as the geometric conditions are still maintained in the presence of systematic errors in our scheme, the constructed geometric quantum gates exhibit strong robustness, far superior to that of conventional schemes. Furthermore, we propose implementing the scheme in superconducting quantum circuits, where geometric quantum gates can achieve high fidelity with current experimental parameters. Therefore, the enhanced gate performance highlights the promise of our scheme for large-scale quantum computations.
Besides the intrinsic noise resilience property, nonadiabatic geometric phases are of the fast evolution nature, and thus can naturally be used in constructing quantum gates with excellent performance, i.e., the so-called nonadiabatic geometric quantum computation (NGQC). However, previous single-loop NGQC schemes are sensitive to the operational control error, i.e., the XXX error, due to the limitations of the implementation. Here, we propose a robust scheme for NGQC combining with the dynamical correction technique, which still uses only simplified pulses, and thus being experimental friendly. We numerically show that our scheme can greatly improve the gate robustness in previous protocols, retaining the intrinsic merit of geometric phases. Furthermore, to fight against the dephasing noise, due to the ZZZ error, we can incorporate the decoherence-free subspace encoding strategy. In this way, our scheme can be robust against both types of errors. Finally, we also propose how to implement the scheme with encoding on superconducting quantum circuits with experimentally demonstrated technology. Therefore, due to the intrinsic robustness, our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.
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.
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.