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

Periodicity for space-inhomogeneous quantum walks on the cycle

109   0   0.0 ( 0 )
 نشر من قبل Yusuke Ide
 تاريخ النشر 2016
  مجال البحث فيزياء
والبحث باللغة English




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

In this paper, we consider periodicity for space-inhomogeneous quantum walks on the cycle. For isospectral coin cases, we propose a spectral analysis. Based on the analysis, we extend the result for periodicity for Hadamard walk to some isospectral coin cases. For non-isospectral coin cases, we consider the the system that uses only one general coin at the origin and the identity coin at the other sites. In this case, we show that the periodicity of the general coin at the origin determines the periodicity for the whole system.


قيم البحث

اقرأ أيضاً

The discrete-time quantum walk (QW) is a quantum version of the random walk (RW) and has been widely investigated for the last two decades. Some remarkable properties of QW are well known. For example, QW has a ballistic spreading, i.e., QW is quadra tically faster than RW. For some cases, localization occurs: a walker stays at the starting position forever. In this paper, we consider stationary measures of two-state QWs on the line. It was shown that for any space-homogeneous model, the uniform measure becomes the stationary measure. However, the corresponding result for space-inhomogeneous model is not known. Here, we present a class of space-inhomogeneous QWs on the line and cycles in which the uniform measure is stationary. Furthermore, we briefly discuss a difference between QWs and RWs.
151 - Chusei Kiumi , Kei Saito 2021
Localization is a characteristic phenomenon of space-inhomogeneous quantum walks in one dimension, where particles remain localized at their initial position. Eigenvectors of time evolution operators are deeply related to the amount of trapping. In t his paper, we introduce the analytical method for the eigenvalue problem using a transfer matrix to quantitatively evaluate localization by deriving the time-averaged limit distribution and reveal the condition of strong trapping.
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.
72 - Kei Saito 2018
Quantum walks determined by the coin operator on graphs have been intensively studied. The typical examples of coin operator are the Grover and Fourier matrices. The periodicity of the Grover walk is well investigated. However, the corresponding resu lt on the Fourier walk is not known. In this paper, we present a necessary condition for the Fourier walk on regular graphs to have the finite period. As an application of our result, we show that the Fourier walks do not have any finite period for some classes of regular graphs such as complete graphs, cycle graphs with selfloops, and hypercubes.
Dukes (2014) and Konno, Shimizu, and Takei (2017) studied the periodicity for 2-state quantum walks whose coin operator is the Hadamard matrix on cycle graph C_N with N vertices. The present paper treats the periodicity for 3-state quantum walks on C _N. Our results follow from a new method based on cyclotomic field. This method shows a necessary condition for the coin operator of quantum walks to have the finite period. Moreover, we reveal the period T_N of two kinds of typical quantum walks, the Grover and Fourier walks. We prove that both walks do not have any finite period except for N=3, in which case T_3=6 (Grover), =12 (Fourier).
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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