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:2611.11420

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

Cheng-Yun Ding, Na Kuang, Yu Jin, Li Tang, Rui Huang, Li-Hua Zhang

Published Nov 8, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2611.11420

Related papers

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

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

Nonadiabatic geometric quantum gates by composite pulses based on superconducting qubits

Zi-Yu Fang, Hai Li Xu, Tao Chen +2 more

The nonadiabatic geometric quantum gate (NGQG) is promising for the realization of high-fidelity operation for large-scale quantum processing. Normally, conventional NGQGs can be especially robust to either the Rabi error or the detuning error, which are two typical errors in many quantum computing platforms. However, it is difficult to suppress these two types of errors at the same time. This remains a big challenge for NGQGs. Here we present a general framework to implement the optimized geometric gate, where the evolution path is performed by using a family of optimized composite pulses. These composite pulses can reduce the sensitivity to the detuning error without introducing an extra Rabi error for this path. Thus, they help fulfill the cyclic evolution condition for the geometric gate. In addition, the inserted composite pulses would not introduce unwanted dynamical phase accumulation. As a result, the designed optimized geometric gate can simultaneously mitigate both the Rabi and detuning errors even in the presence of decoherence related to the real experiments. Our work paves a way to achieve geometric quantum computation robust against multiple errors.

Physical Review A•Apr 11, 2024•12 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

High‐Fidelity Geometric Quantum Gates with Short Paths on Superconducting Circuits

Sai Li, Jing Xue, Tao Chen +1 more

Abstract Geometric phases are robust against certain types of local noises, and thus provide a promising way toward high‐fidelity quantum gates. However, comparing with the dynamical ones, previous implementations of nonadiabatic geometric quantum gates usually require longer evolution time, due to the needed longer evolution path. Here, a scheme is proposed to realize nonadiabatic geometric quantum gates with short paths based on simple pulse control techniques, instead of deliberated pulse control in previous investigations, which can thus further suppress the influence from the environment induced noises. Specifically, the idea is illustrated on a superconducting quantum circuit, which is one of the most promising platforms for realizing practical quantum computer. As the current scheme shortens the geometric evolution path, ultra‐high gate fidelity can be obtained, especially for the two‐qubit gate case, as verified by the numerical simulation. Therefore, the protocol suggests a promising way toward high‐fidelity and robust quantum computation on a solid‐state quantum system.

arXiv:2102.03553•Advanced Quantum Technologies•Mar 3, 2021•20 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
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.
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.
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.
The nonadiabatic geometric quantum gate (NGQG) is promising for the realization of high-fidelity operation for large-scale quantum processing. Normally, conventional NGQGs can be especially robust to either the Rabi error or the detuning error, which are two typical errors in many quantum computing platforms. However, it is difficult to suppress these two types of errors at the same time. This remains a big challenge for NGQGs. Here we present a general framework to implement the optimized geometric gate, where the evolution path is performed by using a family of optimized composite pulses. These composite pulses can reduce the sensitivity to the detuning error without introducing an extra Rabi error for this path. Thus, they help fulfill the cyclic evolution condition for the geometric gate. In addition, the inserted composite pulses would not introduce unwanted dynamical phase accumulation. As a result, the designed optimized geometric gate can simultaneously mitigate both the Rabi and detuning errors even in the presence of decoherence related to the real experiments. Our work paves a way to achieve geometric quantum computation robust against multiple errors.
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.
Abstract Geometric phases are robust against certain types of local noises, and thus provide a promising way toward high‐fidelity quantum gates. However, comparing with the dynamical ones, previous implementations of nonadiabatic geometric quantum gates usually require longer evolution time, due to the needed longer evolution path. Here, a scheme is proposed to realize nonadiabatic geometric quantum gates with short paths based on simple pulse control techniques, instead of deliberated pulse control in previous investigations, which can thus further suppress the influence from the environment induced noises. Specifically, the idea is illustrated on a superconducting quantum circuit, which is one of the most promising platforms for realizing practical quantum computer. As the current scheme shortens the geometric evolution path, ultra‐high gate fidelity can be obtained, especially for the two‐qubit gate case, as verified by the numerical simulation. Therefore, the protocol suggests a promising way toward high‐fidelity and robust quantum computation on a solid‐state quantum system.
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.