Dynamical-corrected nonadiabatic geometric quantum computation

Cheng-Yun Ding , Li Chen , Li-Hua Zhang , Zheng-Yuan Xue

Front. Phys. ›› 2023, Vol. 18 ›› Issue (6) : 61304

PDF (4758KB)
Front. Phys. ›› 2023, Vol. 18 ›› Issue (6) : 61304 DOI: 10.1007/s11467-023-1322-2
RESEARCH ARTICLE

Dynamical-corrected nonadiabatic geometric quantum computation

Author information +
History +
PDF (4758KB)

Abstract

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.

Graphical abstract

Keywords

geometric phases / dynamical-corrected gates / fault-tolerant quantum computation

Cite this article

Download citation ▾
Cheng-Yun Ding, Li Chen, Li-Hua Zhang, Zheng-Yuan Xue. Dynamical-corrected nonadiabatic geometric quantum computation. Front. Phys., 2023, 18(6): 61304 DOI:10.1007/s11467-023-1322-2

登录浏览全文

4963

注册一个新账户 忘记密码

1 Introduction

In the last several decades, quantum computation has been gradually received great attentions as it has stronger computing power than classical computation and can solve certain problems that cannot be solved by classical one. For example, Shor’s and Grover’s algorithms are the two most typical quantum algorithms in the early stage, for verifying the quantum computing capability [1,2]. Meanwhile, quantum computation has been theoretically proposed and experimentally verified in many quantum systems, such as nuclear magnetic resonance [3,4], ion trap [5,6], neutral atoms [7,8], photons [9-12] and superconducting circuit systems [13-19]. However, in most of these experiments, the performances of the implemented quantum gates are still greatly affected by the local artificial-manipulation and random errors, resulting in the relatively low gate-fidelity, and thus it is still difficult to realize large-scale fault-tolerant quantum computation.

Geometric quantum computation [20,21] is a kind of special quantum computation strategy that uses geometric phases [22-25] to construct universal quantum gates, and is considered as one of the promising alternatives to realize universal quantum computation. Since the geometric phase has intrinsic geometric property, that is, it does not change with the evolution details of the evolution state, and only depends on the global property of the evolution path, the geometric quantum gates based on the geometric phases can naturally resist the local systematic error, also called σx error [26-33]. The geometric phase was proposed by Berry in 1984 [22]. However, since this phase is induced by adiabatic evolution of the system energy eigenstates, it requires that the system evolution must be slow enough, and thus being seriously affected by decoherence. Subsequently, the adiabatic Berry phase is extended to the nonadiabatic Aharonov−Anandan (A−A) phase [24]. It is not limited by the adiabatic theorem [34,35], so its fast evolution time makes the constructed geometric gates quickly realized in experiments [36-39]. Furthermore, Berry phase is also quickly extended to adiabatic and nonadiabatic non-Abelian geometric phases [23,25]. The constructed quantum gates by the latter two are also generally called the holonomic quantum gates [21,40,41].

Recently, finding a short and robust evolution path is one of the important concerns to realize faster and more robust geometric quantum gates [42-54]. Simultaneously, it has been proposed to combine some positive pulse-optimized techniques, such as composite pulse [55-59] and dynamical decoupling technologies [60-62], to suppress the errors during the implementation of the quantum gate. The geometric schemes based on the single-loop orange-slice-shaped evolution path have been proposed [42-45] and experimentally demonstrated [38,39] to realize universal geometric quantum gates. However, it requires strict control and connection of multi-segment pulses, causing the target gate-robustness against systematic σx error without great advantages over the corresponding dynamical gates [43]. Thus, to further improve the robustness against this error, the single-loop geometric scheme combined with the composite-pulse technique has been proposed [43] and verified by experiment [63]. Moreover, the more the number of increased composite pulses is, that is, the number of cycles of the evolution path is continuously increased, the stronger the robustness of constructed geometric gates resisting σ x error is. However, the greater the numbers turn, the longer the gate-operation time is, and thus the more seriously affected by the decoherence effect. So, considering the competition of the systematic σ x and decoherence errors, the geometric scheme based on two-loop composite pulse is the best choice, under the finite coherent time condition on superconducting circuits [43].

Here, to more furtherly improve the gate robustness compared to that using two-loop composite-pulse geometric scheme against σx error, we apply the dynamical correction technique [60,64,65] to the case of the conventional single-loop geometric gates, and propose a general scheme of universal dynamical-corrected nonadiabatic geometric quantum computation with a simple implementation. The nonadiabatic geometric and holonomic gates have different implementation ways, which are based on the nonadiabatic Abelian and non-Abelian geometric phases, respectively, with different energy-level structures. In addition, notice that in the corresponding holonomic scheme [66], it is necessary to add a dynamical evolution of rotating π angle around the axis in the xOy plane in the middle of each of the two evolution segments for the two-segment orange-slice-shaped path, and the dynamical phases generated by the two dynamical evolution just cancel each other. In the case of our geometric scheme, the difference is that we need to insert a dynamical evolution to the middle of each segments of the three evolution segments surrounding orange-slice-shaped path. Among them, only the inserted second-segment one is rotated by π angle around the axis in the xOy plane, while the inserted first- and third-segment ones are, respectively, rotated by a certain angle around the axis in the non-xOy plane, and the sum of the two rotated angles is just equal to π. Besides, the sum of the three accumulated dynamical phases also needs to be equal to 0. In this way, the constructed nonadiabatic geometric gates have much stronger robustness than the conventional single-loop geometric ones for σ x error. Numerical simulations show that the robustness of constructed dynamical-corrected geometric gates are both stronger than those of the corresponding conventional single-loop geometric and two-loop composite-pulse geometric ones for resisting σ x error. Moreover, combined with decoherence-free subspace (DFS) coding [67,68], our scheme can not only resist σ x error, but also resist the σz error caused by the collective dephasing. All these show that our scheme is a promising one for large-scale fault-tolerant quantum computation.

This paper is organized as follows. In Section 2, we briefly describe the conventional single-loop and composite-pulse geometric quantum gate schemes. The construction for dynamical-corrected geometric gates and comparison of gate performance for three different geometric schemes are presented in Section 3. The physical implementation of dynamically corrected geometric scheme combined with the DFS coding is made in Section 4, which includes single- and two-qubit cases, and the results are summarized in Section 5.

2 Conventional single-loop geometric and composite-pulse geometric gates

Because our dynamical-corrected geometric scheme is built on the conventional single-loop geometric scheme [42,43], here we briefly describe the construction of that and highlight the limitation for gate robustness compared with the corresponding dynamical counterpart in existing local σ x error. And, the composite-pulse geometric scheme is also described here, which can enhance the gate robustness of the conventional single-loop geometric one against σx error.

For a driven two-level quantum system, its resonant Hamiltonian can be expressed as follows, on the computational basis vectors {|0 ,|1},

H(t)=Ω (t)2(0 eiϕeiϕ0),

where Ω(t) and ϕ denote the driving coupling and initial phase of driving field, respectively. By dividing the evolution path of initial state |ψ+=cos (θ/2)|0+sin (θ/ 2) eiϕ|1 into three segments and setting the appropriate Hamiltonian parameters {Ω(t), ϕ} in each evolution segment, a set of universal single-qubit geometric gates can be obtained. Concretely, in the first segment, letting 0τ 1Ω(t)dt=θ, which makes that the evolution state travels along the longitude line ϕ from starting point (θ,ϕ) to the North Pole on the Bloch sphere; in the second segment, letting τ 1 τ2Ω(t) dt=π, then the evolution state follows another longitude line ϕ+ γ to the South Pole; in the last segment, τ 2 τ3Ω(t) dt=πθ must be satisfied, which ensures that the evolution state follows the longitude line ϕ from the South Pole returning to the initial point (θ,ϕ) and completes the cycle evolution. The complete evolution trajectory on the Bloch sphere is shown in Fig.1(a), i.e., orange-slice-shaped path, in which we can find that only a geometric phase γ is accumulated in the whole process. Similarly, the orthogonal evolution state | ψ can also be accumulated a geometric phase γ after a cycle of evolution, and the final geometric evolution operator can be calculated as U(τ)= eiγnσ with n=(sinθcos ϕ,sinθsin ϕ,cosθ) and σ=(σx,σy,σz), which represents the general single-qubit geometric gates.

When there is a σ x error, namely the form of pulse intensity Ω(t) changes as Ω (t)(1+ϵ)Ω(t) (ϵ is the error ratio for the pulse intensity), then the equation of pulse area in each segment cannot be strictly satisfied. This means that the evolution trajectory of the evolution state is destroyed, so that the final evolution state cannot return to the starting point and causing the gate infidelity, as shown in Fig.1(c). In addition, it has been shown that the gate infidelities against σ x error still have the same order of magnitude between the above single-loop geometric and corresponding dynamical ones [43]. So, the robust geometric nature has not been fully proven. But fortunately, some studies have pointed out that the composite-pulse technique can improve the resistance of the geometric gate for σx error. The specific process is as follows [55,58]:

Defining U c(γc) is the geometric gate of iteration unit, where γc=γ/N. By continuously applying the iterative-element gate N (N2) times, the composite-pulse geometric gates can be obtained as

U c(N γc)=[Uc( γc)]N =e iγ nσ.

For example, to get a geometric NOT gate (γ= π/ 2), we can apply the geometric iterative-element gate U c(γc) =X twice in succession, in which we set γ c=γ/2=π/4. Similarly, it can also be obtained by continuously applying three or more corresponding geometric iterative-element gates. However, as the number of iterations increases, the gate-operation time will also be prolonged multiply. When the decoherence effect is considered, the fidelity of the target geometric gates will drop sharply. So, we only consider the two-loop composite-pulse geometric one here for comparison in Section 3. In the next section, we will describe the construction process of dynamically corrected nonadiabatic geometric gates by combining a general dynamical correction technique, whose robustness against σx error is greatly improved, even better than that of two-loop composite-pulse geometric gates.

3 Dynamical-corrected geometric gates

To reduce the influence of σ x error on the fidelity of the conventional single-loop geometric gates, inspired by the dynamical correction technologies [64-66], we insert a dynamical evolution in the middle of each of the three evolution segments for above-mentioned single-loop geometric scheme. Since the rotation axes of the inserted first- and third-segment dynamical evolutions are generally not in the xOy plane, we need to consider a general two-level Hamiltonian, in which the detuning Δ (t) can be not 0, that is

H1(t)=12( Δ(t) Ω( t)eiϕΩ(t)eiϕΔ(t)).

To obtain a set of universal dynamically corrected single-qubit geometric gates, we divide the whole evolution path into nine segments [in which the second, fifth and eighth segments are the inserted dynamical evolutions, and the corresponding evolution trajectories are plotted in Fig.1(b)], and then the Hamiltonian parameters {Ω(t) ,ϕ,Δ(t)} of each segment need to meet the following conditions:

0τ1Ω(t )dt=θ2,ϕ π2 ,Δ =0;τ 1 τ2Ω2(t)+Δ2(t) dt=θ,ϕ2π,Δ(t)= Ω( t)tan(θ /2 );τ 2 τ3Ω (t) dt=θ2,ϕπ 2,Δ =0;τ3τ 4Ω (t) dt=π2, ϕ+γ+ π2, Δ=0 ; τ4τ5Ω(t )dt=π, ϕ+γ+π,Δ=0;τ 5 τ6Ω (t) dt=π2, ϕ+γ+ π2,Δ=0; τ6τ7Ω(t )dt=π θ2,ϕ π2,Δ=0; τ 7 τ8Ω2(t)+Δ2(t) dt=πθ, ϕ2π ,Δ(t) =Ω (t)tan[(θ +π)/2];τ 8 τ9Ω (t) dt=πθ2,ϕ π2 ,Δ=0.

At the end of evolution τ, the corresponding evolution operator can be calculated as

U(τ)= U(τ 9,τ8)U(τ8,τ7 )U(τ7, τ6)U(τ6,τ 5)U (τ5,τ4 ) ×U(τ4,τ3)U(τ3,τ2 )U(τ2, τ1)U(τ1,0) = eiγ nσ .

In addition, note that the accumulated dynamical phases γd1, γd2 and γd3 in the second, fifth and eighth segments can be calculated as θ /2, π /2 and (θπ)/2, respectively, whose sum is just zero, namely γd1+ γd2 +γd3=0. Therefore, the target evolution operator U(τ) is still a pure geometric quantum gate without arbitrary dynamical phase. Next, we take a group of universal dynamical-corrected single-qubit geometric gates sequence (i.e., phase, π/8 and Hadamard gates, labelled as S, T and H) as the typical example to illustrate the gate performance of our scheme.

To implement the corresponding S, T and H gates, we set the parameters θ, ϕ and γ to meet:

( θ,ϕ )= (0,0), γ=π/4,( θ,ϕ)= (0,0), γ=π/8,( θ,ϕ)= (π /4,0), γ= π /2.

It is worth noting that since the θ =0 must be satisfied for the implemented dynamical-corrected geometric S and T gates, our scheme can degenerate to the case similar to that of the dynamical-corrected nonadiabatic holonomic quantum gates [66]. That is, the whole evolution path only needs to be divided into six segments, and the detunings of the inserted two-stage symmetrical dynamical evolutions on the equator are also 0. We utilize the Lindblad quantum master equation [69] of

ρ 1˙= i[ρ1,H1 (t)]+12[Γ1L(σ 1)+ Γ2 L(σ 2)]

to numerically simulate the dynamical process of the corresponding geometric gates, where ρ 1 is the density operator of the considered quantum system, L( A)=2 Aρ 1AAAρ1 ρ1A A is the Lindblad operator acting on operator A, and σ1=|0 1|, σ 2=|1 1||00| and Γ1, Γ2 are the corresponding decay and dephasing rates, respectively. For convenience, in our numerical simulations, we set Ω (t)=Ω m=1 and Γ1=Γ2= Ωm /104. As shown in Fig.2, we draw the dynamical process of the state population and state fidelity for the dynamically corrected geometric S and H gates (the gate performance of T gate is similar to that of S gate, which will not be described hereafter), respectively. From Fig.2 we can find that the state fidelities for dynamically corrected geometric S and H gates can reach 99.86% and 99.88%, respectively, in which the corresponding initial states ( | 0+ | 1)/2 and |0 have been considered. As shown in Fig.1(d), when the three-segment dynamical-corrected pulses are inserted, the evolution states with σ x error can nearly return to the starting point eventually, and getting robust geometric quantum gates. To verify the gate robustness of our scheme, we consider the same form of σ x error (1+ϵ) Ω( t). And, under this error, Eq. (3) becomes

H1E(t)=12(Δ(t)(1+ϵ )Ω (t)eiϕ(1+ϵ)Ω(t)eiϕΔ(t)),

where the error ratio ϵ is set in the interval 0.1ϵ0.1. First, without considering decoherence, for geometric S and H gates, we compare the gate robustness for the conventional single-loop geometric, the two-loop composite-pulse geometric ones and our scheme, as shown in Fig.3. It can be seen that the gate robustness of our scheme is much stronger than those of the others, whose analytic solution is described in Appendix A. Meanwhile, note that the total pulse areas of the geometric gates of our scheme are less than or equal to 4π (i.e., 0τΩ(t) dt4π), and that of the two-loop composite-pulse geometric gates is 4π, which are all larger than 2π for the conventional single-loop geometric scheme. Therefore, we need to consider the robustness comparison for different decoherence rates. Setting the decoherence rates as Γ1 =Γ2=Γ [0, 5]× 10 4, from Fig.4 we can see that the gate robustness for our scheme is still the best in the case of both considering σx error and decoherence.

It is worth emphasizing that, for the parameter θ 0, the robustness of our dynamical-corrected geometric gates are stronger than that of the recent similar optimization scheme resisting σx error [70] (see Appendix B for details). Meanwhile, for the case of θ=0, our optimization scheme can degenerate to the one in Ref. [70]. Thus, our dynamically corrected nonadiabatic geometric scheme is a more general one.

4 Physical implementation

In the last section, we have demonstrated that the dynamical correction techniques can greatly improve the robustness of conventional single-loop geometric gates against σx error. In this section, we will describe the physical implementation of our scheme combined with the DFS coding [67,68] and prove that such geometric gates can also effectively resist the σz error caused by the collective dephasing.

Considering two identical two-level physical qubits through direct-exchange interaction, their general Hamiltonian can be expressed as

H2(t )=Δ (t) Sz+ J(t)2(eiφS1+S 2+ H.c.),

where Δ(t) and J(t) represent the detuning and coupling strength between physical qubits 1 and 2, respectively, H.c. denote the Hermite conjugate, Sz =(|111||121|) /2, Si+= | 1 i0| and Si=|0 i1| with i=1,2. Note that, there is a two-dimensional single-excitation DFS: S1=Span {|1012,| 01 12}, in which | mn =|m1 | n 2, and we can naturally encode the logical qubit as |0 L=| 10 12 and |1L= |01 12. Then, in the DFS S1, the above Hamiltonian can be rewritten into the following form:

HL(t )=12(Δ(t)J( t)eiφJ( t)eiφΔ(t)) .

It is easy to see that the form of the Hamiltonian HL(t ) is similar to that of the Hamiltonian H1(t) for dynamical-corrected single-qubit geometric case without logical coding. Therefore, we can naturally realize the dynamical-corrected nonadiabatic geometric gates combined with DFS coding. In Fig.5, we test the robustness of dynamically corrected geometric S and H gates with and without DFS coding, respectively, to resist local σx and σz errors. Here, we define the Hamiltonian form influenced by these two kinds of errors as

HLE (t)=12 Δ(t) σzL+J( t)( 1+ϵ)2[eiφ|0L1| + eiφ|1L 0|]δΩm(|0L0|+|1L 1| ),

where δ Ωm denotes the collective dephasing errors, namely the Z errors are the same in each physical qubits. When this error is non-collective, the DFS coding can still eliminate the overlapping part of the Z errors. In addition, in our numerical simulations, let all the coupling strengths be set to constant 1, i.e., J( t)= Ωm=1, and the decoherence rates be set to 104. From Fig.5, we can see that the constructed geometric S and H gates can effectively resist σx and σz errors, simultaneously, after combining DFS coding.

To realize the universal quantum computation, a nontrivial two-qubit quantum gate is necessary. Similarly, we consider four identical two-level physical qubits, in which the first (third) and second (fourth) physical qubits are encoded as the first (second) logical qubit, and the effective Hamiltonian between them can be written as

H3(t )= Δ~( t)Sz+ g(t)2 [ eiφ~( | 1 1 1|S2+S 3 | 0 4 0|+|010|S2S 3+ | 1 4 1|)+H.c. ],

where g(t) is the effective coupling strength between physical qubits 2 and 3. Considering a DFS coding for two-logical qubit, there is a 6-dimensional DFS: S2={|1010, |1001,|0110, | 0101,|1100 ,|0011}, in which |mn mn =|m1|n2 | m3|n 4. Furthermore, the basis vectors of two-logical qubit is defined as {|00L=|1010, |01L=|1001 ,|10L=|0110, | 11 L= |0101}, and |a1 L= |1100 and |a2 L= |0011 are treated as two auxiliary states. Therefore, in the DFS for two-logical qubit S2= {|00L,|a1L,|01L,|10L,|11L,|a2L}, the above Hamiltonian H3(t) will become

H3L(t)=12 ( Δ~(t) g(t) eiφ~000 0g(t) eiφ~Δ ~(t)000 0000 0000 000000000 Δ~(t)g(t) eiφ ~ 00 00g (t)eiφ~Δ ~(t) ).

It is noted that the Hamiltonians in the two-logical-qubit subspaces {|00L,|a1L} or {|11L,| a2L} have a similar form as that of the single-logical-qubit case, so a same dynamically corrected geometric phase gate can be constructed in the corresponding logical subspaces with the detuning Δ~=0, respectively. At the same time, by tracing the two auxiliary states, the dynamically corrected geometric gates for two-logical qubit can be obtained as follows:

U2(γ ~)=( e iγ~00001000010000eiγ~).

With the help of several single-logical-qubit geometric gates, U2( γ~) is actually equivalent to the nontrivial two-qubit geometric controlled-phase gates [71]. Setting γ~=π/2, we simulate the state population and state fidelity F2 for U2(π/2) based on the initial state | ψ0=12(|00L+|01L+|10L+|11L). As shown in Fig.6(a), the state fidelity F2 can reach 99.67% with the set decay and dephasing rates and coupling constants being the same as the ones of above single-logical-qubit geometric gates. Besides, to illustrate the robustness advantage for U2(π/2), we plot the robustness comparison against local σx error among the conventional single-loop geometric, two-loop composite geometric and our dynamical-corrected geometric schemes in Fig.6(b). The influenced two-logical-qubit Hamiltonian in the DFS S2 can be read as ( Δ~=0):

H3E(t)=12g(t )(1+ϵ) [e iφ ~(|00La1|+|11La2|)+ H .c.],

in which ϵ denotes the error ratio of local σx error. From Fig.6(b), we can easily see that the gate robustness for dynamical-corrected geometric U2(π/2) is the best, although the maximum gate fidelity is decreased slightly, which is consistent with the case of single-logical-qubit geometric gates. In this way, by combining the dynamical-corrected universal single-logical-qubit geometric gates, we can implement the arbitrary-logical-qubit geometric quantum gates of dynamical correction based on DFS coding. It is worth noting that our two-qubit dynamically corrected geometric gates with DFS coding can also effectively resist the σz error caused by the collective dephasing.

5 Conclusion

In conclusion, we have proposed a general scheme for dynamical-corrected nonadiabatic geometric quantum gates, whose gate robustness is much superior to that of the conventional single-loop geometric scheme and even better than the two-loop composite-pulse geometric one in terms of resisting σx error. Furthermore, we give the physical implementation of our scheme combined with DFS coding, and numerical results show that the implemented dynamical-corrected geometric gates can not only resist σx error, but also suppress σz error caused by the collective dephasing. All of these indicate that our scheme provides a promising way to achieve robust and large-scale fault-tolerant geometric quantum computation.

References

[1]

P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 1997, 26(5): 1484

[2]

L. K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett., 1997, 79(2): 325

[3]

D. G. Cory, A. F. Fahmy, T. F. Havel. Ensemble quantum computing by NMR spectroscopy. Proc. Natl. Acad. Sci. USA, 1997, 94(5): 1634

[4]

N. A. Gershenfeld, I. L. Chuang. Bulk spin-resonance quantum computation. Science, 1997, 275(5298): 350

[5]

J. I. Cirac, P. Zoller. Quantum computations with cold trapped ions. Phys. Rev. Lett., 1995, 74(20): 4091

[6]

N. Friis, O. Marty, C. Maier, C. Hempel, M. Holzäpfel, P. Jurcevic, M. B. Plenio, M. Huber, C. Roos, R. Blatt, B. Lanyon. Observation of entangled states of a fully controlled 20-qubit system. Phys. Rev. X, 2018, 8(2): 021012

[7]

L. M. Duan, B. Wang, H. J. Kimble. Robust quantum gates on neutral atoms with cavity-assisted photon scattering. Phys. Rev. A, 2005, 72(3): 032333

[8]

L. Isenhower, E. Urban, X. L. Zhang, A. T. Gill, T. Henage, T. A. Johnson, T. G. Walker, M. Saffman. Demonstration of a neutral atom controlled-NOT quantum gate. Phys. Rev. Lett., 2010, 104(1): 010503

[9]

E.KnillR. LaflammeG.J. Milburn, A scheme for efficient quantum computation with linear optics, Nature 409(6816), 46 (2001)

[10]

X.L. WangY. H. LuoH.L. HuangM.C. ChenZ.E. Su C.LiuC. ChenW.LiY.Q. FangX.Jiang J.ZhangL. LiN.L. LiuC.Y. LuJ.W. Pan, 18-qubit entanglement with six photons’ three degrees of freedom, Phys. Rev. Lett. 120(26), 260502 (2018)

[11]

H. S. Zhong, H. Wang, Y. H. Deng, M. C. Chen, L. C. Peng, Y. H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu, P. Hu, X. Y. Yang, W. J. Zhang, H. Li, Y. Li, X. Jiang, L. Gan, G. Yang, L. You, Z. Wang, L. Li, N. L. Liu, C. Y. Lu, J. W. Pan. Quantum computational advantage using photons. Science, 2020, 370(6523): 1460

[12]

Q. P. Su, Y. Zhang, L. Bin, C. P. Yang. Efficient scheme for realizing a multiplex-controlled phase gate with photonic qubits in circuit quantum electrodynamics. Front. Phys., 2022, 17(5): 53505

[13]

A. Shnirman, G. Schön, Z. Hermon. Quantum manipulations of small Josephson junctions. Phys. Rev. Lett., 1997, 79(12): 2371

[14]

Y. Makhlin, G. Scöhn, A. Shnirman. Josephson-junction qubits with controlled couplings. Nature, 1999, 398(6725): 305

[15]

Y. Nakamura, Y. A. Pashkin, J. Tsai. Coherent control of macroscopic quantum states in a single-Cooper-pair box. Nature, 1999, 398(6730): 786

[16]

J. Koch, T. M. Yu, J. Gambetta, A. A. Houck, D. I. Schuster, J. Majer, A. Blais, M. H. Devoret, S. M. Girvin, R. J. Schoelkopf. Charge-insensitive qubit design derived from the Cooper pair box. Phys. Rev. A, 2007, 76(4): 042319

[17]

M. H. Devoret, R. J. Schoelkopf. Superconducting circuits for quantum information: an outlook. Science, 2013, 339(6124): 1169

[18]

F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin. . Quantum supremacy using a programmable superconducting processor. Nature, 2019, 574(7779): 505

[19]

Y. Wu, W. S. Bao, S. Cao, F. Chen, M. C. Chen. . Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett., 2021, 127(18): 180501

[20]

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

[21]

P. Zanardi, M. Rasetti. Holonomic quantum computation. Phys. Lett. A, 1999, 264(2-3): 94

[22]

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

[23]

F. Wilczek, A. Zee. Appearance of gauge structure in simple dynamical systems. Phys. Rev. Lett., 1984, 52(24): 2111

[24]

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

[25]

J. Anandan. Non-adiabatic non-Abelian geometric phase. Phys. Lett. A, 1988, 133(4-5): 171

[26]

G. De Chiara, G. M. Palma. Berry phase for a spin 1/2 particle in a classical fluctuating field. Phys. Rev. Lett., 2003, 91(9): 090404

[27]

P. Solinas, P. Zanardi, N. Zanghì. Robustness of non-Abelian holonomic quantum gates against parametric noise. Phys. Rev. A, 2004, 70(4): 042316

[28]

S. L. Zhu, Z. D. Wang, P. Zanardi. Geometric quantum computation and multiqubit entanglement with superconducting qubits inside a cavity. Phys. Rev. Lett., 2005, 94(10): 100502

[29]

S. Filipp, J. Klepp, Y. Hasegawa, C. Plonka-Spehr, U. Schmidt, P. Geltenbort, H. Rauch. Experimental demonstration of the stability of Berry’s phase for a spin-1/2 particle. Phys. Rev. Lett., 2009, 102(3): 030404

[30]

J. T. Thomas, M. Lababidi, M. Tian. Robustness of single qubit geometric gate against systematic error. Phys. Rev. A, 2011, 84(4): 042335

[31]

P. Solinas, M. Sassetti, P. Truini, N. Zanghì. On the stability of quantum holonomic gates. New J. Phys., 2012, 14(9): 093006

[32]

M. Johansson, E. Sjöqvist, L. M. Andersson, M. Ericsson, B. Hessmo, K. Singh, D. M. Tong. Robustness of nonadiabatic holonomic gates. Phys. Rev. A, 2012, 86(6): 062322

[33]

S. Berger, M. Pechal, A. A. Abdumalikov, C. Eichler, L. Steffen, A. Fedorov, A. Wallraff, S. Filipp. Exploring the effect of noise on the Berry phase. Phys. Rev. A, 2013, 87(6): 060303

[34]

D. M. Tong, K. Singh, L. C. Kwek, C. H. Oh. Quantitative conditions do not guarantee the validity of the adiabatic approximation. Phys. Rev. Lett., 2005, 95(11): 110407

[35]

D. M. Tong. Quantitative condition is necessary in guaranteeing the validity of the adiabatic approximation. Phys. Rev. Lett., 2010, 104(12): 120401

[36]

D. Leibfried, B. DeMarco, V. Meyer, D. Lucas, M. Barrett, J. Britton, W. M. Itano, B. Jelenković, C. Langer, T. Rosenband, D. J. Wineland. Experimental demonstration of a robust, high-fidelity geometric two ion-qubit phase gate. Nature, 2003, 422(6930): 412

[37]

C. Song, S. B. Zheng, P. Zhang, K. Xu, L. Zhang, Q. Guo, W. Liu, D. Xu, H. Deng, K. Huang, D. Zheng, X. Zhu, H. Wang. Continuous-variable geometric phase and its manipulation for quantum computation in a superconducting circuit. Nat. Commun., 2017, 8(1): 1061

[38]

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

[39]

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

[40]

E. Sjöqvist, D. M. Tong, L. Mauritz Andersson, B. Hessmo, M. Johansson, K. Singh. Non-adiabatic holonomic quantum computation. New J. Phys., 2012, 14(10): 103035

[41]

G. F. Xu, J. Zhang, D. M. Tong, E. Sjöqvist, L. C. Kwek. Nonadiabatic holonomic quantum computation in decoherence-free subspaces. Phys. Rev. Lett., 2012, 109(17): 170501

[42]

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

[43]

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

[44]

C. Zhang, T. Chen, S. Li, X. Wang, Z. Y. Xue. High fidelity geometric gate for silicon-based spin qubits. Phys. Rev. A, 2020, 101(5): 052302

[45]

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

[46]

T. Chen, Z. Y. Xue. High-fidelity and robust geometric quantum gates that outperform dynamical ones. Phys. Rev. Appl., 2020, 14(6): 064009

[47]

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

[48]

L. N. Ji, C. Y. Ding, T. Chen, Z. Y. Xue. Noncyclic geometric quantum gates with smooth paths via invariant-based shortcuts. Adv. Quantum Technol., 2021, 4(6): 2100019

[49]

S. Li, J. Xue, T. Chen, Z. Y. Xue. High-fidelity geometric quantum gates with short paths on superconducting circuits. Adv. Quantum Technol., 2021, 4(5): 2000140

[50]

C. Y. Ding, Y. Liang, K. Z. Yu, Z. Y. Xue. Nonadiabatic geometric quantum computation with shortened path on superconducting circuits. Appl. Phys. Lett., 2021, 119(18): 184001

[51]

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

[52]

T. Chen, P. Shen, Z. Y. Xue. Robust and fast holonomic quantum gates with encoding on superconducting circuits. Phys. Rev. Appl., 2020, 14(3): 034038

[53]

T. Chen, Z. Y. Xue, Z. Wang. Error-tolerant geometric quantum control for logical qubits with minimal resources. Phys. Rev. Appl., 2022, 18(1): 014062

[54]

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

[55]

Y. Ota, Y. Kondo. Composite pulses in NMR as nonadiabatic geometric quantum gates. Phys. Rev. A, 2009, 80(2): 024302

[56]

B. T. Torosov, N. V. Vitanov. High-fidelity error-resilient composite phase gates. Phys. Rev. A, 2014, 90(1): 012341

[57]

S. S. Ivanov, N. V. Vitanov. Composite two-qubit gates. Phys. Rev. A, 2015, 92(2): 022333

[58]

G. F. Xu, P. Z. Zhao, T. H. Xing, E. Sjöqvist, D. M. Tong. Composite nonadiabatic holonomic quantum computation. Phys. Rev. A, 2017, 95(3): 032311

[59]

B. B. Liu, F. Q. Guo, L. L. Yan, S. Zhang, M. Feng, S. L. Su. Realization of Deutsch–Jozsa algorithm in rydberg atoms by composite nonadiabatic holonomic quantum computation with strong robustness against systematic errors. Adv. Quantum Technol., 2021, 4(11): 2100093

[60]

L. Viola, E. Knill, S. Lloyd. Dynamical decoupling of open quantum systems. Phys. Rev. Lett., 1999, 82(12): 2417

[61]

G. Xu, G. Long. Protecting geometric gates by dynamical decoupling. Phys. Rev. A, 2014, 90(2): 022323

[62]

X. Wu, P. Z. Zhao. Universal nonadiabatic geometric gates protected by dynamical decoupling. Phys. Rev. A, 2020, 102(3): 032627

[63]

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

[64]

K. Khodjasteh, L. Viola. Dynamically error-corrected gates for universal quantum computation. Phys. Rev. Lett., 2009, 102(8): 080501

[65]

X. Rong, J. Geng, F. Shi, Y. Liu, K. Xu, W. Ma, F. Kong, Z. Jiang, Y. Wu, J. Du. Experimental fault-tolerant universal quantum gates with solid-state spins under ambient conditions. Nat. Commun., 2015, 6(1): 8748

[66]

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

[67]

D. A. Lidar, I. L. Chuang, K. B. Whaley. Decoherence-free subspaces for quantum computation. Phys. Rev. Lett., 1998, 81(12): 2594

[68]

P. G. Kwiat, A. J. Berglund, J. B. Altepeter, A. G. White. Experimental verification of decoherence-free subspaces. Science, 2000, 290(5491): 498

[69]

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

[70]

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

[71]

M. R. Yun, F. Q. Guo, L. L. Yan, E. Liang, Y. Zhang, S. L. Su, C. X. Shan, Y. Jia. Parallel-path implementation of nonadiabatic geometric quantum gates in a decoherence-free subspace with nitrogen-vacancy centers. Phys. Rev. A, 2022, 105(1): 012611

RIGHTS & PERMISSIONS

Higher Education Press

AI Summary AI Mindmap
PDF (4758KB)

1046

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/