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

Spectral and asymptotic properties of Grover walks on crystal lattice

67   0   0.0 ( 0 )
 نشر من قبل Etsuo Segawa
 تاريخ النشر 2013
  مجال البحث فيزياء
والبحث باللغة English




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

We propose a twisted Szegedy walk for estimating the limit behavior of a discrete-time quantum walk on a crystal lattice, an infinite abelian covering graph, whose notion was introduced by [14]. First, we show that the spectrum of the twisted Szegedy walk on the quotient graph can be expressed by mapping the spectrum of a twisted random walk onto the unit circle. Secondly, we show that the spatial Fourier transform of the twisted Szegedy walk on a finite graph with appropriate parameters becomes the Grover walk on its infinite abelian covering graph. Finally, as an application, we show that if the Betti number of the quotient graph is strictly greater than one, then localization is ensured with some appropriated initial state. We also compute the limit density function for the Grover walk on $mathbb{Z}^d$ with flip flop shift, which implies the coexistence of linear spreading and localization. We partially obtain the abstractive shape of the limit density function: the support is within the $d$-dimensional sphere of radius $1/sqrt{d}$, and $2^d$ singular points reside on the spheres surface.

قيم البحث

اقرأ أيضاً

78 - Yusuke Yoshie 2018
Characterizations graphs of some classes to induce periodic Grover walks have been studied for recent years. In particular, for the strongly regular graphs, it has been known that there are only three kinds of such graphs. Here, we focus on the perio dicity of the Grover walks on distance-regular graphs. The distance-regular graph can be regarded as a kind of generalization of the strongly regular graphs and the typical graph with an equitable partition. In this paper, we find some classes of such distance-regular graphs and obtain some useful necessary conditions to induce periodic Grover walks on the general distance-regular graphs. Also, we apply this necessary condition to give another proof for the strong regular graphs.
We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $beta$. We prove that, for al l $beta>0$, the random walk condensates to a set of diameter $(t/beta)^{1/3}$ in dimension $d=2$, up to a multiplicative constant. In all dimensions $dge 3$, we also prove that the volume is bounded above by $(t/beta)^{d/(d+1)}$ and the diameter is bounded below by $(t/beta)^{1/(d+1)}$. Similar results hold for a random walk conditioned to have local time greater than $beta$ everywhere in its range when $beta$ is larger than some explicit constant, which in dimension two is the logarithm of the connective constant.
128 - Alexey M. Kulik 2009
New relations between ergodic rate, L_p convergence rates, and asymptotic behavior of tail probabilities for hitting times of a time homogeneous Markov process are established. For L_p convergence rates and related spectral and functional properties (spectral gap and Poincare inequality) sufficient conditions are given in the terms of an exponential phi-coupling. This provides sufficient conditions for L_p convergence rates in the terms of appropriate combination of `local mixing and `recurrence conditions on the initial process, typical in the ergodic theory of Markov processes. The range of application of the approach includes time-irreversible processes. In particular, sufficient conditions for spectral gap property for Levy driven Ornstein-Uhlenbeck process are established.
58 - Lorenz A. Gilch 2019
In this article we consider transient random walks on HNN extensions of finitely generated groups. We prove that the rate of escape w.r.t. some generalised word length exists. Moreover, a central limit theorem with respect to the generalised word len gth is derived. Finally, we show that the rate of escape, which can be regarded as a function in the finitely many parameters which describe the random walk, behaves as a real-analytic function in terms of probability measures of constant support.
In this article we prove existence of the asymptotic entropy for isotropic random walks on regular Fuchsian buildings. Moreover, we give formulae for the asymptotic entropy, and prove that it is equal to the rate of escape of the random walk with res pect to the Green distance. When the building arises from a Fuchsian Kac-Moody group our results imply results for random walks induced by bi-invariant measures on these groups, however our results are proven in the general setting without the assumption of any group acting on the building. The main idea is to consider the retraction of the isotropic random walk onto an apartment of the building, to prove existence of the asymptotic entropy for this retracted walk, and to `lift this in order to deduce the existence of the entropy for the random walk on the building.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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