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:2205.08699 · Physical Review A

Suppressing classical noise in the accelerated geometric phase gate by optimized dynamical decoupling

Da-tong Chen, Jun Jing

Published Aug 3, 2022• 2 citations
arXivHTMLPDF

Abstract

In the quantum-computation scenario, the geometric phase gates are becoming increasingly attractive for their intrinsic fault tolerance to disturbance. With an adiabatic cyclic evolution, Berry phase appears to realize a geometric transformation. Performing the quantum gates as many as possible within the timescale of coherence, however, remains an inconvenient bottleneck due to the systematic errors. Here we propose an accelerated adiabatic quantum gate based on the Berry phase, the transitionless driving, and the dynamical decoupling. It reconciles a high fidelity with a high speed in the presence of control noise or imperfection. We optimize the dynamical-decoupling sequence in the time domain under a popular Gaussian noise spectrum following the inversely quadratic power law.

DOI
10.1103/physreva.106.022603

Related papers

Fast non-Abelian geometric gates via transitionless quantum driving

Jiang Zhang, Thi Ha Kyaw, D. M. Tong +2 more

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.

arXiv:1412.2848•Scientific Reports•Dec 21, 2015•102 citations

Berry-phase-based quantum gates assisted by transitionless quantum driving

Shi-fan Qi, Jun Jing

We propose a novel method for constructing geometric quantum gates using three- or two-level systems, in which a controllable variable, the detuning between the driving frequency and the atomic energy spacing, is introduced to realize geometric transformations. In particular, we have two instantaneous eigenstates with opposite eigenvalues constituting a closed loop in the parameter space. The accumulated dynamical phase is then exactly cancelled when the loop is completed, which is beyond the traditional parallel-transport restriction. We apply the transitionless quantum driving method to enhance the speed and fidelity of geometric gates. Gate fidelity in the presence of decoherence is also estimated.

arXiv:1905.09524•Journal of the Optical Society of America B•Jan 9, 2020•10 citations

High-Fidelity and Robust Geometric Quantum Gates that Outperform Dynamical Ones

Tao Chen, Zheng‐Yuan Xue

Geometric phase is a promising element to induce high-fidelity and robust quantum operations due to its built-in noise-resilience feature. Unfortunately, its practical applications are usually circumscribed by requiring complex interactions among multiple levels or qubits and a longer gate time than the corresponding dynamical ones. Here, we propose a general framework of geometric quantum computation with the integration of the time-optimal control technique, where the shortest smooth geometric path is found to realize accelerated geometric quantum gates and thus greatly decreases the gate errors induced by both the decoherence effect and operational imperfections. Meanwhile, we faithfully implement our idea on a scalable platform of a two-dimensional superconducting transmon-qubit lattice, with simple and experimentally accessible interactions. In addition, numerical simulations show that our implemented geometric gates possess higher fidelities and stronger robustness, which outperform the best performance of the corresponding dynamical ones. Therefore, our scheme provides a promising alternative route toward scalable fault-tolerant solid-state quantum computation.

arXiv:2001.05789•Physical Review Applied•Dec 2, 2020•52 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•2 citations

Towards robust dynamical decoupling and high fidelity adiabatic quantum computation

Gregory Quiroz

Quantum computation (QC) relies on the ability to implement high-fidelity quantum gate operations and successfully preserve quantum state coherence. One of the most challenging obstacles for reliable QC is overcoming the inevitable interaction between a quantum system and its environment. Unwanted interactions result in decoherence processes that cause quantum states to deviate from a desired evolution, consequently leading to computational errors and loss of coherence. Dynamical decoupling (DD) is one such method, which seeks to attenuate the effects of decoherence by applying strong and expeditious control pulses solely to the system. Provided the pulses are applied over a time duration sufficiently shorter than the correlation time associated with the environment dynamics, DD effectively averages out undesirable interactions and preserves quantum states with a low probability of error, or fidelity loss. In this study various aspects of this approach are studied from sequence construction to applications of DD to protecting QC. First, a comprehensive examination of the error suppression properties of a near-optimal DD approach is given to understand the relationship between error suppression capabilities and the number of required DD control pulses in the case of ideal, instantaneous pulses. While such considerations are instructive for examining DD efficiency, i.e., performance vs the number of control pulses, high-fidelity DD in realizable systems is difficult to achieve due to intrinsic pulse imperfections which further contribute to decoherence. As a second consideration, it is shown how one can overcome this hurdle and achieve robustness and recover high-fidelity DD in the presence of faulty control pulses using Genetic Algorithm optimization and sequence symmetrization. Thirdly, to illustrate the implementation of DD in conjunction with QC, the utilization of DD and quantum error correction codes (QECCs) as a protection method for adiabatic quantum computing (AQC) is discussed. A performance comparison between two deterministic DD schemes is given, where preference towards one particular method is found due to sequence structure and procedure from which higher accuracy sequences are generated.

•Dec 9, 2013•0 citations

NMR C-NOT gate through the Aharanov-Anandan phase shift

Xiang‐Bin Wang, Keiji Matsumoto

Recently, it has been proposed to perform quantum computation through the Berry phase (adiabatic cyclic geometric phase) shift with NMR. This geometric quantum gate will hopefully be fault tolerant to certain types of error because of the geometric property of the Berry phase. Here we give a scheme to realize the NMR C-NOT gate through the Aharonov-Anandan phase (non-adiabatic cyclic phase) shift on the dynamic phase free evolution loop. In our scheme, the gate is run non-adiabatically, thus it is less affected by the decoherence. Moreover, in the scheme we have chosen the zero dynamic phase time evolution loop in obtaining the geometric phase shift; we need not perform any extra operation to cancel the dynamic phase.

arXiv:quant-ph/0105024•Journal of Physics A Mathematical and General•Oct 31, 2001•19 citations
In the quantum-computation scenario, the geometric phase gates are becoming increasingly attractive for their intrinsic fault tolerance to disturbance. With an adiabatic cyclic evolution, Berry phase appears to realize a geometric transformation. Performing the quantum gates as many as possible within the timescale of coherence, however, remains an inconvenient bottleneck due to the systematic errors. Here we propose an accelerated adiabatic quantum gate based on the Berry phase, the transitionless driving, and the dynamical decoupling. It reconciles a high fidelity with a high speed in the presence of control noise or imperfection. We optimize the dynamical-decoupling sequence in the time domain under a popular Gaussian noise spectrum following the inversely quadratic power law.
A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.
We propose a novel method for constructing geometric quantum gates using three- or two-level systems, in which a controllable variable, the detuning between the driving frequency and the atomic energy spacing, is introduced to realize geometric transformations. In particular, we have two instantaneous eigenstates with opposite eigenvalues constituting a closed loop in the parameter space. The accumulated dynamical phase is then exactly cancelled when the loop is completed, which is beyond the traditional parallel-transport restriction. We apply the transitionless quantum driving method to enhance the speed and fidelity of geometric gates. Gate fidelity in the presence of decoherence is also estimated.
Geometric phase is a promising element to induce high-fidelity and robust quantum operations due to its built-in noise-resilience feature. Unfortunately, its practical applications are usually circumscribed by requiring complex interactions among multiple levels or qubits and a longer gate time than the corresponding dynamical ones. Here, we propose a general framework of geometric quantum computation with the integration of the time-optimal control technique, where the shortest smooth geometric path is found to realize accelerated geometric quantum gates and thus greatly decreases the gate errors induced by both the decoherence effect and operational imperfections. Meanwhile, we faithfully implement our idea on a scalable platform of a two-dimensional superconducting transmon-qubit lattice, with simple and experimentally accessible interactions. In addition, numerical simulations show that our implemented geometric gates possess higher fidelities and stronger robustness, which outperform the best performance of the corresponding dynamical ones. Therefore, our scheme provides a promising alternative route toward scalable fault-tolerant solid-state quantum computation.
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.
Quantum computation (QC) relies on the ability to implement high-fidelity quantum gate operations and successfully preserve quantum state coherence. One of the most challenging obstacles for reliable QC is overcoming the inevitable interaction between a quantum system and its environment. Unwanted interactions result in decoherence processes that cause quantum states to deviate from a desired evolution, consequently leading to computational errors and loss of coherence. Dynamical decoupling (DD) is one such method, which seeks to attenuate the effects of decoherence by applying strong and expeditious control pulses solely to the system. Provided the pulses are applied over a time duration sufficiently shorter than the correlation time associated with the environment dynamics, DD effectively averages out undesirable interactions and preserves quantum states with a low probability of error, or fidelity loss. In this study various aspects of this approach are studied from sequence construction to applications of DD to protecting QC. First, a comprehensive examination of the error suppression properties of a near-optimal DD approach is given to understand the relationship between error suppression capabilities and the number of required DD control pulses in the case of ideal, instantaneous pulses. While such considerations are instructive for examining DD efficiency, i.e., performance vs the number of control pulses, high-fidelity DD in realizable systems is difficult to achieve due to intrinsic pulse imperfections which further contribute to decoherence. As a second consideration, it is shown how one can overcome this hurdle and achieve robustness and recover high-fidelity DD in the presence of faulty control pulses using Genetic Algorithm optimization and sequence symmetrization. Thirdly, to illustrate the implementation of DD in conjunction with QC, the utilization of DD and quantum error correction codes (QECCs) as a protection method for adiabatic quantum computing (AQC) is discussed. A performance comparison between two deterministic DD schemes is given, where preference towards one particular method is found due to sequence structure and procedure from which higher accuracy sequences are generated.
Recently, it has been proposed to perform quantum computation through the Berry phase (adiabatic cyclic geometric phase) shift with NMR. This geometric quantum gate will hopefully be fault tolerant to certain types of error because of the geometric property of the Berry phase. Here we give a scheme to realize the NMR C-NOT gate through the Aharonov-Anandan phase (non-adiabatic cyclic phase) shift on the dynamic phase free evolution loop. In our scheme, the gate is run non-adiabatically, thus it is less affected by the decoherence. Moreover, in the scheme we have chosen the zero dynamic phase time evolution loop in obtaining the geometric phase shift; we need not perform any extra operation to cancel the dynamic phase.