Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2018 May 8;8:7117. doi: 10.1038/s41598-018-25550-1

A Rout to Protect Quantum Gates constructed via quantum walks from Noises

Yi-Mu Du 1,, Li-Hua Lu 1,, You-Quan Li 1,2
PMCID: PMC5940792  PMID: 29740079

Abstract

The continuous-time quantum walk on a one-dimensional graph of odd number of sites with an on-site potential at the center is studied. We show that such a quantum-walk system can construct an X-gate of a single qubit as well as a control gate for two qubits, when the potential is much larger than the hopping strength. We investigate the decoherence effect and find that the coherence time can be enhanced by either increasing the number of sites on the graph or the ratio of the potential to the hopping strength, which is expected to motivate the design of the quantum gate with long coherence time. We also suggest several experimental proposals to realize such a system.

Introduction

The quantum walk, proposed as the quantum mechanical counterpart of the classical random walk1, has received increasing attentions in recent years due to its extensive potential application in many fields26. For example, the quantum walk can offer us a simple model to simulate the quantum information processing79. In order to realize the quantum information processing, one of the essential issues is to manipulate the quantum state coherently by quantum gates which have been experimentally implemented in some conventional systems, such as Josephson-junction devices10,11, nuclear magnetic resonant12,13 and trapped ions1416, where the decoherence of the quantum gates was studied1719. As we know, there is a natural mapping between the quantum walk and qubit systems8, which implies that the quantum walk has potential applications in the universal quantum computation2,3. As we aware, there are several works that studied the universal quantum computation with the help of quantum walks. For example, In refs2,3,2024, the authors presented suggestions to realize different quantum operations based on the continuous-time quantum walk model. Whereas, in ref.25, the authors proposed several schemes to realize the universal quantum computation based on the discrete-time quantum walk.

Since the quantum walk has been experimentally realized in quite several systems2628 and its decoherence has been theoretically studied29, whether an appropriate quantum-walk system can be used to increase the fidelity of quantum gate is undoubtedly an important issue in the quantum information processing. We will suggest two experimental proposals to realize it and show how to suppress the decoherence effect for certain quantum gates.

In this paper, we start from a study on a continuous-time quantum walk on a one-dimensional graph of odd number of sites with an on-site potential at the central site. As there are several schemes to realize such a quantum-walk model in experiment, such as coupled superconductor LC circuits bridged by a microwave resonator, or voltaged quantum dot array, we show that the continuous-time quantum walk can be applied to construct different type of quantum gates, and the type of which depends on the initial state and the number of the sites on the graph. We further study the decoherence effect of the quantum gate constructed by the continuous-time quantum walk and show that such a decoherence effect can be suppressed by appropriately tuning the parameters of the quantum-walk system or increasing the number of sites on the graph, which enlightens one to optimize the capability of the quantum gate, such as the suppress of decoherence, the enhancement of fidelity in the quantum operation.

This paper is organized as follows. In the next section, we give the model of the continuous-time quantum walk of a single particle and suggest two experimental proposals to realize the model we considered. In sec. 1.1, we take the simplest graph of three sites as an example to study the construction of an X-gate for a single qubit as well as a control gate for two qubits. We also study the decoherence properties of the constructed quantum gates. In sec. 1.2 and 1.3, we investigate the graph of five sites and any odd number of sites. In sec. 2, we discuss the construction of control gate. At last, we give a brief summary.

We consider the continuous-time quantum walk of a single particle on the following one-dimensional graph.

graphic file with name 41598_2018_25550_Equ1_HTML.gif

The graph consists of 2n + 1 sites, and the on-site potential at the central site differs from that at the other sites. For such a single-particle system, the Hilbert space is spanned by a set of orthogonal bases {|j〉, |j = −n, −n + 1, −n + 2, …, n − 1, n}, where |j〉 denotes the state that a particle occupies the jth site on the graph. The graph implies that the tunnelling occurs between the nearest-neighbour sites, then the Hamiltonian is given by

H=j=nn1J(|jj+1|+H.c.)+|00|, 1

where J refers to the hopping strength and to the on-site potential at the central site. The importance of the study on such a model is that can be realized by several systems in experiment.

One proposal to realize the model (1) is two series of superconductor LC circuits30,31 bridged by a microwave resonator. That is, n LC circuits couple to each other, of which one terminal is connected to a microwave resonator, and the resonator furthermore connects to another n coupled LC circuits. The resonator bridging those two LC-circuit series plays the role of an AC voltage source of single mode to each terminals. The second quantization version of such a system can be modelled by our model Hamiltonian (1) as long as the single-photon process is considered. As an example, Fig. 1 shows the scheme of the setup with n = 2 that can simulate the quantum walk on the one-dimensional graph of five sites.

Figure 1.

Figure 1

The sketch of two coupled superconductor LC circuits bridged by a microwave resonator where C’s, L’s and M’s refer to the capacitance, self- and mutual-inductance, respectively. Such a setup can simulate the quantum walk on the graph of five sites.

Another proposal to realize the model (1) can be a quantum dot array that was implemented in many experiments32,33. We show the sketch of the quantum dot array for n = 1 as an example in Fig. 2. The on-site potential in our model can be produced either by applying different voltages Vg1 and Vg233 or by placing a STM tip focusing on the central quantum dot.

Figure 2.

Figure 2

The sketch of the quantum dot array to realize the model (1). The can be realized by tuning the voltage Vg1 and Vg2.

Results

The construction of quantum gates for a single qubit

In order to construct quantum gates for a single qubit, it will be more illustrative to express (1) as follows

H=l,σJ(|l+1,σl,σ|+H.c.)+|00|+J(|1,0|+|01,+|+H.c.), 2

where the summation is taken over σ = ± and l = 1, 2, …, n − 1. This manifests that the Hilbert space has the following decomposition 123. Here 1 is spanned by {|l〉 |l = 1, 2, …, n}, 2 by {|+〉, |−〉}, and 3 by |0〉. We know that one only need two bases to describe a single-qubit system, so we need reduce the total Hilbert space into two dimensional subspace. In order to achieve this goal, we take partial trace over the index l. And for convenience of taking partial trace, we write the Hilbert space of the system in the form of 123. Here the Hilbert subspace 3 corresponds to the central site on the graph. Its existence ensures our system consisting of more than 3 sites (i.e., n > 1) can always be used to construct a quantum gate for a single qubit.

Now we are in the position to construct a quantum gate for a single qubit and study the relevant decoherence properties. We will investigate the simplest graph of three sites and the graph of five sites successively. Then we generalize our study to the case of any odd number of sites.

The case of three-site graph

The simplest case is the graph of three sites for which the Hilbert space is three dimensional. The eigenenergies are solved as 0, E/2 and E+/2 where E=2+8J2, E+=+2+8J2. The corresponding eigenstates can be easily obtained by the standard procedure of linear algebra. In the case of J, the eigenenergies become 0, 2J2/ and +2J2/, and the corresponding eigenstates are approximately given by

|ϕ1=12(|1,+|1,),|ϕ2=12(|1,++|1,),|ϕ3=|0. 3

Clearly, the eigenenergies for the states |φ1〉 and |φ2〉 are closer to each other, while they are much lower than the third eigenenergy for the state |φ3〉 as long as J. Therefore these two states provide us an effective two-level system that plays the role of a qubit. The effective Hamiltonian then turns to

Heff=J2σˆx, 4

where σˆx denotes the x-component of the Pauli matrix, namely σˆx = |+〉 〈−|+|−〉 〈+|.

The time evolution of any given initial state is computable because the above effective Hamiltonian (4) is equivalent to that of a spin-1/2 system in an external magnetic field along x-axis with magnitude 2J2/. The expectation values of the Pauli matrices for the solved state define a pseudo-spin polarization vector,

Sx(t)=cos(θ),Sy(t)=sin(θ)cos(2J2t+φ),Sz(t)=sin(θ)sin(2J2t+φ),

where θ and ϕ is determined by the initial state. As the above pseudo-spin polarization vector processes around the x-axis periodically, we can have an X-gate by choosing an appropriate time duration. This manifests that the continuous-time quantum walk of a single particle on a one-dimensional graph of three sites can construct an X-gate for a single qubit.

As is known that the decoherence34,35 is inevitable in any realistic system. Now let us introduce noise to the aforementioned system by adding some random fluctuations in the parameters and J, namely, =¯+δ(t), J=J¯+δJ(t) where ¯ and J¯ denote their average values, δ(t) and δJ(t) the random fluctuations. We assume that the fluctuation of the parameter changes on time slowly enough such that there will be no transitions between the low-lying states {|φ1〉, |φ2〉} and the high-lying state |φ3〉 occurring. The transition between the eigenstates |φ1〉 and |φ2〉 also does not occur for their symmetries are different. The adiabatic phase of these two low-lying eigenstates also vanishes due to ϕ˙1(2)|ϕ1(2)=0 in which the overhead dot denotes the derivative with respect to time.

In such an adiabatic approximation, we can approximately express the effective Hamiltonian as

Heff=(J¯2¯2J¯¯δJ+J¯2¯2δ)σˆx, 5

up to the first order of the small quantities owning to the assumption δ(t)¯ and δJ(t)J¯. Then the density matrix at a time t can be expressed as ρ(t)=exp(i0tHeff(t)dt)ρ(0)exp(i0tHeff(t)dt), where Heff is given by (5) and ρ(0) is determined by the initial state. Since and J fluctuate on time randomly, we can evaluate the average-density matrix at the time t by taking average over ensembles.

ρ(t)ens=D[δJ]D[δ]ρ(t)exp(12dtdtF(t,t)), 6

with F(t,t)=δJ(t)A(tt)δJ(t) + δ(t)B(tt)δ(t) + δ(t)C(tt)δJ(t). Here A(t − t′), B(t − t′) and C(t − t′) are correlation functions characterizing the correlation between the fluctuations, and they are positive and invariant under permutation of t and t′. If the correlation functions are assumed in the same order, the first term in Eq. (6) (i.e. the term including A(t − t′)) is the leading term due to the assumption J. Then we can neglect the fluctuation of and only consider the decoherence effect caused by the fluctuation of J.

In order to characterize the decoherence effect, we evaluate the expectation values of the Pauli matrices at time t with the help of Siens=Tr(σˆiρ(t)ens) in which i = x, y, z. These values just define a pseudo-spin polarization vector whose module varying on time,

Sxens=cosθ,Syens=sinθcos(2J¯2¯t+φ)exp[4(J¯¯)2I(t)],Szens=sinθsin(2J¯2¯t+φ)exp[4(J¯¯)2I(t)], 7

where I(t)=1(2π)sin2(ωt/2)ω2A˜(ω)dω with A˜(ω) being the Fourier transform of A(t − t′). From the result shown in Eq. (7), we can find that the decoherence effect occurs in the constructed X-gate once the fluctuation of parameters is considered. Considering several typical noises with different spectra, such as a constant spectrum and a Gaussian spectrum as well as a Lorentz spectrum, we find that the coherence time is proportional to (¯/J¯)2, which implies that one can enhance the coherence time by increasing the ratio of the parameters ¯ to J¯.

The case of five-site graph

Now we turn to the case of the graph of five sites for which the Hilbert space is five dimensional. Just like the case of three-site graph, we are interested in the regime J. In this case, one eigenvalue +2J2/ is much higher than the other four eigenvalues, J, −J, JJ2/J3/(22) and −JJ2/+J3/(22). The eigenstates corresponding to those four lower eigenvalues are

|ϕ1=12(|2,++|1,+|1,|2,),|ϕ2=12(|2,+|1,++|1,|2,),|ϕ3=12(|2,++|1,++|1,+|2,),|ϕ4=12(|2,+|1,+|1,+|2,). 8

They provide an effective four-level system that plays the role of two coupled qubits. By taking a partial trace over the labels l = 1, 2, we can obtain a reduced two-level system which constructs a quantum gate for a single qubit. The concrete type of the quantum gate depends on the initial state of the system. Such a quantum gate can suppress the decoherence effect induced by noises for some ideal cases, which will be discussed in the following.

We consider an initial state |ψ(0)=cos(α/2)|2,+sin(α/2)eiβ|1, which corresponds to a pseudo-spin polarization vector Sx(0) = Sy(0) = 0, Sz(0) = 1 by taking a partial trace over the labels l = 1, 2. We can evaluate the value of the pseudo-spin polarization vector at the time t,

Sx(t)=0,Sy(t)=sin(J2t)cos(J322t)+cosβsinαcos(J2t)sin(J322t),Sz(t)=cos(J2t)cos(J322t)cosβsinαsin(J2t)sin(J322t), 9

which implies that the pseudo-spin polarization vector precesses around the x-axis periodically and its module changes with time. By choosing α=π2, β = 0 to assure the module of the pseudo-spin polarization vector being a constant, we have an X-gate for a single qubit. In Fig. 3, we plot the time evolutions of the y- and z-components of the pseudo-spin polarization vector without considering the fluctuations of parameters. From this figure, we can find that the y- and z-components of the polarization vector oscillate with time and the phase difference between such two components is π2, which exhibits an operating process of an X-gate for a single qubit.

Figure 3.

Figure 3

The time evolution of the y- and z-components of the pseudo-spin polarization vector for the graph of three sites (a) and that of five sites (b) with parameter choices J = 1 and =10. The initial states are |1, −〉 in (a) and (|2,+|1,)/2 in (b).

Additionally, we also investigate the decoherence effect caused by the fluctuation of the parameters for the five-site graph. The analytical calculation is analogous to that for the previously studied three-site graph. Our result exhibits that the ratio of decoherence for the five-site graph is exp[(J¯/¯)2I(t)], which implies that the coherence time is four-times longer than that for the three-site graph. In Fig. 4, we plot the time evolution of the logarithm of the length of the polarization vector for the constant spectrum with a cutoff. The curves plotted in Fig. 4 is obtained by numerical method. Figure 4 shows that the module of the polarization vector almost decays exponentially with time when the time scale is not very long, and the coherence time will be enhanced by increasing ¯/J¯. Comparing the two curves in panels (a) and (b) of Fig. 4, we can find that the decay rate for the graph of three sites is about four times faster than that for the graph of five sites, which is in agreement with our analytical results.

Figure 4.

Figure 4

Time evolutions of the logarithm of the length of the pseudo-spin polarization vector for the graph of different sites. The parameters are J¯=10 and ¯=50 in (a) and ¯=100 in (b,c). The initial states are |1, −〉 for the graph of three sites (n = 1), (|2,+|1,)/2 for the graph of five sites (n = 2), and |k(1)+|k+(1) for the graph of 9 sites (n = 4).

Since the quantum dot systems(charge qubit) and the superconductor circuits are usually disturbed by the 1/f noise36,37, we also consider the decoherence for the noise with 1/|ω| spectrum. For the case of 1/|ω| spectrum, I(t)=1πωlωhsin2(ωt/2)ω3A˜(ω)dω, where ωl and ωh are lower and higher frequency cutoffs, respectively. The analytical details are presented in the supplementary material. In Fig. 5, we plot the time evolution of the logarithm of the length of the polarization vector for the 1/f noise by numerical method. The lower and higher frequency cutoffs of the noise are set to 0.001J and 0.003J, respectively. We can find that the decay rates oscillate with time for the short time at the beginning, but those tend to constants for long time. We can also find that the decay rate for the graph of three sites is about four times larger than that for the graph of five sites, which confirm our analytical results.

Figure 5.

Figure 5

Time evolutions of the logarithm of the length of the pseudo-spin polarization vector for the graph of different sites. The parameters are J¯=1 and ¯=1000. The initial states are |1, −〉 for the graph of three sites (n = 1), (|2,+|1,)/2 for the graph of five sites (n = 2).

Note that in the above discussion of the decoherence effect, we assume that the noise is ideal, so that each hopping strength between the nearest sites fluctuates synchronously. Whereas, in the real system, the larger system may suffer more complicated noises which can break the synchronization of the hopping strength, then the system will decohere quickly. Note that in the numerical calculation, we have assumed that the frequency of the noise is low enough to guarantee the validity of the adiabatic theory. Besides, the gap between different eigenvalues decreases as increasing chain length. Thus a larger system is influenced by high-frequency noise more seriously. Combining these consideration, for real systems, it may exist an optimal chain length which depends on experimental conditions.

The general case

Now we generalize our study to the case of the graph of any odd number of sites since we have constructed an X-gate by considering the quantum walk on the one-dimensional graph of three or five sites. As the Hamiltonian (2) is invariant under spatial-inversion, i.e., ll, the total Hilbert space is decomposed into =+, where + and refer to symmetric and antisymmetric Hilbert subspaces, respectively. Then the Hamiltonian (2) is diagonalized as follows, H|k〉 = 2 cos(k) |k〉 and H|k+〉 = 2 cos(k+) |k+〉 with 〈l, +|k〉 = sin(kl), 〈l, −|k〉 = −〈l, +|k〉, 〈l, −|k+〉 = 〈l, +|k+〉 = exp(ik+l) + Λ(k+) exp(−ik+l) and 〈0|k〉 = 0, in which Λ(k+)=(2iJsink++)/(2iJsink+). Here k+ and k fulfill the following equations,

sin[(n+1)k]=0,2iJsink+2iJsink++=e2i(n+1)k+. 10

We can solve the real roots from the above secular equation, namely k(m)=mπ/(n+1), and k+(m)=mπ/(n+1) + (2J/)sin(mπn+1)/(n+1) for the case of J, where m = 1, 2, …, n. We take the subspace spanned by |k+(m) and |k(m) for even m as the two levels of a qubit. Because l,|k+(m)=l,+|k+(m)=sin[k+(m)(ln1)], we can write the reduced density matrix at the initial time as ρ(0)=1/2+σˆz/2 if the initial state of the system is |k+(m)+|k(m), where the terms including J/ have been neglected due to the fact that J. Note that the energy difference between the two levels of |k+(m) and |k(m) is (4J2/)sin2(mπn+1)/(n+1). Then the effective Hamiltonian for the quantum walks on the graph of 2n + 1 sites reads

Heff=J2λ(m)n+1σˆx,

where λ(m)=2sin2(mπn+1). Additionally, we also consider an adiabatic fluctuation of the parameter J, we obtain that the decoherence ratio is exp[4λ2(n+1)2(J¯¯)2I(t)], which implies that the coherence time can be enhanced up to n2-times by increasing the length of the chain. We plot the numerical results for the graph of 9 sites (i.e., n = 4) in the panel (c) of Fig. 4, which confirms that the increase of the number of sites on the graph can extend the coherence time.

Note that the operate time τn of the (2n + 1)-point graphs satisfy τnn. For the noises with either a constant spectrum or the Gaussian spectrum or the Lorentz spectrum, the decoherence ratio at time τn decrease with n in the condition of I(t)t. Whereas, for the 1/f noise, the conclusion becomes more complicated. For the short operation time (i.e., ωhτn1), the decoherence ratio at time τn has almost nothing to do with the length of the chain because I(t)t2 for the case of ωht1. But for the long operation time (i.e., ωhτ11), the decoherence ratio at time τn decrease with n2 because I(t) is approximated to a constant for the case of ωlt1.

To understand why increasing length of the chain can protect qubit from noises, one may regard the chain as a auxiliary system, where total Hilbert space has composition 123, i.e., 2 spanned by {|+〉, |−〉} is the Hilbert space of qubit system and 1 spanned by {|l〉 |l = 1, 2, …, n} is the space of auxiliary system. Then increasing length of the chain is essentially increasing the size (dimension of Hilbert space) of the auxiliary system, which can protect the qubit from noises.

The construction of control gates for two qubits

In order to construct a control gate for two qubits, we consider a single-particle quantum walk on the following star graph:

graphic file with name 41598_2018_25550_Equ2_HTML.gif

The total Hamiltonian reads

H=α,βj=1n1(Jα,β|α,β,jα,β,j+1|+Jα,β|α,β,n0|+H.c.)+|00|, 11

where α, β = 0, 1 which label the four chains connecting with the central site |0〉, and Jα,β and Jα,β are the hopping strengths between the nearest sites. In the following discussion, we take Jα,β=[32+12(1)α]J, Jα,β=J32+12(1)α, and show that for such hopping strengths, the quantum-walk system on the above star graph can be used to construct a control gate for two qubits.

Just like the aforementioned case of one-dimensional chain, the eigenvectors |ψ〉 for Hamiltonian (11) can be written as

|ψ=α,βj=1nAα,βsin(kα,βj)|α,β,j+C0|0, 12

where k0,0 = k0,1 = k1, k1,0 = k1,1 = k2, Aα,β and C0 are coefficients to be determined. Substituting Eq. (12) into the Schrödinger equation

H|ψ=E|ψ, 13

where E = 4J cos(k1) = 2J cos(k2) is the eigenvalue, we can determine the coefficients by the following equation

(sin[k1(n+1)]000220sin[k1(n+1)]002200sin[k2(n+1)]01000sin[k2(n+1)]12sin(k1n)2sin(k1n)sin(k2n)sin(k2n)EJ)(A0,0A0,1A1,0A1,1C0)=M(A0,0A0,1A1,0A1,1C0)=0. 14

Then we obtain the secular equation detM = 0, i.e.,

sin[k1(n+1)]sin[k2(n+1)]{EJsin[k1(n+1)]sin[k2(n+1)]+2sin(k1n)sin[k2(n+1)]+2sin[k1(n+1)]sin(k2n)}=0. 15

Two series of exact solutions for the above equation can be obtained by the equation

sin[k1(n+1)]sin[k2(n+1)]=0. 16

For the condition that n + 1 is even, one solution of the above equation is k1 = k2 = π/2. One can find that such a solution gives three-fold degeneracy of eigenvalue which can’t be used to construct a control gate for two qubits. Thus in the later discussion, we neglect this solution and focus on the other solutions. For the other solutions we write them in explicit form

|ψ0m=1n+1j(sin(mjπn+1)|0,0,jsin(mjπn+1)|0,1,j),|ψ1m=1n+1j(sin(mjπn+1)|1,0,jsin(mjπn+1)|1,1,j). 17

In the above equations, m, m′ = 1, 2, 3, …, n. The eigenvalues for |ψ0m and |ψ1m are E0m=4Jcos(mπn+1) and E1m=2Jcos(mπn+1), respectively. The other solutions can be obtained by the equation

EJsin[k1(n+1)]sin[k2(n+1)]+2sin(k1n)sin[k2(n+1)]+2sin[k1(n+1)]sin(k2n)=0. 18

Since we are interested in the regime /J1, the real solutions for Eq. (18) can be solved by sin[k1(n + 1)] sin[k2(n + 1)] ≈ 0. We obtain two series of solutions which can be written as

{k1m=mπn+1+δ1,k2m=arccos[2cos(k1m)],{k2m=mπn+1+δ2,k1m=arccos[12cos(k2m)],

where m, m′ = 1, 2, 3, …, n. Taking the first-order approximation of Eq. (18), we obtain δ=δ1=δ2=sin(mπn+1)×2n+1J. Then we have E˜0m4Jcos(mπn+1)8Jδsin(mπn+1) and E˜1m2Jcos(mπn+1)4Jδsin(mπn+1). In the first-order approximation, the eigenvectors are written as

|φ0m1n+1j(sin(mjπn+1)|0,0,j+sin(mjπn+1)|0,1,j),|φ1m1n+1j(sin(mjπn+1)|1,0,j+sin(mjπn+1)|1,1,j),

where the eigenvalue corresponding to |φ0m, |φ1m are E˜0m and E˜1m, respectively.

We choose |ψ0m, |φ0m, |ψ1m and |φ1m as the bases states for the control gate. Rewrite 2n+1jsin(mjπn+1)|α,β,j by |α|β, and these four eigenvectors are expressed as

|ψ0m=12(|0|0|0|1),|ψ1m=12(|1|0|1|1),|φ0m=12(|0|0+|0|1),|φ1m=12(|1|0+|1|1).

On the basis of these four eigenvectors, the effective Hamiltonian becomes

Heffc=(amΔm)σˆzIˆ3ΔmIˆσˆxΔmσˆzσˆx, 19

where σˆx,y,z are Pauli matrices and Iˆ is the two-dimensional identity operator, am=Jcos(mπn+1) and Δm=J2(n+1)sin2(mπn+1). Here we have neglected the constant term in the effective Hamiltonian. Then we obtain the effective time-evolution operator Uˆ(t)=exp(iHeffct). If we consider an operation time t=π4Δm, the time-evolution operator becomes

Uˆ(π4Δm)=exp(i3π2)exp(iθmσˆzIˆ)(|00|Iˆ+|11|σˆx), 20

where θm=amπ4Δm+π4. From the above expression, we can find that the system constructs a control gate for two qubits, which is product of a control-NOT gate and a single-qubit phase gate.

Now, we are in the position to discuss the decoherence of such system. We consider the random fluctuation of parameters J and which can directly lead to fluctuation of Δm and am. One can find that the decoherence caused by fluctuation of Δm can be suppressed via increasing the chain’s length n efficiently, but the fluctuation of am still breaks coherence significantly. This is opposite to the case of X-gate, because the term of am does not appear in the effective Hamiltonian for X-gate. We will show that choosing appropriate m, i.e. mπn+1π/2 and increasing n simultaneously can protect the control gate from the noise induced by the fluctuation of am efficiently. Considering a fluctuation of δam=δJ(t)cos(mπn+1), we calculate the decoherence ratio that is proportional to exp[cos2(mπn+1)I(t)]. In the condition of n1 and mπn+1=π/2πn+1, the decoherence ratio approximates to (πn+1)2 which implies that the coherence time of the constructed gate increases with n2. Meanwhile, in such a condition, the operation time t=π4Δmn, so we can find that the decoherence ratio to the operation time increases linearly with the increasing the length of the chain. Note that θm=π22J+π4+O(1n+1) is almost independent of the number of sites on the chain if n is large enough.

In the numerical simulation for the control gate, we consider the Gaussian noise which is the same as the case for the X-gate. We calculate the ensemble average of the density matrix ρ¯=ρ(π4Δm)env at time t=π4Δm, where n is even and m=n2. Then we obtain the coherence ratio Tr(ρ¯2). The results are presented in Tables 1 and 2. The numerical results indicate that the coherence ratio becomes larger with the increasing of the length of the chain, which confirms our previous prediction.

Table 1.

The relation between the coherence ratio and the chain length n for the constructed control gate.

n Tr(ρ¯2)
2 0.5230
8 0.6680
10 0.7149
16 0.8021
20 0.8422

The spectrum of the noise is constant.

Table 2.

The relation between the coherence ratio and the chain length n for the constructed control gate.

n Tr(ρ¯2)
2 0.5898
4 0.7725
6 0.9401
8 0.9730

The spectrum of the noise is 1/|ω|. ¯=10000, J = 1. ωl and ωh are set to 0.001 and 0.003, respectively.

Conclusion and Discussion

In this paper, we have investigated the dynamical properties of the continuous-time quantum walk of a particle in a one-dimensional graph of odd number of sites where the on-site potential at the central site differs from that at the other sites. In order to make a more clear physical picture, we gave our analyses on the cases for the graph of three sites and five sites successively, and then presented our result for the general case of the graph containing odd number of site. We showed that the quantum-walk system can construct an X-gate for a single qubit when the on-site potential at the central site is much larger than the hopping strength between the nearest sites. We also investigated the decoherence effect of the system by introducing fluctuations to the parameters of the system. We found that the coherence time of the system can be enhanced by increasing either the number of sites on the graph or the ratio of the parameter to J. This is expected to motivate the design of the quantum gate with long coherence time. We also suggested two experimental proposals to realize the model we considered. One proposal is to connect two coupled superconductor LC circuits via a microwave resonator. Another proposal is a quantum dot array with different voltage at the central site. Additionally, we proposed a quantum-walk system which can be employed to construct a control gate for two qubits. We showed that the coherence time of the constructed control gate can be enhanced by increasing the number of sites on the chain and choosing appropriate eigenvector.

Here we used a single-particle quantum walk to construct quantum gates, which is different from the cases of refs22,24 where multiparticles were introduced in those systems. We considered a continuous-time quantum walk on a finite graph and utilized the qusi-momentum eigenstates of the quantum-walk system in the process of constructing the quantum gates. Whereas, the graphs considered in refs2,21 is infinite although the scattering sources are finite. In our scheme, we introduced the auxiliary states to protect the qubit systems, which differs from the case of ref.23.

Methods

In numerical calculation of the decoherence of the quantum gate, we use Gaussian random number generator to simulate the constant-spectrum noise and set Δ = 3. And some details of mathematical analysis is presented in Appendix.

Electronic supplementary material

Appendix (76.4KB, pdf)

Acknowledgements

The work was supported by the NBRPC of China (Grant No. 2014CB921201), the NKRDP of China (2017YFA0304300), the NSFC (Grants No. 11574266 and No. 11434008), and the Fundamental Research Funds for the Central Universities (Grant No. 2017QNA3004 and 2017FZA3003).

Author Contributions

Y.M.Du, L.H.Lu and Y.Q.Li together conceived the idea for the study. Y.M.Du performed the calculations and plotted the figures. Y.M.Du and L.H.Lu wrote the manuscript. All authors reviewed the manuscript.

Competing Interests

The authors declare no competing interests.

Footnotes

Electronic supplementary material

Supplementary information accompanies this paper at 10.1038/s41598-018-25550-1.

Publisher's note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Yi-Mu Du, Email: 11536016@zju.edu.cn.

Li-Hua Lu, Email: lhlu@zju.edu.cn.

References

  • 1.Aharonov Y, Davidovich L, Zagury N. Quantum random walks. Phys. Rev. A. 1993;48:1687. doi: 10.1103/PhysRevA.48.1687. [DOI] [PubMed] [Google Scholar]
  • 2.Childs AM. Universal Computation by Quantum Walk. Phys. Rev. Lett. 2009;102:180501. doi: 10.1103/PhysRevLett.102.180501. [DOI] [PubMed] [Google Scholar]
  • 3.Childs AM, Gosset D, Webb Z. Universal computation by multiparticle quantum walk. Science. 2013;339:791. doi: 10.1126/science.1229957. [DOI] [PubMed] [Google Scholar]
  • 4.Shenvi N, Kempe J, Whaley KB. Quantum random-walk search algorithm. Phys. Rev. A. 2003;67:052307. doi: 10.1103/PhysRevA.67.052307. [DOI] [Google Scholar]
  • 5.Flurin, E. et al. Observing Topological Invariants Using Quantum Walk in Superconducting Circuits. Phys. Rev. X7, 031023 (2017).
  • 6.AttalEmail S, Petruccione F, Sabot C, Sinayskiy I. Open Quantum Random Walks. J. Sat. Phys. 2012;147:832. doi: 10.1007/s10955-012-0491-0. [DOI] [Google Scholar]
  • 7.Kempe J. Quantum random walks: an introductory overview. Contemp. Phys. 2003;44:307. doi: 10.1080/00107151031000110776. [DOI] [Google Scholar]
  • 8.Hines AP, Stamp PCE. Quantum Walks, Quantum Gates, and Quantum Computers. Phys. Rev. A. 2007;75:062321. doi: 10.1103/PhysRevA.75.062321. [DOI] [Google Scholar]
  • 9.Du YM, Lu LH, Li YQ. Switching effect of the side chain on quantum walks on triple graphs. Phys. Rev. A. 2015;92:012309. doi: 10.1103/PhysRevA.92.012309. [DOI] [Google Scholar]
  • 10.Makhlin Y, Schön G, Shnirman A. Quantum-state engineering with Josephson-junction devices. Rev. Mod. Phys. 2001;73:357. doi: 10.1103/RevModPhys.73.357. [DOI] [Google Scholar]
  • 11.Fedorov A, Steffen L, Baur M, da Silva MP, Wallraff A. Implementation of a Toffoli gate with superconducting circuits. Nature. 2012;481:170. doi: 10.1038/nature10713. [DOI] [PubMed] [Google Scholar]
  • 12.Jones JA, Hansen RH, Mosca M. Quantum Logic Gates and Nuclear Magnetic Resonance Pulse Sequences. J. Magn, Reson. 1998;135:353. doi: 10.1006/jmre.1998.1606. [DOI] [PubMed] [Google Scholar]
  • 13.Price MD, et al. Construction and implementation of NMR quantum logic gates for two spin systems. J. Magn. Reson. 1999;140:371. doi: 10.1006/jmre.1999.1851. [DOI] [PubMed] [Google Scholar]
  • 14.Sørensen A, Mølmer K. Quantum computation with ions in thermal motion. Phys. Rev. Lett. 1999;82:1971. doi: 10.1103/PhysRevLett.82.1971. [DOI] [Google Scholar]
  • 15.Zheng SB. Quantum Logic Gates for Hot Ions without a Speed Limitation. Phys. Rev. Lett. 2003;90:217901. doi: 10.1103/PhysRevLett.90.217901. [DOI] [PubMed] [Google Scholar]
  • 16.Schmidt-Kaler F, et al. Realization of the Cirac–Zoller controlled-NOT quantum gate. Nature. 2003;422:408. doi: 10.1038/nature01494. [DOI] [PubMed] [Google Scholar]
  • 17.Uhrig GS. Keeping a Quantum Bit Alive by Optimized π-Pulse Sequences. Phys. Rev. Lett. 2007;98:100504. doi: 10.1103/PhysRevLett.98.100504. [DOI] [PubMed] [Google Scholar]
  • 18.Averin DV, et al. Suppression of dephasing by qubit motion in superconducting circuits. Phys. Rev. Lett. 2016;116:010501. doi: 10.1103/PhysRevLett.116.010501. [DOI] [PubMed] [Google Scholar]
  • 19.Wang L, Tu T, Gong B, Guo GC. Decoherence-protected spin-photon quantum gates in a hybrid semiconductor-superconductor circuit. Phys. Rev. A. 2015;92:062346. doi: 10.1103/PhysRevA.92.062346. [DOI] [Google Scholar]
  • 20.Underwood MS, Feder DL. Universal quantum computation by discontinuous quantum walk. Phys. Rev. A. 2010;82:042304. doi: 10.1103/PhysRevA.82.042304. [DOI] [Google Scholar]
  • 21.Blumer BA, Underwood MS, Feder DL. Single-qubit unitary gates by graph scattering. Phys. Rev. A. 2011;84:062302. doi: 10.1103/PhysRevA.84.062302. [DOI] [Google Scholar]
  • 22.Underwood MS, Feder DL. Bose-Hubbard model for universal quantum-walk-based computation. Phys. Rev. A. 2012;85:052314. doi: 10.1103/PhysRevA.85.052314. [DOI] [Google Scholar]
  • 23.Solenov Dmitry. Quantum gates via continuous time quantum walks in multiqubit systems with non-local auxiliary states. Quantum. Inf. Comput. 2017;17:415. [Google Scholar]
  • 24.Lahini Y, Steinbrecher GR, Bookatz AD, Englund D. Quantum logic using correlated one-dimensional quantum walks. Npj. Quantum. Inform. 2018;4:2. doi: 10.1038/s41534-017-0050-2. [DOI] [Google Scholar]
  • 25.Lovett NB, Cooper S, Everitt M, Trevers M, Kendon V. Universal quantum computation using the discrete-time quantum walk. Phys. Rev. A. 2010;81:042330. doi: 10.1103/PhysRevA.81.042330. [DOI] [Google Scholar]
  • 26.Karski M, et al. Quantum Walk in Position Space with Single Optically Trapped Atoms. Science. 2009;325:175. doi: 10.1126/science.1174436. [DOI] [PubMed] [Google Scholar]
  • 27.Qiang XG, et al. Efficient quantum walk on a quantum processor. Nature Commun. 2016;7:11511. doi: 10.1038/ncomms11511. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 28.Perets, H. B. et alPhys. Rev. Lett. 100, 170506 (2008). [DOI] [PubMed]
  • 29.Kendon, V. & Tregenna, B. Decoherence in a quantum walk on a line. In: Shapiro, J. H. & Hirota, O. (eds) Quantum Communication, Measurement and Computing, Rinton Press 463 (2002).
  • 30.Blais A, Huang RS, Wallraff A, Girvin SM, Schoelkopf RJ. Cavity quantum electrodynamics for superconducting electrical circuits: An architecture for quantum computation. Phys. Rev. A. 2004;69:062320. doi: 10.1103/PhysRevA.69.062320. [DOI] [Google Scholar]
  • 31.Xiang ZL, Ashhab S, You JQ, Nori F. Hybrid quantum circuits: Superconducting circuits interacting with other quantum systems. Rev. Mod. Phys. 2013;85:623. doi: 10.1103/RevModPhys.85.623. [DOI] [Google Scholar]
  • 32.Livermore C, Crouch CH, Westervelt RM, Campman KL, Gossard AC. The Coulomb Blockade in Coupled Quantum Dots. Science. 1996;274:1332. doi: 10.1126/science.274.5291.1332. [DOI] [PubMed] [Google Scholar]
  • 33.Waugh FR, et al. Measuring interactions between tunnel-coupled quantum dots. Phys. Rev. B. 1996;53:1413. doi: 10.1103/PhysRevB.53.1413. [DOI] [PubMed] [Google Scholar]
  • 34.Paladino, E., Galperin, Y. M., Falci, G. & Altshuler, B. L. 1/f noise: Implications for solid-state quantum information. Rev. Mod. Phys. 86, 361, and references therein (2014).
  • 35.Yang N, et al. Noise suppression of on-chip mechanical resonators by chaotic coherent feedback. Phys. Rev. A. 2015;92:033812. doi: 10.1103/PhysRevA.92.033812. [DOI] [Google Scholar]
  • 36.Petersson KD, Petta JR, Lu H, Gossard AC. Quantum Coherence in a One-Electron Semiconductor Charge Qubit. Phys. rev. Lett. 2010;105:246804. doi: 10.1103/PhysRevLett.105.246804. [DOI] [PubMed] [Google Scholar]
  • 37.Bylander Jonas, et al. Noise spectroscopy through dynamical decoupling with a superconducting flux qubit. Nature Phys. 2011;7:65. doi: 10.1038/nphys1994. [DOI] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Appendix (76.4KB, pdf)

Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES