ترغب بنشر مسار تعليمي؟ اضغط هنا

Reversion of Quantum Walks via interventions on coin space

91   0   0.0 ( 0 )
 نشر من قبل Asiri Nanayakkara
 تاريخ النشر 2018
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is required to reverse a quantum walker on a line to its initial positon and the number of interventions increases with the dimensionality of the walk. We present an analytical treatment to prove these results. This reversion scheme can be used to generate periodic bounded quantum walks and to control the locations where particle can be found with highest probability. From the point of view of quantum computations and simulations, this scheme could be useful in resetting quantum operations and implementing certain quantum gates.



قيم البحث

اقرأ أيضاً

136 - Martin Stefanak , Igor Jex 2014
The control of quantum walk is made particularly transparent when the initial state is expressed in terms of the eigenstates of the coin operator. We show that the group-velocity density acquires a much simpler form when expressed in this basis. This allows us to obtain a much deeper understanding of the role of the initial coin state on the dynamics of quantum walks and control it. We find that the eigenvectors of the coin result in an extremal regime of a quantum walk. The approach is illustrated on two examples of quantum walks on a line.
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any unitary operato r, which commutes with translations, and couples only sites at a finite distance from each other. For example, a single step of the walk could be composed of any finite succession of different shift and coin operations in the usual sense, with any lattice dimension and coin dimension. We find ballistic scaling, and establish a direct method for computing the asymptotic distribution of position divided by time, namely as the distribution of the discrete time analog of the group velocity. In the random case, we let a Markov chain (control process) pick in each step one of finitely many unitary walks, in the sense described above. In ballistic order we find a non-random drift, which depends only on the mean of the control process and not on the initial state. In diffusive scaling the limiting distribution is asymptotically Gaussian, with a covariance matrix (diffusion matrix) depending on momentum. The diffusion matrix depends not only on the mean but also on the transition rates of the control process. In the non-random limit, i.e., when the coins chosen are all very close, or the transition rates of the control process are small, leading to long intervals of ballistic evolution, the diffusion matrix diverges. Our method is based on spatial Fourier transforms, and the first and second order perturbation theory of the eigenvalue 1 of the transition operator for each value of the momentum.
Classical random walks on finite graphs have an underrated property: a walk from any vertex can reach every other vertex in finite time, provided they are connected. Discrete-time quantum walks on finite connected graphs however, can have infinite hi tting times. This phenomenon is related to graph symmetry, as previously characterized by the group of direction-preserving graph automorphisms that trivially affect the coin Hilbert space. If a graph is symmetric enough (in a particular sense) then the associated quantum walk unitary will contain eigenvectors that do not overlap a set of target vertices, for any coin flip operator. These eigenvectors span the Infinite Hitting Time (IHT) subspace. Quantum states in the IHT subspace never reach the target vertices, leading to infinite hitting times. However, this is not the whole story: the graph of the 3D cube does not satisfy this symmetry constraint, yet quantum walks on this graph with certain symmetric coins can exhibit infinite hitting times. We study the effect of coin symmetry by analyzing the group of coin-permutation symmetries (CPS): graph automorphisms that act nontrivially on the coin Hilbert space but leave the coin operator invariant. Unitaries using highly symmetric coins with large CPS groups, such as the permutation-invariant Grover coin, are associated with higher probabilities of never arriving, as a result of their larger IHT subspaces.
Quantum walks subject to decoherence generically suffer the loss of their genuine quantum feature, a quadratically faster spreading compared to classical random walks. This intuitive statement has been verified analytically for certain models and is also supported by numerical studies of a variety of examples. In this paper we analyze the long-time behavior of a particular class of decoherent quantum walks, which, to the best of our knowledge, was only studied at the level of numerical simulations before. We consider a local coin operation which is randomly and independently chosen for each time step and each lattice site and prove that, under rather mild conditions, this leads to classical behavior: With the same scaling as needed for a classical diffusion the position distribution converges to a Gaussian, which is independent of the initial state. Our method is based on non-degenerate perturbation theory and yields an explicit expression for the covariance matrix of the asymptotic Gaussian in terms of the randomness parameters.
204 - Miquel Montero 2014
In this paper we unveil some features of a discrete-time quantum walk on the line whose coin depends on the temporal variable. After considering the most general form of the unitary coin operator, we focus on the role played by the two phase factors that one can incorporate there, and show how both terms influence the evolution of the system. A closer analysis reveals that the probabilistic properties of the motion of the walker remain unaltered when the update rule of these phases is chosen adequately. This invariance is based on a symmetry with consequences not yet fully explored.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا