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:2108.01531 · Physical Review Applied

Ultrafast Holonomic Quantum Gates

Pu Shen, Tao Chen, Zheng‐Yuan Xue

Published Oct 5, 2021• 15 citations
arXivHTMLPDF

Abstract

Quantum computation based on geometric phase is generally believed to be more robust against certain errors or noises than the conventional dynamical strategy. However, the gate error caused by the decoherence effect is inevitable, and thus faster gate operations are highly desired. Here, we propose a nonadiabatic holonomic quantum-computation (NHQC) scheme with detuned interactions on a $\mathrm{\ensuremath{\Delta}}$-type three-level system, which combines the time-optimal control technique with the time-independent detuning adjustment to further accelerate universal gate operations, so that the gate time can be greatly shortened within the hardware limitation, and thus high-fidelity gates can be obtained. Meanwhile, our numerical simulations show that the gate robustness is also stronger than previous schemes. Finally, we present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding, based on the experimentally demonstrated parametrically tunable coupling technique, which simplifies previous investigations. Therefore, our protocol provides a more promising alternative for future fault-tolerant quantum computation.

DOI
10.1103/physrevapplied.16.044004

Related papers

Dynamically Corrected Nonadiabatic Holonomic Quantum Gates

Sai Li, Zheng‐Yuan Xue

The key for realizing fault-tolerant quantum computation lies in maintaining the coherence of all qubits so that high-fidelity and robust quantum manipulations on them can be achieved. One of the promising approaches is to use geometric phases in the construction of universal quantum gates, due to their intrinsic robustness against certain types of local noise. However, due to limitations in previous implementations, the noise-resilience feature of nonadiabatic holonomic quantum computation (NHQC) still needs to be improved. Here, in combination with the dynamical-correction technique, we propose a general protocol of universal NHQC with simplified control, which can greatly suppress the effect of the accompanied X errors, retaining the main merit of geometric quantum operations. Numerical simulation shows that the performance of our gate can be much better than that of previous protocols. Remarkably, when incorporating a decoherence-free subspace encoding for the collective dephasing noise, our scheme can also be robust against the involved Z errors. In addition, we also outline the physical implementation of the protocol, which is insensitive to both X and Z errors. Therefore, our protocol provides a promising strategy for scalable fault-tolerant quantum computation.

arXiv:2012.09034•Physical Review Applied•Oct 5, 2021•30 citations

Accelerated super-robust nonadiabatic holonomic quantum gates

Pu Shen, Yan Liang, Tao Chen +1 more

The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous conventional schemes, the states of the calculation subspace have always leaked to the noncomputation subspace, resulting in less robustness than anticipated. Recent efforts to address this problem are at the cost of excessively long gate time, which will lead to more decoherence-induced errors. Here, we propose a solution to the problem without the severe limitation of the much longer gate time. Specifically, we implement arbitrary holonomic gates via a three-segment Hamiltonian, where the gate time depends on the rotation angle, and the smaller the rotation angle, the shorter the gate time will be. Compared with the previous solutions, our numerical simulations indicate that the decoherence-induced gate errors of our scheme are greatly decreased and the robustness of our scheme is also better, particularly for small-angle rotation gates. Moreover, we provide a detailed physical realization of our proposal on a two-dimensional superconducting quantum circuit. Therefore, our protocol provides a promising alternative for future fault-tolerant quantum computation.

arXiv:2304.01619•Physical Review A•Sep 5, 2023•14 citations

Robust and Fast Holonomic Quantum Gates with Encoding on Superconducting Circuits

Tao Chen, Pu Shen, Zheng‐Yuan Xue

High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to its intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising strategies. However, the longer gate time for geometric operations and more physical difficulties with regard to implementation hinder its practical and wide application. Here, we propose a simplified implementation of universal holonomic quantum gates on superconducting circuits with experimentally demonstrated techniques, which can remove these two main challenges by introducing time-optimal control into the construction of quantum gates. Notably, our scheme is also based on a decoherence-free subspace encoding and requires minimal physical-qubit resources, which can be partially immune to error caused by qubit-frequency drift, one of the main sources of error for large-scale superconducting circuits. Meanwhile, gate error caused by unwanted leakage can also be eliminated by our deliberate design of quantum evolution paths. Finally, our scheme is numerically shown to be more robust than the conventional ones and thus provides a promising strategy for scalable solid-state fault-tolerant quantum computation.

arXiv:2004.11132•Physical Review Applied•Sep 14, 2020•45 citations

Suppression of systematic errors in holonomic quantum gates via multipath correction

Shou-Yue Sun, Li‐Na Ji, Fei-Fan Cui +2 more

Nonadiabatic holonomic quantum computation (NHQC) based on non-Abelian geometric phases can possess potential robustness advantages due to its intrinsic error-resilient features. However, rigorous geometric conditions, including cyclic evolution and parallel transport conditions, typically demand complex and error-prone control and also involve additional auxiliary resources. Moreover, the limitations of optional evolution paths in previous NHQC schemes make it difficult to avoid path segments that are heavily affected by systematic errors, thereby weakening the error resilience of holonomic gates. To address this problem, we propose a multipath NHQC scheme, which can sufficiently improve the robustness of quantum gates by flexibly correcting geometric evolution paths. Numerical simulation results show that our scheme surpasses previous NHQC schemes in suppressing systematic errors for arbitrary gate types. In addition, we provide a physical implementation based on superconducting quantum circuits, with the decoherence-free-subspace encoding and an experiment-friendly two-body exchange interaction, demonstrating the excellent compatibility of our scheme. Therefore, our scheme offers a promising alternative for future fault-tolerant quantum computation.

Physical Review A•Dec 31, 2024•2 citations

Nonadiabatic Holonomic Quantum Computation via Path Optimization

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

Nonadiabatic holonomic quantum computation (NHQC) is implemented by fast evolution processes in a geometric way to withstand local noises. However, recent works of implementing NHQC are sensitive to the systematic noise and error. Here, we present a path-optimized NHQC (PONHQC) scheme based on the non-Abelian geometric phase, and find that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. Due to the flexibility of the PONHQC scheme, we can choose an optimized path that can lead to excellent gate performance. Numerical simulation shows that our optimized scheme can greatly outperform the conventional NHQC scheme, in terms of both fidelity and robustness of the gates. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding with the experiment-friendly two-body exchange interaction. Therefore, we present a flexible NHQC scheme that is promising for the future robust quantum computation.

arXiv:2205.09288•Physical Review Applied•Oct 13, 2022•10 citations

Dynamically Optimized Super‐Robust Nonadiabatic Holonomic Quantum Gates Based on Superconducting Circuits

Hai Li Xu, Wanchun Li, Tao Chen +2 more

ABSTRACT Nonadiabatic holonomic quantum computation (NHQC) leverages non‐Abelian geometric phases within a nonadiabatic framework to achieve fast and robust quantum gate operations. However, the practical implementation of NHQC is challenged by the imperfect control inherent in experimental environments. Ensuring deep suppression of control error is critical. In this work, we propose a dynamically optimized NHQC scheme to construct universal super‐robust holonomic quantum gates. The proposed scheme is implemented by strategically designing a set of dynamically correcting pulses to achieve cyclic evolution, while ensuring that unwanted and disruptive dynamical phase elements, including previously neglected cross‐coupling terms, are not accumulated. This constructed super‐robust NHQC scheme efficiently safeguards the cyclic evolution process and makes the holonomic gate immune to control error by effectively correcting the error up to the fourth order. Furthermore, when integrated with decoherence‐free subspace (DFS) encoding in superconducting quantum circuits, our scheme can achieve high‐fidelity holonomic gates, and demonstrate robust resilience against both control errors and collective dephasing errors. Consequently, our work offers a promising pathway toward the realization of scalable and fault‐tolerant holonomic quantum computation.

arXiv:2409.15665•Advanced Quantum Technologies•Dec 16, 2025•0 citations
Quantum computation based on geometric phase is generally believed to be more robust against certain errors or noises than the conventional dynamical strategy. However, the gate error caused by the decoherence effect is inevitable, and thus faster gate operations are highly desired. Here, we propose a nonadiabatic holonomic quantum-computation (NHQC) scheme with detuned interactions on a \ensuremathΔ\mathrm{\ensuremath{\Delta}}\ensuremathΔ-type three-level system, which combines the time-optimal control technique with the time-independent detuning adjustment to further accelerate universal gate operations, so that the gate time can be greatly shortened within the hardware limitation, and thus high-fidelity gates can be obtained. Meanwhile, our numerical simulations show that the gate robustness is also stronger than previous schemes. Finally, we present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding, based on the experimentally demonstrated parametrically tunable coupling technique, which simplifies previous investigations. Therefore, our protocol provides a more promising alternative for future fault-tolerant quantum computation.
The key for realizing fault-tolerant quantum computation lies in maintaining the coherence of all qubits so that high-fidelity and robust quantum manipulations on them can be achieved. One of the promising approaches is to use geometric phases in the construction of universal quantum gates, due to their intrinsic robustness against certain types of local noise. However, due to limitations in previous implementations, the noise-resilience feature of nonadiabatic holonomic quantum computation (NHQC) still needs to be improved. Here, in combination with the dynamical-correction technique, we propose a general protocol of universal NHQC with simplified control, which can greatly suppress the effect of the accompanied X errors, retaining the main merit of geometric quantum operations. Numerical simulation shows that the performance of our gate can be much better than that of previous protocols. Remarkably, when incorporating a decoherence-free subspace encoding for the collective dephasing noise, our scheme can also be robust against the involved Z errors. In addition, we also outline the physical implementation of the protocol, which is insensitive to both X and Z errors. Therefore, our protocol provides a promising strategy for scalable fault-tolerant quantum computation.
The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous conventional schemes, the states of the calculation subspace have always leaked to the noncomputation subspace, resulting in less robustness than anticipated. Recent efforts to address this problem are at the cost of excessively long gate time, which will lead to more decoherence-induced errors. Here, we propose a solution to the problem without the severe limitation of the much longer gate time. Specifically, we implement arbitrary holonomic gates via a three-segment Hamiltonian, where the gate time depends on the rotation angle, and the smaller the rotation angle, the shorter the gate time will be. Compared with the previous solutions, our numerical simulations indicate that the decoherence-induced gate errors of our scheme are greatly decreased and the robustness of our scheme is also better, particularly for small-angle rotation gates. Moreover, we provide a detailed physical realization of our proposal on a two-dimensional superconducting quantum circuit. Therefore, our protocol provides a promising alternative for future fault-tolerant quantum computation.
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to its intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising strategies. However, the longer gate time for geometric operations and more physical difficulties with regard to implementation hinder its practical and wide application. Here, we propose a simplified implementation of universal holonomic quantum gates on superconducting circuits with experimentally demonstrated techniques, which can remove these two main challenges by introducing time-optimal control into the construction of quantum gates. Notably, our scheme is also based on a decoherence-free subspace encoding and requires minimal physical-qubit resources, which can be partially immune to error caused by qubit-frequency drift, one of the main sources of error for large-scale superconducting circuits. Meanwhile, gate error caused by unwanted leakage can also be eliminated by our deliberate design of quantum evolution paths. Finally, our scheme is numerically shown to be more robust than the conventional ones and thus provides a promising strategy for scalable solid-state fault-tolerant quantum computation.
Nonadiabatic holonomic quantum computation (NHQC) based on non-Abelian geometric phases can possess potential robustness advantages due to its intrinsic error-resilient features. However, rigorous geometric conditions, including cyclic evolution and parallel transport conditions, typically demand complex and error-prone control and also involve additional auxiliary resources. Moreover, the limitations of optional evolution paths in previous NHQC schemes make it difficult to avoid path segments that are heavily affected by systematic errors, thereby weakening the error resilience of holonomic gates. To address this problem, we propose a multipath NHQC scheme, which can sufficiently improve the robustness of quantum gates by flexibly correcting geometric evolution paths. Numerical simulation results show that our scheme surpasses previous NHQC schemes in suppressing systematic errors for arbitrary gate types. In addition, we provide a physical implementation based on superconducting quantum circuits, with the decoherence-free-subspace encoding and an experiment-friendly two-body exchange interaction, demonstrating the excellent compatibility of our scheme. Therefore, our scheme offers a promising alternative for future fault-tolerant quantum computation.
Nonadiabatic holonomic quantum computation (NHQC) is implemented by fast evolution processes in a geometric way to withstand local noises. However, recent works of implementing NHQC are sensitive to the systematic noise and error. Here, we present a path-optimized NHQC (PONHQC) scheme based on the non-Abelian geometric phase, and find that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. Due to the flexibility of the PONHQC scheme, we can choose an optimized path that can lead to excellent gate performance. Numerical simulation shows that our optimized scheme can greatly outperform the conventional NHQC scheme, in terms of both fidelity and robustness of the gates. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding with the experiment-friendly two-body exchange interaction. Therefore, we present a flexible NHQC scheme that is promising for the future robust quantum computation.
ABSTRACT Nonadiabatic holonomic quantum computation (NHQC) leverages non‐Abelian geometric phases within a nonadiabatic framework to achieve fast and robust quantum gate operations. However, the practical implementation of NHQC is challenged by the imperfect control inherent in experimental environments. Ensuring deep suppression of control error is critical. In this work, we propose a dynamically optimized NHQC scheme to construct universal super‐robust holonomic quantum gates. The proposed scheme is implemented by strategically designing a set of dynamically correcting pulses to achieve cyclic evolution, while ensuring that unwanted and disruptive dynamical phase elements, including previously neglected cross‐coupling terms, are not accumulated. This constructed super‐robust NHQC scheme efficiently safeguards the cyclic evolution process and makes the holonomic gate immune to control error by effectively correcting the error up to the fourth order. Furthermore, when integrated with decoherence‐free subspace (DFS) encoding in superconducting quantum circuits, our scheme can achieve high‐fidelity holonomic gates, and demonstrate robust resilience against both control errors and collective dephasing errors. Consequently, our work offers a promising pathway toward the realization of scalable and fault‐tolerant holonomic quantum computation.