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

Enhanced-Fidelity Ultrafast Geometric Quantum Computation Using Strong Classical Drives

Ye‐Hong Chen, Adam Miranowicz, Xi Chen, Yan Xia, Franco Nori

Published Dec 20, 2022• 16 citations
arXivHTMLPDF

Abstract

We propose a general approach to implement ultrafast nonadiabatic geometric single- and two-qubit gates by employing counter-rotating effects. This protocol is compatible with most optimal control methods used in previous rotating-wave approximation (RWA) protocols; thus, it is as robust as (or even more robust than) the RWA protocols. Using counter-rotating effects allows us to apply strong drives. Therefore, we can improve the gate speed by 5--10 times compared to the RWA counterpart for implementing high-fidelity ($\ensuremath{\ge}\phantom{\rule{0.2em}{0ex}}99.99\mathrm{%}$) gates. Such an ultrafast evolution (nanoseconds, even picoseconds) significantly reduces the influence of decoherence (e.g., the qubit dissipation and dephasing). Moreover, because the counter-rotating effects no longer induce a gate infidelity (in both the weak and strong driving regimes), we can achieve a higher fidelity compared to the RWA protocols. Therefore, in the presence of decoherence, one can implement ultrafast geometric quantum gates with $\ensuremath{\ge}\phantom{\rule{0.2em}{0ex}}99\mathrm{%}$ fidelities.

DOI
10.1103/physrevapplied.18.064059

Related papers

Noncyclic and Nonadiabatic Geometric Quantum Gates with Smooth Paths

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

Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which is the necessity of fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate-time and abrupt pulse control, and thus weaken the gate performance. Here, we propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolutions, which effectively shorten the gate duration, and universal quantum gates can be realized in one step without path mutation. Our numerical simulation shows that, comparing with the conventional dynamical gates, the constructed geometric gates have stronger resistant not only to noise but also to decoherence effect. In addition, our scheme can also be implemented on a superconducting circuit platform, with the fidelities of single-qubit and two-qubit gates higher than 99.97$\%$ and 99.84$\%$, respectively. Therefore, our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable quantum computation.

•Feb 1, 2021•2 citations

Single-qubit gates beyond the rotating-wave approximation for strongly anharmonic low-frequency qubits

Martijn F. S. Zwanenburg, Siddharth Singh, Eugene Y. Huang +5 more

In many quantum platforms, single-qubit gates are applied using a linear drive resonant with the qubit transition frequency, which is often theoretically described within the rotating-wave approximation (RWA). However, for fast gates on low-frequency qubits, the RWA may not hold and we need to consider the contribution from counterrotating terms to the qubit dynamics. The inclusion of counterrotating terms into the theoretical description gives rise to two challenges. First, it becomes challenging to analytically calculate the time evolution as the Hamiltonian is no longer self-commuting. Moreover, the time evolution now depends on the carrier phase such that, in general, every operation in a sequence of gates is different. In this work, we derive and verify a correction to the drive pulses that minimizes the effect of these counterrotating terms in a two-level system. We then derive a second correction term that arises from noncomputational levels for a strongly anharmonic system. We experimentally implement these correction terms on a fluxonium superconducting qubit, which is an example of a strongly anharmonic, low-frequency qubit for which the RWA may not hold, and demonstrate how fast, high-fidelity single-qubit gates can be achieved without the need for additional hardware and calibration complexities.

arXiv:2503.08238•Physical Review Research•Nov 17, 2025•4 citations

Optimal detuning and gate time for strongly driven single-qubit gates beyond the rotating-wave approximation

Alejandro D. Bendersky, Sergio S. Gomez, Rodolfo H. Romero

Single-qubit quantum gates are implemented as the time-controlled unitary evolution of a two-level system under harmonic driving. The rotating-wave approximation (RWA) provides closed-form gate parameters for weak coupling. Larger amplitudes, desirable to speed up the dynamics, make the RWA-designed gates inaccurate because of the neglected counter-rotating term, which also shifts the resonance (Bloch-Siegert shift). Here we study theoretically the infidelity of gates beyond the RWA, using the effective Magnus-Taylor Hamiltonian through second order in the inverse of the driving frequency. By detuning the driving frequency by an amplitude-dependent shift of Bloch-Siegert type and rescaling the operation time, the RWA gate conditions are recovered with corrected parameters. Numerical solutions of the Schrodinger equation show that these corrections lower the gate infidelity by several orders of magnitude, extending the range of usable amplitudes

quant-pharXiv:2610.40595•Oct 30, 2026•0 citations

A universal set of geometric quantum gates through dressed-states assisted shortcuts to adiabaticity

María E. Rus, Alejandro Ferrón, Omar Osenda +1 more

Abstract Geometric quantum computation relies on the geometric phase that arises in adiabatic cyclic evolutions of non-degenerate quantum systems, enabling the design of robust quantum gates. However, the adiabatic condition requires long evolution times, making the system vulnerable to decoherence. In this work, we propose a scheme to realize fast and high-fidelity geometric quantum gates by applying the superadiabatic transitionless driving protocol within the dressed-state framework. We analyze the implementation of single-qubit gates in a two-level system driven by a microwave field, focusing in particular on the nitrogen-vacancy center in diamond. We show how the dynamical phase can be canceled to obtain purely geometric operations. The robustness of the gates is assessed under systematic errors and environmental decoherence, demonstrating high fidelity even in regimes with strong fluctuations. Finally, we extend the protocol to construct nontrivial two-qubit gates, highlighting its feasibility for scalable quantum information processing.

arXiv:2509.08723•Journal of Physics B Atomic Molecular and Optical Physics•Feb 2, 2026•1 citation

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

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
We propose a general approach to implement ultrafast nonadiabatic geometric single- and two-qubit gates by employing counter-rotating effects. This protocol is compatible with most optimal control methods used in previous rotating-wave approximation (RWA) protocols; thus, it is as robust as (or even more robust than) the RWA protocols. Using counter-rotating effects allows us to apply strong drives. Therefore, we can improve the gate speed by 5--10 times compared to the RWA counterpart for implementing high-fidelity (\ensuremath{\ge}\phantom{\rule{0.2em}{0ex}}99.99\mathrm{%}) gates. Such an ultrafast evolution (nanoseconds, even picoseconds) significantly reduces the influence of decoherence (e.g., the qubit dissipation and dephasing). Moreover, because the counter-rotating effects no longer induce a gate infidelity (in both the weak and strong driving regimes), we can achieve a higher fidelity compared to the RWA protocols. Therefore, in the presence of decoherence, one can implement ultrafast geometric quantum gates with \ensuremath{\ge}\phantom{\rule{0.2em}{0ex}}99\mathrm{%} fidelities.
Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which is the necessity of fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate-time and abrupt pulse control, and thus weaken the gate performance. Here, we propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolutions, which effectively shorten the gate duration, and universal quantum gates can be realized in one step without path mutation. Our numerical simulation shows that, comparing with the conventional dynamical gates, the constructed geometric gates have stronger resistant not only to noise but also to decoherence effect. In addition, our scheme can also be implemented on a superconducting circuit platform, with the fidelities of single-qubit and two-qubit gates higher than 99.97%\%% and 99.84%\%%, respectively. Therefore, our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable quantum computation.
In many quantum platforms, single-qubit gates are applied using a linear drive resonant with the qubit transition frequency, which is often theoretically described within the rotating-wave approximation (RWA). However, for fast gates on low-frequency qubits, the RWA may not hold and we need to consider the contribution from counterrotating terms to the qubit dynamics. The inclusion of counterrotating terms into the theoretical description gives rise to two challenges. First, it becomes challenging to analytically calculate the time evolution as the Hamiltonian is no longer self-commuting. Moreover, the time evolution now depends on the carrier phase such that, in general, every operation in a sequence of gates is different. In this work, we derive and verify a correction to the drive pulses that minimizes the effect of these counterrotating terms in a two-level system. We then derive a second correction term that arises from noncomputational levels for a strongly anharmonic system. We experimentally implement these correction terms on a fluxonium superconducting qubit, which is an example of a strongly anharmonic, low-frequency qubit for which the RWA may not hold, and demonstrate how fast, high-fidelity single-qubit gates can be achieved without the need for additional hardware and calibration complexities.
Single-qubit quantum gates are implemented as the time-controlled unitary evolution of a two-level system under harmonic driving. The rotating-wave approximation (RWA) provides closed-form gate parameters for weak coupling. Larger amplitudes, desirable to speed up the dynamics, make the RWA-designed gates inaccurate because of the neglected counter-rotating term, which also shifts the resonance (Bloch-Siegert shift). Here we study theoretically the infidelity of gates beyond the RWA, using the effective Magnus-Taylor Hamiltonian through second order in the inverse of the driving frequency. By detuning the driving frequency by an amplitude-dependent shift of Bloch-Siegert type and rescaling the operation time, the RWA gate conditions are recovered with corrected parameters. Numerical solutions of the Schrodinger equation show that these corrections lower the gate infidelity by several orders of magnitude, extending the range of usable amplitudes
Abstract Geometric quantum computation relies on the geometric phase that arises in adiabatic cyclic evolutions of non-degenerate quantum systems, enabling the design of robust quantum gates. However, the adiabatic condition requires long evolution times, making the system vulnerable to decoherence. In this work, we propose a scheme to realize fast and high-fidelity geometric quantum gates by applying the superadiabatic transitionless driving protocol within the dressed-state framework. We analyze the implementation of single-qubit gates in a two-level system driven by a microwave field, focusing in particular on the nitrogen-vacancy center in diamond. We show how the dynamical phase can be canceled to obtain purely geometric operations. The robustness of the gates is assessed under systematic errors and environmental decoherence, demonstrating high fidelity even in regimes with strong fluctuations. Finally, we extend the protocol to construct nontrivial two-qubit gates, highlighting its feasibility for scalable quantum information processing.
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 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.