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

Dynamical-corrected nonadiabatic geometric quantum computation

Cheng-Yun Ding, Li Chen, Lihua Zhang, Zheng‐Yuan Xue

Published Jul 14, 2023• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1007/s11467-023-1322-2

Related papers

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

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

One-step implementation of Rydberg nonadiabatic noncyclic geometric quantum computation in decoherence-free subspaces

Li-Na Sun, F.-Q. Guo, Zheng Shan +3 more

Quantum gates constructed by geometric phase are naturally robust to control errors due to the global nature of the geometric evolution path. Therefore, how to cope with the inevitable decoherence errors is worthy of serious attention for geometric quantum computation. Different from conventional nonadiabatic geometric quantum computation (NGQC), which needs the same evolution time for any geometric rotation angle, we have proposed and experimentally demonstrated nonadiabatic noncyclic geometric quantum computation (NNGQC) without the requirement of the cyclic evolution condition, which thus reduces decoherence errors due to shortened evolution time [J. W. Zhang et al., Phys. Rev. Lett. 127, 030502 (2021)]. In addition, the use of decoherence-free subspaces (DFS) is another effective strategy to protect quantum gates from dephasing error and has been studied in nonadiabatic holonomic quantum computation [G. F. Xu et al., Phys. Rev. Lett. 109, 170501 (2012)]. Motivated by previous studies, we propose a one-step scheme to implement single-qubit NNGQC operation in DFS constructed by two Rydberg atoms, and then generalize the scheme to the two-logical-qubit case in one step. The numerical results show that our scheme is robust against decoherence in contrast to the NGQC counterparts. The present scheme combines the features of NNGQC and DFS and can further reduce the impact of decoherence on gate infidelity, which may provide an option for the realization of Rydberg-atom-based quantum computation in the future.

Physical Review A•Jun 10, 2022•14 citations

Nonadiabatic geometric quantum computation with shortened path on superconducting circuits

Cheng-Yun Ding, Yan Liang, Kai-Zhi Yu +1 more

Recently, nonadiabatic geometric quantum computation has received much attention due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and special evolution paths have been proposed, which usually require longer gate-time and more operational steps, and thus lead to lower quality of the implemented quantum gates. Here, we present an effective scheme to find the shortest geometric path under conventional conditions of geometric quantum computation, where high-fidelity and robust geometric gates can be realized by only single-loop evolution, and the gate performances are better than the corresponding dynamical ones. Furthermore, we can optimize the pulse shapes in our scheme to further shorten the gate-time, which is determined by how fast the path is traveled. In addition, we also present its physical implementation on superconducting circuits, consisting of capacitively coupled transmon qubits, where fidelities of geometric single- and two-qubit gates can be higher than 99.95% and 99.80% within the current state-of-the-art experimental technologies, respectively. These results indicate that our scheme is promising for large-scale fault-tolerant quantum computation.

arXiv:2111.01410•Applied Physics Letters•Nov 1, 2021•13 citations

Nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases

P. Z. Zhao, Guofu Xu, D. M. Tong

Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the previous schemes in this direction have been based on the conventional geometric phases, of which the dynamical phases need to be removed. In this paper, we put forward a scheme of nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases, of which the dynamical phases do not need to be removed. Specifically, by using three physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of geometric gates nonadiabatically and unconventionally. Our scheme not only maintains all the merits of nonadiabatic geometric quantum computation in decoherence-free subspaces, but also avoids the additional operations required in the conventional schemes to cancel the dynamical phases.

arXiv:1612.08466•Physical Review A•Dec 21, 2016•45 citations

Universal robust nonadiabatic geometric quantum computation with shortened composite pulses on superconducting circuits

Cheng-Yun Ding, Na Kuang, Yu Jin +3 more

The nonadiabatic geometric quantum computation (NGQC) using the nonadiabatic geometric phases is a promising strategy to realize the high-fidelity quantum operation for large-scale quantum processing. However, conventional NQGC schemes combining with optimal control techniques to further improve the gate fidelity and robustness usually either comes at the cost of prolonged gate time or require complex pulse control and only are limited to several certain specific quantum gates or/and for a certain type error source. Thus, implementing universal and robust geometric gates with simple control while further suppressing gate times remains a major challenge. Here, we propose a scheme for universal robust geometric gates with shortened composite pulses, where the pulse control is simple and enough available evolution parameters can be utilized to effectively reduce the sensitivity to universal systematic errors. Numerical simulations demonstrate that our universal geometric gates set exhibit much stronger error resilience than their conventional single-loop counterparts. Finally, we also verify the robustness advantage of our scheme on realistic superconducting quantum circuits with experimentally demonstrated technology. Therefore, our work paves an alternative way to achieve high-fidelity and robust geometric quantum computation against multiple errors.

arXiv:2611.11420•Nov 8, 2026•0 citations
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.
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.
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.
Quantum gates constructed by geometric phase are naturally robust to control errors due to the global nature of the geometric evolution path. Therefore, how to cope with the inevitable decoherence errors is worthy of serious attention for geometric quantum computation. Different from conventional nonadiabatic geometric quantum computation (NGQC), which needs the same evolution time for any geometric rotation angle, we have proposed and experimentally demonstrated nonadiabatic noncyclic geometric quantum computation (NNGQC) without the requirement of the cyclic evolution condition, which thus reduces decoherence errors due to shortened evolution time [J. W. Zhang et al., Phys. Rev. Lett. 127, 030502 (2021)]. In addition, the use of decoherence-free subspaces (DFS) is another effective strategy to protect quantum gates from dephasing error and has been studied in nonadiabatic holonomic quantum computation [G. F. Xu et al., Phys. Rev. Lett. 109, 170501 (2012)]. Motivated by previous studies, we propose a one-step scheme to implement single-qubit NNGQC operation in DFS constructed by two Rydberg atoms, and then generalize the scheme to the two-logical-qubit case in one step. The numerical results show that our scheme is robust against decoherence in contrast to the NGQC counterparts. The present scheme combines the features of NNGQC and DFS and can further reduce the impact of decoherence on gate infidelity, which may provide an option for the realization of Rydberg-atom-based quantum computation in the future.
Recently, nonadiabatic geometric quantum computation has received much attention due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and special evolution paths have been proposed, which usually require longer gate-time and more operational steps, and thus lead to lower quality of the implemented quantum gates. Here, we present an effective scheme to find the shortest geometric path under conventional conditions of geometric quantum computation, where high-fidelity and robust geometric gates can be realized by only single-loop evolution, and the gate performances are better than the corresponding dynamical ones. Furthermore, we can optimize the pulse shapes in our scheme to further shorten the gate-time, which is determined by how fast the path is traveled. In addition, we also present its physical implementation on superconducting circuits, consisting of capacitively coupled transmon qubits, where fidelities of geometric single- and two-qubit gates can be higher than 99.95% and 99.80% within the current state-of-the-art experimental technologies, respectively. These results indicate that our scheme is promising for large-scale fault-tolerant quantum computation.
Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the previous schemes in this direction have been based on the conventional geometric phases, of which the dynamical phases need to be removed. In this paper, we put forward a scheme of nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases, of which the dynamical phases do not need to be removed. Specifically, by using three physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of geometric gates nonadiabatically and unconventionally. Our scheme not only maintains all the merits of nonadiabatic geometric quantum computation in decoherence-free subspaces, but also avoids the additional operations required in the conventional schemes to cancel the dynamical phases.
The nonadiabatic geometric quantum computation (NGQC) using the nonadiabatic geometric phases is a promising strategy to realize the high-fidelity quantum operation for large-scale quantum processing. However, conventional NQGC schemes combining with optimal control techniques to further improve the gate fidelity and robustness usually either comes at the cost of prolonged gate time or require complex pulse control and only are limited to several certain specific quantum gates or/and for a certain type error source. Thus, implementing universal and robust geometric gates with simple control while further suppressing gate times remains a major challenge. Here, we propose a scheme for universal robust geometric gates with shortened composite pulses, where the pulse control is simple and enough available evolution parameters can be utilized to effectively reduce the sensitivity to universal systematic errors. Numerical simulations demonstrate that our universal geometric gates set exhibit much stronger error resilience than their conventional single-loop counterparts. Finally, we also verify the robustness advantage of our scheme on realistic superconducting quantum circuits with experimentally demonstrated technology. Therefore, our work paves an alternative way to achieve high-fidelity and robust geometric quantum computation against multiple errors.