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:2605.00552 · APS Open Science

Suppression of Universal Errors in DFS-Encoded Superconducting Geometric Logical \emph{T} Gate

Cheng-Yun Ding, Li-Hua Zhang, Jian Zhou

quant-phSubmitted May 1, 2026• Announced May 4, 2026• 0 citations
arXivHTMLPDF

Abstract

High-fidelity logical \emph{T}-gate realization constitutes a core prerequisite for large-scale fault-tolerant quantum computing. However, conventional magic state distillation requires massive physical qubit overhead across successive distillation rounds, alongside sophisticated measurement and feedback control, thereby inducing considerable spatial and temporal resource consumption. Herein, we propose a controlled superconducting geometric logical \emph{T} gate scheme that achieves high-order suppression of universal errors, by integrating decoherence-free subspace encoding with multi-loop optimized composite geometric pulse engineering. Guided by tailored trajectory design, we systematically establish unified gate construction frameworks for conventional geometric, composite geometric, and optimized composite geometric protocols. By flexibly controling additional parametric degrees of freedom, the proposed scheme achieves substantially enhanced robustness against diverse noise sources. Numerical simulations reveal that, within tunable superconducting quantum circuits, our geometric logical \emph{T} gate outperforms both conventional composite geometric and dynamical gates in suppressing Rabi frequency, detuning, and residual inter-qubit crosstalk errors that can all be suppressed to the fourth order, while additionally providing inherent suppression of collective dephasing errors. The present strategy alleviates intrinsic limitations of mainstream approaches and opens a promising avenue toward robust high-fidelity logical \emph{T} gate construction.

Comments
17 pages, 12 figures

Related papers

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

Error-Tolerant Geometric Quantum Control for Logical Qubits with Minimal Resources

Tao Chen, Zheng‐Yuan Xue, Z.D. Wang

Geometric quantum computation offers a practical strategy toward robust quantum computation due to its inherent error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls, especially for logical qubits that involve more physical qubits, whose error tolerance is effective in principle, but their experimental demonstration is still demanding. Thus, how to best simplify the needed control and manifest its full advantage has become the key to widespread applications of geometric quantum computation. Here we propose a fast and robust geometric scheme, with decoherence-free subspace encoding, and present its physical implementation on superconducting quantum circuits, where we only utilize the experimentally demonstrated parametrically tunable coupling to achieve high-fidelity geometric control over logical qubits. Numerical simulation verifies that it can efficiently combine the error tolerance from both the geometric phase and logical-qubit encoding, displaying our gate-performance superiority over the conventional dynamical one without encoding, in terms of both gate fidelity and robustness. Therefore, our scheme can consolidate both error suppression methods for logical-qubit control, which sheds light on the future large-scale quantum computation.

arXiv:2112.08823•Physical Review Applied•Jul 26, 2022•10 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

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

Universal Robust Quantum Gates via Doubly Geometric Control

Hai Xu, Tao Chen, Junkai Zeng +5 more

Geometric quantum computation offers a potential route to fault-tolerant quantum information processing by exploiting the global nature of geometric phases. However, achieving controlled high-order suppression of multiple error sources remains a long-standing limitation, particularly in realistic large-scale circuits with complex noise environments. This limitation is largely due to the absence of a general framework that directly characterizes error accumulation and enables systematic improvement. Here we establish such a framework for universal doubly geometric gates by embedding target operations into a hierarchy of level-n identity constructions. This approach enables direct quantification of error accumulation while removing structural constraints inherent in previous schemes. We analytically show that the defining conditions lead to simultaneous fourth-order suppression of control errors, with a systematic extension to sixth-order suppression via higher-level constructions. Our results establish doubly geometric control as a general and scalable route toward high-order robust quantum gates, with potential implications for fault-tolerant quantum information processing.

quant-pharXiv:2604.02962•Apr 6, 2026•0 citations

Composite nonadiabatic geometric quantum gates with optimization on superconducting circuits

Cheng-Yun Ding, Wanfang Liu, Lihua Zhang +2 more

Due to its fast and robust characteristics, nonadiabatic geometric quantum computation with various optimized techniques has received much attention. However, these strategies either require precise pulse control or can only mitigate partial systematic errors, hindering their experimental development. Here, we propose a scheme for optimized composite nonadiabatic geometric quantum gates (OCNGQGs), which can further enhance the gate performance of the composite nonadiabatic geometric scheme. Specifically, by optimizing the path parameter, our scheme effectively resists systematic errors in both directions, i.e., Rabi frequency and detuning errors, while preserving the flexibility of pulse shapes. Numerical simulations demonstrate that our scheme offers superior gate robustness against these two types of errors compared to conventional schemes. Additionally, we propose to implement our scheme on superconducting transmon qubits, where the numerical results show the robustness of universal gates remaining evident within current technology. Therefore, our proposal provides a promising approach to achieve robust quantum gates for future scalable quantum computation.

arXiv:2509.24737•Frontiers of Physics•Jan 1, 2026•2 citations
High-fidelity logical \emph{T}-gate realization constitutes a core prerequisite for large-scale fault-tolerant quantum computing. However, conventional magic state distillation requires massive physical qubit overhead across successive distillation rounds, alongside sophisticated measurement and feedback control, thereby inducing considerable spatial and temporal resource consumption. Herein, we propose a controlled superconducting geometric logical \emph{T} gate scheme that achieves high-order suppression of universal errors, by integrating decoherence-free subspace encoding with multi-loop optimized composite geometric pulse engineering. Guided by tailored trajectory design, we systematically establish unified gate construction frameworks for conventional geometric, composite geometric, and optimized composite geometric protocols. By flexibly controling additional parametric degrees of freedom, the proposed scheme achieves substantially enhanced robustness against diverse noise sources. Numerical simulations reveal that, within tunable superconducting quantum circuits, our geometric logical \emph{T} gate outperforms both conventional composite geometric and dynamical gates in suppressing Rabi frequency, detuning, and residual inter-qubit crosstalk errors that can all be suppressed to the fourth order, while additionally providing inherent suppression of collective dephasing errors. The present strategy alleviates intrinsic limitations of mainstream approaches and opens a promising avenue toward robust high-fidelity logical \emph{T} gate construction.
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.
Geometric quantum computation offers a practical strategy toward robust quantum computation due to its inherent error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls, especially for logical qubits that involve more physical qubits, whose error tolerance is effective in principle, but their experimental demonstration is still demanding. Thus, how to best simplify the needed control and manifest its full advantage has become the key to widespread applications of geometric quantum computation. Here we propose a fast and robust geometric scheme, with decoherence-free subspace encoding, and present its physical implementation on superconducting quantum circuits, where we only utilize the experimentally demonstrated parametrically tunable coupling to achieve high-fidelity geometric control over logical qubits. Numerical simulation verifies that it can efficiently combine the error tolerance from both the geometric phase and logical-qubit encoding, displaying our gate-performance superiority over the conventional dynamical one without encoding, in terms of both gate fidelity and robustness. Therefore, our scheme can consolidate both error suppression methods for logical-qubit control, which sheds light on the future large-scale quantum computation.
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.
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.
Geometric quantum computation offers a potential route to fault-tolerant quantum information processing by exploiting the global nature of geometric phases. However, achieving controlled high-order suppression of multiple error sources remains a long-standing limitation, particularly in realistic large-scale circuits with complex noise environments. This limitation is largely due to the absence of a general framework that directly characterizes error accumulation and enables systematic improvement. Here we establish such a framework for universal doubly geometric gates by embedding target operations into a hierarchy of level-n identity constructions. This approach enables direct quantification of error accumulation while removing structural constraints inherent in previous schemes. We analytically show that the defining conditions lead to simultaneous fourth-order suppression of control errors, with a systematic extension to sixth-order suppression via higher-level constructions. Our results establish doubly geometric control as a general and scalable route toward high-order robust quantum gates, with potential implications for fault-tolerant quantum information processing.
Due to its fast and robust characteristics, nonadiabatic geometric quantum computation with various optimized techniques has received much attention. However, these strategies either require precise pulse control or can only mitigate partial systematic errors, hindering their experimental development. Here, we propose a scheme for optimized composite nonadiabatic geometric quantum gates (OCNGQGs), which can further enhance the gate performance of the composite nonadiabatic geometric scheme. Specifically, by optimizing the path parameter, our scheme effectively resists systematic errors in both directions, i.e., Rabi frequency and detuning errors, while preserving the flexibility of pulse shapes. Numerical simulations demonstrate that our scheme offers superior gate robustness against these two types of errors compared to conventional schemes. Additionally, we propose to implement our scheme on superconducting transmon qubits, where the numerical results show the robustness of universal gates remaining evident within current technology. Therefore, our proposal provides a promising approach to achieve robust quantum gates for future scalable quantum computation.