Composite nonadiabatic geometric quantum gates with optimization on superconducting circuits

Cheng-Yun Ding , Wan-Fang Liu , Li-Hua Zhang , Jian Zhou , Zheng-Yuan Xue

Front. Phys. ›› 2026, Vol. 21 ›› Issue (9) : 093203

PDF (2663KB)
Front. Phys. ›› 2026, Vol. 21 ›› Issue (9) :093203 DOI: 10.15302/frontphys.2026.093203
RESEARCH ARTICLE

Composite nonadiabatic geometric quantum gates with optimization on superconducting circuits

Author information +
History +
PDF (2663KB)

Abstract

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.

Graphical abstract

Keywords

quantum computation / quantum optimization / superconducting quantum circuits

Cite this article

Download citation ▾
Cheng-Yun Ding, Wan-Fang Liu, Li-Hua Zhang, Jian Zhou, Zheng-Yuan Xue. Composite nonadiabatic geometric quantum gates with optimization on superconducting circuits. Front. Phys., 2026, 21(9): 093203 DOI:10.15302/frontphys.2026.093203

登录浏览全文

4963

注册一个新账户 忘记密码

1 Introduction

Using quantum error correction codes to achieve logical quantum gates with lower errors is a crucial step in the realization of universal quantum computing, and it has been experimentally achieved the break-even point [1, 2]. However, higher quantum gate-fidelity is more desirable, as it needs fewer physical qubits for error correction, significantly reducing resource requirements, especially in the current era. Therefore, achieving high-fidelity quantum gates on physical qubits is essential for the implementation of scalable universal quantum computing.

During the past decades, geometric quantum computing (GQC) has made significant strides as a robust computational strategy, both theoretically [35] and experimentally [612]. Its use of geometric phases [13, 14] to construct quantum gates inherently resists local operation errors, as these phases depend only on the global properties of the evolution path rather than details of the evolution. Early GQC relied on adiabatic geometric phases, such as the Berry phase [13], which required the system to evolve slowly enough to ensure that the evolution states remain in certain instantaneous energy eigenstates without undergoing mutual transitions, exacerbating the impact of environmental noise on the quantum gate. However, slow evolution will lead to more decoherence-induced errors. To address this, nonadiabatic GQC (NGQC), based on nonadiabatic geometric phases [14], has been introduced [15, 16], significantly accelerating quantum gate operations.

In particular, the NGQC scheme based on the orange-slice-shaped single-loop evolution path has been theoretically proposed [17, 18] and experimentally verified [10, 11], which further reduces the gate operation time. Subsequently, to enhance gate performance beyond dynamical quantum gates, various optimization schemes have been proposed, including the combination of various techniques such as composite pulses [1922], dynamical correction [2325], path optimization [2631], shortcut to adiabaticity [32, 33], optimal control [3437], and dynamical decoupling [38]. Most of these schemes can only resist one of the two typical types of errors, i.e., Rabi frequency and detuning errors, denoted as X and Z errors, rather than both. Although the globally robust scheme [36] can be achieved by finely controlling the pulse waveform, complex pulse waveforms are not user-friendly in experiments. Note that, conventional composite nonadiabatic geometric quantum gates (CNGQGs) [18, 20] have no restrictions on the pulse waveform for given amplitude peak, and it has two different robust path configurations, namely “Path A” and “Path B”, which can resist X and Z errors, respectively [19, 20]. That is, a certain path configuration can resist errors in a certain direction but exhibit the converse effect on the other one.

To overcome this dilemma, we here propose a scheme for optimized CNGQGs (OCNGQGs). By optimizing the path parameter, our scheme can not only achieve stronger gate robustness against errors in a particular direction, but also realize nonadiabatic geometric gates that can simultaneously resist errors in both directions. Besides, we propose to implement our scheme on superconducting transmon qubits. Numerically simulation of the gate performance demonstrates the significant advantages of our scheme compared with others. Thus, our scheme provides a promising way to implement more robust quantum gates, which is essential for future scalable quantum computation.

2 Optimized composite nonadiabatic geometric quantum gates

In this section, we first present our optimized scheme for NGQGs, and then compare the gate performance of our scheme with other ones.

2.1 The gate construction

Consider an ideal two-level system encoded as computational bases |0 and |1, as shown in Fig. 1(a), then the resonant Hamiltonian driven by an external microwave field, under the rotating framework, can be expressed as

H1(t)=Ω(t)2(cosϕσx+sinϕσy),

where Ω(t) is the Rabi frequency and ϕ is the phase of driving microwave field, and σx and σy are well-known Pauli operators. Consider a set of orthogonal dressed-states of system |ψ±(t) as evolution states, expressed as

|ψ+(t)=eif(t)[cosα(t)2|0+sinα(t)2eiβ(t)|1],|ψ(t)=eif(t)[sinα(t)2eiβ(t)|0cosα(t)2|1],

whose corresponding evolution path on the Bloch sphere can be determined by the time-dependent polar angle α(t) and azimuthal angle β(t). And, f(t) is the global phase, which cannot be visualized on the Bloch sphere.

According to the Schrödinger equation i|ψ˙±(t)=H1(t)|ψ±(t), the relationship between the Hamiltonian parameters Ω(t), ϕ and the parameters α(t), β(t) of the evolution path can be obtained as follows

α˙(t)=Ω(t)sin[ϕβ(t)],β˙(t)=Ω(t)cotα(t)cos[ϕβ(t)].

Based on this, we can solve the Hamiltonian parameters in reverse according to the path parameters, that is, we can choose an appropriate evolution path to reversely engineer the Hamiltonian parameters meeting specific conditions. Consequently, when the evolution states complete any cyclic evolution with a period of time τ, on the Bloch sphere, they will become |ψ±(τ)=U(τ)|ψ±(0)=eif(τ)|ψ±(0), and the corresponding evolution operator can be calculated as

U(τ)=j=±eif(τ)|ψj(0)ψj(0)|=eif(τ)nσ,

in which f(τ) is the accumulated total phase during the entire evolution process, with an initial value of 0 and its dynamics cannot be visualized on the Bloch sphere. Note that, f(τ) includes two components, i.e., the dynamical and geometric phases. They can be calculated, respectively, as

γd=0τψ+(t)|H1(t)|ψ+(t)dt=120τβ˙(t)sinα(t)tanα(t)dt,γg=i0τψ+(t)|t|ψ+(t)dt=120τβ˙(t)[1cosα(t)]dt.

Furthermore, n=(sinα0cosβ0,sinα0sinβ0,cosα0) is a unit vector for any direction with α0 and β0 being the initial polar and azimuth angles, respectively, and σ=(σx,σy,σz) is the unit Pauli vector. Thus, U(τ) denotes a single-qubit gate that rotates around an arbitrary axis n by an angle of 2f(τ).

Here, to obtain quantum gates with pure geometric phases, we choose a composite evolution path, which is divided into seven stages. That is, the first three stages are that the evolution state |ψ+(t) starts from the initial point A in the Bloch sphere, and then follows the meridian AB to the North pole B, and follow another meridian BCD to South pole D and finally run back the starting point along the meridian DA; the last four ones follow the meridians AB, BED, DFB and BA, respectively, i.e., the entire evolution path is ABBCDDAABBEDDFBBA, as shown in Fig. 1(b). It can be seen that both orange-sliced paths have an inner angle of γg/2, which can also be set to πγg/2. Therefore, the former is called “Path A”, and the latter as “Path B”, detailed discussion of the path configurations is presented in Appendix A. According to the reverse design above, the Hamiltonian parameters of the system are correspondingly set as

0τ1Ω(t)dt=α0,ϕ1=β0π2,t[0,τ1],τ1τ2Ω(t)dt=π,ϕ2=β0γg2+π2,t[τ1,τ2],τ2τ3Ω(t)dt=πα0,ϕ3=β0π2,t[τ2,τ3],τ3τ4Ω(t)dt=α0,ϕ4=β0π2,t[τ3,τ4],τ4τ5Ω(t)dt=π,ϕ5=β0+k+π2,t[τ4,τ5],τ5τ6Ω(t)dt=π,ϕ6=β0+k+γg2π2,t[τ5,τ6],τ6τΩ(t)dt=α0,ϕ7=β0+π2,t[τ6,τ].

After completing a cyclic evolution with period τ, the evolution operator can be calculated as

U(τ)=U(τ,τ6)U(τ6,τ5)U(τ5,τ4)U(τ4,τ3)U(τ3,τ2)U(τ2,τ1)U(τ1,0)=cosγgIisinγg(cosα0sinα0eiβ0sinα0eiβ0cosα0),=eiγgnσ,

which can lead to the universal set of single-qubit quantum gates. As the evolution path always follows the meridian, the corresponding dynamical phases remain zero throughout the process, and the remaining phase γg of f(τ) is the geometric one and U(τ) is the geometric gate. Notice that, the path parameter k corresponds to the angle between the DAB and BED meridians, and it can be an arbitrary constant within the interval [0,2π]. From Fig. 1(b), we can see that the orange-sliced path consisted of meridians BED and DFB rotates anticlockwise as k increases, and will coincide with the other orange-sliced path consisted of meridians BCD and DAB at k=2πγg/2. Finally, when k=2π, it can complete a cycle. Clearly, a different selection of the path parameter k will correspond to different composite evolution paths, which usually possess various error sensitivity properties. Thus, it can be adjusted to achieve OCNGQGs with stronger robustness.

To search for the optimal parameter k under noisy condition, we here consider two typical types of errors, i.e., the X and Z errors, to evaluate the infidelity of target quantum gates. Then, the noisy Hamiltonian can be written as

H1(t)=δΩm2σz+1+ϵ2Ω(t)(cosϕσx+sinϕσy),

where ϵ and δ are the ratios of X and Z errors, respectively, and Ωm is the maximum of the Ω(t). The dynamical process of the quantum system is modeled and simulated by the Lindblad master equation [39] of

ρ˙1(t)=i[ρ1(t),H1(t)]+12m=z,κmL(Am),

in which ρ1(t) is the density operator of the total quantum system driven by the noisy Hamiltonian H1(t); L(A)=2Aρ1AAAρ1ρ1AA is the Lindblad operator for A; Az=|00||11|; A=|01|; and κz, κ are the dephasing and decay rates, respectively.

In addition, the gate fidelity can be defined as [40, 41]

F=16m=16ψm(0)|U(τ)ρ1(τ)U(τ)|ψm(0),

with the initial state |ψm(0) being any element in the set {|0,|1,(|0+i|1)/2,(|0i|1)/2,(|0+|1)/2,(|0|1)/2}. These six initial states are sufficient to accurately evaluate any single qubit gate, as they form a set of over-complete bases in two-dimensional space. The influence of quantum gates on any two-dimensional initial state can be decomposed into their effects on these three directional axis states. First, without decoherence errors, i.e., κz=κ=0, we take the phase (S) and Hadamard (H) gates as two typical examples, corresponding to (α0,β0,γg)=(0,0,π/4) and (α0,β0,γg)=(π/4,0,π/2), and test the corresponding gate fidelities as a function of the optimized parameter k under these two typical errors, respectively. As shown in Fig. 2, the fidelities of the target S or H gates vary across the parameter interval, indicating different sensitivity to errors for different k values. For instance, for geometric S gate, the gate robustness against these errors is slightly decreased at k[0,0.13π], and it continues to increase and decrease at k[0.13π,1.13π] and k[1.13π,2π], respectively. The situation for the geometric H gate is similar. This allows us to identify the optimal k to implement more robust geometric gates. Here, the optimal values k are listed in Table 1, which are those against the X error, the Z error, and both errors, respectively. When k=2πγg/2, our optimized composite geometric paths will reduce to conventional composite geometric schemes. For example, for the S gate (γg=π/4), the path parameter k=1.875π, while it is k=1.75π for the H gate with geometric phase γg being π/2. Besides, Fig. 2 also shows these parameters is not optimal settings against various errors, confirming the effectiveness of our optimized scheme for more robust geometric gates. Furthermore, note that the pulse waveform is set as square wave Ω(t)=Ωm=Ω and ϵ=δ=0.1 for demonstration purposes in Fig. 2.

2.2 The gate robustness

In the subsection, based on these optimal parameters, we will compare the robustness of our OCNGQGs against certain errors with those of conventional CNGQGs [18, 20], NGQGs [10, 17] and dynamical gates (DGs) [42]. Notably, NGQGs within the orange-slice-shaped evolution path have two configurations, “Path A” and “Path B”, which can resist X and Z errors, respectively. CNGQGs also exhibit two configurations by repeating the original path twice, enhancing robustness against individual errors. The constructions for geometric and dynamical gates are detailed in Appendix B and Appendix C, respectively. Our OCNGQGs follow a similar approach but can resist both X and Z errors at their optimal parameters k. For demonstration, we use “Path A” for OCNGQGs in the main text, while “Path B” is described in Appendix A.

As shown in Fig. 3, we have plotted the curves depicting how the infidelity of S and H quantum gates changes with error rates ϵ or δ, based on three geometric schemes and the dynamical scheme. Specifically, Figs. 3(a) and (c) illustrate that our optimized composite geometric scheme for S and H gates with “Path A” are more robust against X error compared to CNGQGs and NGQGs within “Path A”, and the corresponding DGs. Conversely, for Z errors, Figs. 3(b) and (d) demonstrate that our scheme also offers significant advantages over CNGQGs and NGQGs within “Path B”, and corresponding DGs.

Given that the gate times of our OCNGQGs are at least twice as long as those of conventional NGQGs, the decoherence effect cannot be ignored. Consider the decoherence rates κz=κ=Ωm/104 and the pulse shape Ω(t)=Ωmsin2(πt/τ), in Figs. 4 and 5, we present the gate-fidelity variations of S and H gates under both X and Z noises, respectively, based on six different schemes including our OCNGQG, CNGQG and NGQG within “Path A” [18], CNGQG and NGQG within “Path B” [20], and DG [42] schemes. By comparing all the subgraphs in Fig. 4, it is evident that our geometric S gate is more robust than others in resisting X and Z errors simultaneously under decoherence. However, we can find, by comparing Figs. 4(b) and (e), the composite geometric scheme based on “Path A” can effectively enhance the robustness against X error but weaken the one against Z error. This is consistent with the study in Ref. [18]. Similarly, the composite geometric scheme based on “Path B” can enhance the robustness against Z error but weaken that for X error [20], as seen in Figs. 4(c) and (f). The results in Fig. 5 demonstrate a similar conclusion that the robustness of our scheme for the H gate can outperform other schemes overall. But, the robustness advantage is not obvious compared with the S gate in Fig. 4. The reason is that the optimal k value for resisting X and Z errors is not consistent for the H gate, as shown in Table 1, resulting in the optimal k value not being truly optimal for X or Z errors when considering both types of errors simultaneously. In addition, due to the longer evolution time of the H gate comparing with the S gate, they are also susceptible to more decoherence effects, leading to a decrease in gate fidelity. Furthermore, the optimal path parameters k used here are still the same as in Table 1, as different choices of k values do not change the entire length of the evolution path. That is, k only relates to specific systematic errors instead of specific system parameters.

3 Physical implementation

In this section, we propose to implement the above scheme on superconducting quantum circuits, which includes the cases for both single-qubit gates and a nontrivial two-qubit gate with current superconducting quantum control techniques.

3.1 Single-qubit gates

Consider a superconducting transmon qubit, the energy spectrum of which is shown in Fig. 6(a). It is driven by a microwave field, and the full Hamiltonian can be given by

H0(t)=l=1+{lωl(l1)2α|ll|+[l2ΩR(t)|l1l|ei(ωdtϕ)+H.c.]},

where ω and α are the qubit frequency and anharmonicity of the transmon, ΩR(t), ωd and ϕ are the amplitude, frequency and phase of the microwave field, respectively. As transmons have weak anharmonicity, we could suppress the information leakage from the computational subspace by utilizing derivative removal via adiabatic gate (DRAG) technology [43, 44]. That is, the ΩR(t) is set as ΩR(t)=Ω(t)iΩ˙(t)/2α with Ω(t)=Ωmsin2(πt/τ) being the experiment-friendly original pulse. Additionally, the original Hamiltonian H0(t) is rotated into a frame with respect to the driving frequency ωd with R=eiωdtl=1+l|ll|, where a resonant condition ω=ωd is assumed. Then, the reduced Hamiltonian in the computational subspace {|0,|1} takes the same form as Eq. (1). Thus, by setting the same parameter constraints as in Eq. (6), the OCNGQGs can be obtained.

Similarly, we numerically simulate the gate performance by the Lindblad master equation, which takes the same form as in Eq. (9), except for changing H1(t) to H0(t), in order to fully describe the dynamical process of the transmon. Here, Az=l=1+l|ll| and A=l=1+l|l1l|, and Ωm=2π×60 MHz, α=2π×320 MHz and the decoherence rates κz=κ=2π×2 kHz are within the current available parameter range [45, 46]. We take the S gate as an example and test its robustness for different schemes, and the X and Z errors are set as Ω(t)(1+ϵ)Ω(t) and δΩm(|11|+2|22|), respectively. As shown in Fig. 7, at the optimal parameter k1.13π, the robustness of S gate based on our scheme is significantly better than the other five schemes, resisting X and Z errors simultaneously under decoherence. Furthermore, since the robustness of the H gate with transmon is almost the same as that in Fig. 5, it is not shown here. The performance comparison of these schemes is listed in Table 2. It can be found that our scheme possesses much stronger gate robustness against various errors under decoherence, despite the longer gate duration. Moreover, it can be predicted that with the further increase of coherence time, the robustness of our scheme will be stronger.

In addition, in our simulations, the pulse shape can be arbitrary under a device-limited peak, and thus we can set them in an experimentally friendly way. Meanwhile, we also utilize the DRAG technology to suppress the leakage errors from non-computational subspaces for high gate fidelity. So, our scheme is feasible in realistic superconducting systems. Besides, our scheme is also compatible with more complex pulse waveforms. That is, it can be further combined with pulse-shaping techniques to improve gate fidelity and robustness.

3.2 A nontrivial two-qubit gate

To achieve universal quantum computing, in addition to a set of universal single-qubit quantum gates, a nontrivial two-qubit quantum gate is also required. Here, we construct an optimized composite controlled-phase (CP) gate based on two capacitive coupled transmons, as shown in Fig. 6(b). The system Hamiltonian can be expressed as

H12(t)=j=12l=1+[ωjll(l1)2αj|ljl|]+g12(σ1σ2+H.c.),

in which σj=l=0+l+1|ljl+1| is the lowering operator for the (l+1)-th energy level of transmon Tj; ωj, αj denote the transition frequency and inherent anharmonicity of Tj, respectively; g12 is the fixed interaction strength between T1 and T2 when their transition frequencies are constant. To achieve parametric controllable coupling [4749], we apply an ac microwave driving on T2 to modify its transition frequency to be time-dependent, i.e., ω2(t)=ω2+βνsin(νt+η), where ν, η, and βν are the frequency, phase and amplitude of the driving field, respectively, with β being an dimensionless parameter. By this way, in the interaction picture, the interaction Hamiltonian between the two coupled transmons is

H12(t)=g12{[|101201|eiΔt+2|201211|ei(Δα1)t+2|111202|ei(Δ+α2)t]eiβcos(νt+η)+H.c.},

where Δ=ω1ω2 is the detuning between transition frequencies of T1 and T2, respectively. To derive the effective Hamiltonian in the two-qubit subspace {|11,|02}, we approximate Eq. (13) using the Jacobi−Anger identity of exp[iβcos(νt+η)]=n=+inJn(β)exp[in(νt+η)], with Jn(β) being Bessel functions of the first kind. When adjusting the driving frequency ν to satisfy ν=Δ+α2 and neglecting the high-frequency oscillation terms, the effective Hamiltonian can be calculated as

Heff(t)=geff2[cos(ηπ2)σ~x+sin(ηπ2)σ~y],

where the effective coupling geff=22g12J1(β) can be adjusted by the parameter β, and σ~x and σ~y are Pauli matrices in subspace {|11,|02}. It is evident that the form of Heff(t) matches that of H1(t) in Section 2.1. Therefore, we can implement the optimized composite geometric two-qubit CP gates. Specifically, the state |11 can accumulate a pure geometric phase γg via the application of optimized composite geometric pulses. The implemented CP gates, in the two-qubit computational subspace {|00,|01,|10,|11}, is

U(τ)=diag(1,1,1,eiγg).

To fully demonstrate the performance of the geometric CP gates, we use γg=π/2 as an example, and numerically simulate it using a two-qubit Lindblad master equation of

ρ˙2(t)=i[ρ2(t),H12(t)]+12j=12m=z,κmjL(Amj),

where Aj=l=1+l|l1jl| and Azj=l=1+l|ljl|, and κzj and κj are the dephasing and decay rates of the transmon Tj, respectively. Besides, the gate fidelity for two-qubit case can be also defined as F=(1/16)m=116ψm(0)|U(τ)ρ2(τ)U(τ)|ψm(0) with ρ2(t) being the density matrix for two qubits. Furthermore, |ψm(0)=|ψm1(0)|ψm2(0) is set as the initial state, with |ψmj(0) (j=1,2) belonging to single-qubit set of {|0,|1,(|0i|1)/2,(|0+|1)/2}.

Under the optimal path parameter k1.27π, we set reasonable experimental parameters g12=2π×10 MHz, α1=2π×320 MHz, α2=2π×300 MHz and κz1=κz2=κ1=κ2=2π×2 kHz [45], and test the gate fidelity as a function of parameters Δ and β in Fig. 8(a). We find that the optimal parameters are around Δ=2π×594MHz and β=1.8. The corresponding CP gate fidelity can reach 99.70%, whose dynamics is shown in Fig. 8(b). Moreover, in Fig. 8(b), we also plot the impact of high-order oscillating terms errors and decoherence effect on the fidelity of the two-qubit gate, respectively. It can be observed that the infidelity arises from both approximately attributing 0.13% and 0.17%, respectively. In addition, as shown in Fig. 9(a), we also test the robustness of the CP gate against both X and Z errors, and compare it with other schemes in Figs. 9(b)−(d). Figure 9 shows that our scheme is significantly superior to other three ones. Note that, the X and Z errors for two-qubit case are considered as g12(1+ϵ)g12 and ΔΔ+δg12, respectively. In Table 2, we give the CP gate performance indicators of different schemes. Through comparison, we find that our scheme has a longer gate time than schemes of NGQGs and DGs, but the gate robustness is the best among all schemes.

In addition, for γg=π/2, due to the fact that conventional composite geometric CP gate within “Path B” has the same evolution path for one within “Path A”, while geometric CP within “Path B” and the one within “Path A” differ by a negative sign on state |11, which results in different quantum gates, only the path configuration A is shown in Fig. 9.

4 Conclusion

In summary, we have developed a novel scheme for OCNGQGs using the superconducting transmon systems. This approach extends conventional composite geometric schemes and addresses their limitation of suppressing error in only one direction. By optimizing the path parameter k, our solution can resist noise sources in specific directions and simultaneously in two directions. Numerical simulations show that our scheme outperforms conventional composite and single-loop geometric schemes, as well as corresponding dynamical ones, in resisting X and Z errors simultaneously. Additionally, our optimization scheme can be naturally extended to the two-qubit scenario, with similar simulation results verified. Thus, our protocol offers a new optimization method for conventional composite geometric scheme, making it more promising to achieve robust quantum gates for future scalable quantum computation.

5 Appendix A: The OCNGQG scheme for Path B

In addition to enabling OCNGQCs under the Path A, our solution can also be implemented through Path B. Specifically, as illustrated in Fig. A1(a), the evolution trajectory is also divided into seven parts, and follows the loop of ABBCDDAABBEDDFBBA. Unlike Path A, the inner angles for two orange-petal paths are both πγg/2 instead of γg/2, and the angle between them is the optimized parameter k. Based on Eq. (3), the Hamiltonian parameters need to be set as

{ϕ2ϕ2=β0γg2π2,ϕ5ϕ5=β0k+π2,ϕ6ϕ6=β0k+γg2+π2,

with other parameters being the same as Eq. (6). The obtained evolution operator is eiγgnσ, coincides with that of Path A.

Similarly, we can numerically determine the optimal path parameter k for X and Z errors. In Figs. A1(b)−(e), we compare the robustness of our S and H gates with that of three other schemes under X and Z errors, respectively, where the rates of decoherence and errors are set as κz=κ=Ωm/104 and ϵ,δ[0.1,0.1]. It can be observed from Figs. A1(b) and (c) that our optimized geometric S gate, with k1.87π, exhibits significantly enhanced robustness compared to other schemes in terms of X or Z errors, despite having a longer gate time than the corresponding conventional NGQG and DG. For our H gate, it maintains a clear advantage over other schemes in resisting X errors while retaining an overall advantage in resisting Z errors, as illustrated in Figs. A1(d) and (e). Notably, the optimal k values at this point can be searched for separately, yielding 1.67π and 0.27π, respectively.

6 Appendix B: The construction of NGQGs and CNGQGs

Conventional NGQGs are based on the orange-slice-shaped single-loop evolution path [17, 18], which are divided into three segments. Note that the form of system Hamiltonian is the same as that in Eq. (1), then the corresponding parameters of driving microwave pulses need to meet the requirements of

0τ1Ω(t)dt=α0,ϕ1=β0π2,t[0,τ1],τ1τ2Ω(t)dt=π,ϕ2=β0γg+π2,t[τ1,τ2],τ2τΩ(t)dt=πα0,ϕ3=β0π2,t[τ2,τ].

Hence, the evolution operator at the final time τ is

U(τ)=U(τ,τ2)U(τ2,τ1)U(τ1,0)=eiγgnσ,

which is aligns with Eq. (7) in the main text, indicating that any single-qubit quantum gate can be implemented. Furthermore, the evolution loop consists solely of meridians, leading to β˙(t)=0. Consequently, the dynamical phase is consistently zero, and U(τ) is a pure geometric quantum gate. We call it as NGQGs within Path A, whose inner angle of orange-slice-shaped trajectory is the geometric phase γg. Contrarily, if the inter angle is πγg, we call it as NGQGs within Path B, necessitating an adjustment of the pulse phase of the second segment to β0γgπ/2. Then, the corresponding evolution operator is U(τ)=eiγgnσ, equals to U(τ) in Path A.

For conventional CNGQGs with two distinct path configurations, we adopt NQGQs with Path A U1(γc) or Path B U2(γc) as building blocks, iteratively cascading them n times. This iteration corresponds to the repetition of the evolution loop n times. By this way, the CNGQGs can be obtained as

Ucx(γg)=[Ux(γc)]n=[(1)x+1eiγcnσ]n,

where x=1,2 corresponds CNGQGs within Path A and Path B, respectively, and γc=γg/n. Specifically, we take two-loop CNGQGs as an example, which is adopted in the main text. The Hamiltonian remains identical to H1(t), and the required parameter settings for Path A are

0τ1Ω(t)dt=α0,ϕ1=β0π2,t[0,τ1],τ1τ2Ω(t)dt=π,ϕ2=β0γg2+π2,t[τ1,τ2],τ2τ3Ω(t)dt=πα0,ϕ3=β0π2,t[τ2,τ3].τ3τ4Ω(t)dt=α0,ϕ4=β0π2,t[τ3,τ4],τ4τ5Ω(t)dt=π,ϕ5=β0γg2+π2,t[τ4,τ5],τ5τΩ(t)dt=πα0,ϕ6=β0π2,t[τ5,τ].

As a result, the evolution operator can be calculated as

Uc1(τ)=eiγg2nσeiγg2nσ=eiγgnσ.

In contrast, for the two-loop CNGQGs within Path B, only ϕ2 and ϕ5 in Eq. (B4) need to be adjusted to β0γg/2π/2, yielding the same evolution operator Uc2(τ)=eiγg2nσeiγg2nσ=eiγgnσ. By adopting the same parameters α0, β0 and γg as specified in the main text, the corresponding geometric S and H gates can be obtained.

7 Appendix C: The dynamical gates

To construct the universal single-qubit dynamical gates, we start the Hamiltonian Hd(t) driven by a resonant microwave field, whose form is the same as that in Eq. (1), i.e.,

Hd(t)=Ωd(t)2[cosϕd(t)σx+sinϕd(t)σy].

Here, we set ϕd(t)ϕd being a constant to ensure these gates being pure dynamical gates. Thus, after an evolution period τ, the evolution operator can be calculated as

Ud(χd,ϕd)=ei0τHd(t)dt=(cos(χd2)isin(χd2)eiϕdisin(χd2)eiϕdcos(χd2)),

with the pulse area χd=0τΩd(t)dt. By setting appropriate parameters, dynamical S and H gates can be constructed, respectively, as

S=Ud(π2,π)Ud(π2,3π2)Ud(π2,0),H=Ud(π,0)Ud(π2,π2).

References

[1]

V. V. Sivak , A. Eickbusch , B. Royer , S. Singh , I. Tsioutsios , S. Ganjam , A. Miano , B. Brock , A. Ding , L. Frunzio , S. M. Girvin , R. J. Schoelkopf , and M. H. Devoret , Real-time quantum error correction beyond break-even, Nature 616(7955), 50 (2023)

[2]

Z. Ni , S. Li , X. Deng , Y. Cai , L. Zhang , W. Wang , Z. B. Yang , H. Yu , F. Yan , S. Liu , C. L. Zou , L. Sun , S. B. Zheng , Y. Xu , and D. Yu , Beating the break-even point with a discrete-variable-encoded logical qubit, Nature 616(7955), 56 (2023)

[3]

A. Ekert , M. Ericsson , P. Hayden , H. Inamori , J. A. Jones , D. K. Oi , and V. Vedral , Geometric quantum computation, J. Mod. Opt. 47(14−15), 2501 (2000)

[4]

J. Zhang , T. H. Kyaw , S. Filipp , L. C. Kwek , E. Sjöqvist , and D. Tong , Geometric and holonomic quantum computation, Phys. Rep. 1027, 1 (2023)

[5]

Y. Liang , P. Shen , T. Chen , and Z. Y. Xue , Nonadiabatic holonomic quantum computation and its optimal control, Sci. China Inf. Sci. 66(8), 180502 (2023)

[6]

J. A. Jones , V. Vedral , A. Ekert , and G. Castagnoli , Geometric quantum computation using nuclear magnetic resonance, Nature 403(6772), 869 (2000)

[7]

J. M. Jr Abdumalikov , K. Fink , M. Juliusson , S. Pechal , A. Berger , A. Wallraff , and S. Filipp , Experimental realization of non-Abelian non-adiabatic geometric gates, Nature 496(7446), 482 (2013)

[8]

C. Zu , W. B. Wang , L. He , W. G. Zhang , C. Y. Dai , F. Wang , and L. M. Duan , Experimental realization of universal geometric quantum gates with solid-state spins, Nature 514(7520), 72 (2014)

[9]

Y. Y. Huang , Y. K. Wu , F. Wang , P. Y. Hou , W. B. Wang , W. G. Zhang , W. Q. Lian , Y. Q. Liu , H. Y. Wang , H. Y. Zhang , L. He , X. Y. Chang , Y. Xu , and L. M. Duan , Experimental realization of robust geometric quantum gates with solid-state spins, Phys. Rev. Lett. 122(1), 010503 (2019)

[10]

Y. Xu , Z. Hua , T. Chen , X. Pan , X. Li , J. Han , W. Cai , Y. Ma , H. Wang , Y. Song , Z. Y. Xue , and L. Sun , Experimental implementation of universal nonadiabatic geometric quantum gates in a superconducting circuit, Phys. Rev. Lett. 124(23), 230503 (2020)

[11]

P. Zhao , Z. Dong , Z. Zhang , G. Guo , D. Tong , and Y. Yin , Experimental realization of nonadiabatic geometric gates with a superconducting Xmon qubit, Sci. China Phys. Mech. Astron. 64(5), 250362 (2021)

[12]

K. Xu , W. Ning , X. J. Huang , P. R. Han , H. Li , Z. B. Yang , D. Zheng , H. Fan , and S. B. Zheng , Demonstration of a non- Abelian geometric controlled-NOT gate in a superconducting circuit, Optica 8(7), 972 (2021)

[13]

M. V. Berry , Quantal phase factors accompanying adiabatic changes, Proc. R. Soc. Lond. A 392(1802), 45 (1984)

[14]

Y. Aharonov and J. Anandan , Phase change during a cyclic quantum evolution, Phys. Rev. Lett. 58(16), 1593 (1987)

[15]

X. B. Wang and M. Keiji , Nonadiabatic conditional geometric phase shift with NMR, Phys. Rev. Lett. 87(9), 097901 (2001)

[16]

S. L. Zhu and Z. Wang , Implementation of universal quantum gates based on nonadiabatic geometric phases, Phys. Rev. Lett. 89(9), 097902 (2002)

[17]

P. Zhao , X. D. Cui , G. Xu , E. Sjöqvist , and D. Tong , Rydberg-atom-based scheme of nonadiabatic geometric quantum com- putation, Phys. Rev. A 96(5), 052316 (2017)

[18]

T. Chen and Z. Y. Xue , Nonadiabatic geometric quantum computation with parametrically tunable coupling, Phys. Rev. Appl. 10(5), 054051 (2018)

[19]

Z. Zhu , T. Chen , X. Yang , J. Bian , Z. Y. Xue , and X. Peng , Single-loop and composite-loop realization of nonadiabatic holonomic quantum gates in a decoherence-free subspace, Phys. Rev. Appl. 12(2), 024024 (2019)

[20]

J. Zhou , S. Li , G. Z. Pan , G. Zhang , T. Chen , and Z. Y. Xue , Nonadiabatic geometric quantum gates that are insensitive to qubit-frequency drifts, Phys. Rev. A 103(3), 032609 (2021)

[21]

Y. Liang , P. Shen , T. Chen , and Z. Y. Xue , Composite short-path nonadiabatic holonomic quantum gates, Phys. Rev. Appl. 17(3), 034015 (2022)

[22]

Z. Y. Fang , H. Xu , T. Chen , K. Wei , and C. Zhang , Nonadiabatic geometric quantum gates by composite pulses based on superconducting qubits, Phys. Rev. A 109(4), 042615 (2024)

[23]

S. Li and Z. Y. Xue , Dynamically corrected nonadiabatic holonomic quantum gates, Phys. Rev. Appl. 16(4), 044005 (2021)

[24]

M. J. Liang and Z. Y. Xue , Robust nonadiabatic geometric quantum computation by dynamical correction, Phys. Rev. A 106(1), 012603 (2022)

[25]

C. Y. Ding , L. Chen , L. H. Zhang , and Z. Y. Xue , Dynamical-corrected nonadiabatic geometric quantum computation, Front. Phys. (Beijing) 18(6), 61304 (2023)

[26]

K. Li , P. Zhao , and D. Tong , Approach to realizing nonadiabatic geometric gates with prescribed evolution paths, Phys. Rev. Res. 2(2), 023295 (2020)

[27]

C. Y. Ding , L. N. Ji , T. Chen , and Z. Y. Xue , Path-optimized nonadiabatic geometric quantum computation on superconducting qubits, Quantum Sci. Technol. 7(1), 015012 (2022)

[28]

T. Chen , J. Q. Hu , C. Zhang , and Z. Y. Xue , Universal robust geometric quantum control via geometric trajectory correction, Phys. Rev. Appl. 22(1), 014060 (2024)

[29]

Y. Liang and Z. Y. Xue , Nonadiabatic geometric quantum gates with on-demand trajectories, Phys. Rev. Appl. 21(6), 064048 (2024)

[30]

Q. X. Lv , Z. T. Liang , H. Z. Liu , J. H. Liang , K. Y. Liao , and Y. X. Du , Noncyclic geometric quantum computation with shortcut to adiabaticity, Phys. Rev. A 101(2), 022330 (2020)

[31]

Z. Ma , J. Xu , T. Chen , Y. Zhang , W. Zheng , S. Li , D. Lan , Z. Y. Xue , X. Tan , and Y. Yu , Noncyclic nonadiabatic geometric quantum gates in a superconducting circuit, Phys. Rev. Appl. 20(5), 054047 (2023)

[32]

L. Qiu , H. Li , Z. Han , W. Zheng , X. Yang , Y. Dong , S. Song , D. Lan , X. Tan , and Y. Yu , Experimental realization of non-cyclic geometric gates with shortcut to adiabaticity in a super- conducting circuit, Appl. Phys. Lett. 118(25), 254002 (2021)

[33]

S. Li , P. Shen , T. Chen , and Z. Y. Xue , Noncyclic nonadiabatic holonomic quantum gates via shortcuts to adiabaticity, Front. Phys. (Beijing) 16(5), 51502 (2021)

[34]

F. Zhang , J. Zhang , P. Gao , and G. Long , Searching non-adiabatic holonomic quantum gates via an optimization algorithm, Phys. Rev. A 100(1), 012329 (2019)

[35]

J. Xu , S. Li , T. Chen , and Z. Y. Xue , Nonadiabatic geometric quantum computation with optimal control on superconducting circuits, Front. Phys. (Beijing) 15(4), 41503 (2020)

[36]

Y. Liang , Y. X. Wu , and Z. Y. Xue , Nonadiabatic geometric quantum gates that are robust against systematic errors, Phys. Rev. Appl. 22(2), 024061 (2024)

[37]

M. H. Zhang,J. Qian, Multi-objective optimization for robust holonomic quantum gates, arXiv: 2025)

[38]

X. Wu and P. Zhao , Nonadiabatic geometric quantum computation protected by dynamical decoupling via the XXZ Hamiltonian, Front. Phys. (Beijing) 17(3), 31502 (2022)

[39]

G. Lindblad , On the generators of quantum dynamical semigroups, Commun. Math. Phys. 48(2), 119 (1976)

[40]

J. Schwinger , Unitary operator bases, Proc. Natl. Acad. Sci. USA 46(4), 570 (1960)

[41]

A. Klappenecker,M. Rotteler, Mutually unbiased bases are complex projective 2-designs, in: Proc. Int. Symp. Inf. Theory, 2005, pp 1740–1744

[42]

Z. Chen , J. Kelly , C. Quintana , R. Barends , B. Campbell , Y. Chen , B. Chiaro , A. Dunsworth , A. G. Fowler , E. Lucero , E. Jeffrey , A. Megrant , J. Mutus , M. Neeley , C. Neill , P. J. J. O’Malley , P. Roushan , D. Sank , A. Vainsencher , J. Wenner , T. C. White , A. N. Korotkov , and J. M. Martinis , Measuring and sup- pressing quantum state leakage in a superconducting qubit, Phys. Rev. Lett. 116(2), 020501 (2016)

[43]

F. Motzoi , J. M. Gambetta , P. Rebentrost , and F. K. Wilhelm , Simple pulses for elimination of leakage in weakly nonlinear qubits, Phys. Rev. Lett. 103(11), 110501 (2009)

[44]

J. M. Gambetta , F. Motzoi , S. T. Merkel , and F. K. Wilhelm , Analytic control methods for high-fidelity unitary operations in a weakly nonlinear oscillator, Phys. Rev. A 83(1), 012308 (2011)

[45]

M. Kjaergaard , M. E. Schwartz , J. Braumüller , P. Krantz , J. I. J. Wang , S. Gustavsson , and W. D. Oliver , Superconducting qubits: Current state of play, Annu. Rev. Condens. Matter Phys. 11(1), 369 (2020)

[46]

C. Wang , X. Li , H. Xu , Z. Li , J. Wang , Z. Yang , Z. Mi , X. Liang , T. Su , C. Yang , et al. Towards practical quantum computers: Transmon qubit with a lifetime approaching 0.5 milliseconds, npj Quantum Inf. 8, 3 (2022)

[47]

M. Roth , M. Ganzhorn , N. Moll , S. Filipp , G. Salis , and S. Schmidt , Analysis of a parametrically driven exchange-type gate and a two-photon excitation gate between superconducting qubits, Phys. Rev. A 96(6), 062323 (2017)

[48]

M. Reagor , C. B. Osborn , N. Tezak , A. Staley , G. Prawiroatmodjo , et al. Demonstration of universal parametric entangling gates on a multi-qubit lattice, Sci. Adv. 4(2), eaao3603 (2018)

[49]

J. Chu , D. Li , X. Yang , S. Song , Z. Han , Z. Yang , Y. Dong , W. Zheng , Z. Wang , X. Yu , D. Lan , X. Tan , and Y. Yu , Realization of superadiabatic two-qubit gates using parametric modulation in superconducting circuits, Phys. Rev. Appl. 13(6), 064012 (2020)

RIGHTS & PERMISSIONS

Higher Education Press

AI Summary AI Mindmap
PDF (2663KB)

255

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/