اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum and random walks as universal generators of probability distributions
85
0
0.0
(
0
)
تأليف
Miquel Montero
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a bell-shaped one in the second case. Here I show how one can impose any desired stochastic behavior (compatible with the continuity equation for the probability function) on both systems by the appropriate choice of time- and site-dependent coins. This implies, in particular, that one can devise quantum walks that show diffusive spreading without loosing coherence, as well as random walks that exhibit the characteristic fast propagation of a quantum particle driven by a Hadamard coin.
قيم البحث
اقرأ أيضاً
One-parameter family of discrete-time quantum-walk models on the square lattice, which includes the Grover-walk model as a special case, is analytically studied. Convergence in the long-time limit $t to infty$ of all joint moments of two components o
f walkers pseudovelocity, $X_t/t$ and $Y_t/t$, is proved and the probability density of limit distribution is derived. Dependence of the two-dimensional limit density function on the parameter of quantum coin and initial four-component qudit of quantum walker is determined. Symmetry of limit distribution on a plane and localization around the origin are completely controlled. Comparison with numerical results of direct computer-simulations is also shown.
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or mov
e in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads to consider Discrete Fourier Transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums, and allows the use of efficient algorithms based on the Fast Fourier Transform. The wave functions here obtained govern the probability of finding the particle at any given location, but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.
We calculate analytically, for finite-size matrices, joint probability densities of ratios of level spacings in ensembles of random matrices characterized by their associated confining potential. We focus on the ratios of two spacings between three c
onsecutive real eigenvalues, as well as certain generalizations such as the overlapping ratios. The resulting formulas are further analyzed in detail in two specific cases: the beta-Hermite and the beta-Laguerre cases, for which we offer explicit calculations for small N. The analytical results are in excellent agreement with numerical simulations of usual random matrix ensembles, and with the level statistics of a quantum many-body lattice model and zeros of the Riemann zeta function.
Quantum walks constitute important tools in different applications, especially in quantum algorithms. To a great extent their usefulness is due to unusual diffusive features, allowing much faster spreading than their classical counterparts. Such beha
vior, although frequently credited to intrinsic quantum interference, usually is not completely characterized. Using a recently developed Greens function approach [Phys. Rev. A {bf 84}, 042343 (2011)], here it is described -- in a rather general way -- the problem dynamics in terms of a true sum over paths history a la Feynman. It allows one to explicit identify interference effects and also to explain the emergence of superdiffusivity. The present analysis has the potential to help in designing quantum walks with distinct transport properties.
The discrete-time quantum walk (QW) is determined by a unitary matrix whose component is complex number. Konno (2015) extended the QW to a walk whose component is quaternion.We call this model quaternionic quantum walk (QQW). The probability distribu
tion of a class of QQWs is the same as that of the QW. On the other hand, a numerical simulation suggests that the probability distribution of a QQW is different from the QW. In this paper, we clarify the difference between the QQW and the QW by weak limit theorems for a class of QQWs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
