اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSelf-avoiding quantum walks: realisations in subspaces and limit theorems
198
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
While completely self-avoiding quantum walks have the distinct property of leading to a trivial unidirectional transport of a quantum state, an interesting and non-trivial dynamics can be constructed by restricting the self-avoidance to a subspace of the complete Hilbert space. Here, we present a comprehensive study of three two-dimensional quantum walks, which are self-avoiding in coin space, in position space and in both, coin and position space. We discuss the properties of these walks and show that all result in delocalisation of the probability distribution for initial states which are strongly localised for a walk with a standard Grover coin operation. We also present analytical results for the evolution in the form of limit distributions for the self-avoiding walks in coin space and in both, coin and position space.
قيم البحث
اقرأ أيضاً
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.
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called height functions, and this p
ermits the study of SAWs with the special property of being bridges. The group structure is relevant in the interaction between the height function and the weight function. The main difficulties arise when the support of the weight function is unbounded, since the corresponding graph is no longer locally finite. There are two principal results, of which the first is a condition under which the weighted connective constant and the weighted bridge constant are equal. When the weight function has unbounded support, we work with a generalized notion of the length of a walk, which is subject to a certain condition. In the second main result, the above equality is used to prove a continuity theorem for connective constants on the space of weight functions endowed with a suitable distance function.
The connective constant $mu(G)$ of a quasi-transitive graph $G$ is the asymptotic growth rate of the number of self-avoiding walks (SAWs) on $G$ from a given starting vertex. We survey several aspects of the relationship between the connective consta
nt and the underlying graph $G$. $bullet$ We present upper and lower bounds for $mu$ in terms of the vertex-degree and girth of a transitive graph. $bullet$ We discuss the question of whether $mugephi$ for transitive cubic graphs (where $phi$ denotes the golden mean), and we introduce the Fisher transformation for SAWs (that is, the replacement of vertices by triangles). $bullet$ We present strict inequalities for the connective constants $mu(G)$ of transitive graphs $G$, as $G$ varies. $bullet$ As a consequence of the last, the connective constant of a Cayley graph of a finitely generated group decreases strictly when a new relator is added, and increases strictly when a non-trivial group element is declared to be a further generator. $bullet$ We describe so-called graph height functions within an account of bridges for quasi-transitive graphs, and indicate that the bridge constant equals the connective constant when the graph has a unimodular graph height function. $bullet$ A partial answer is given to the question of the locality of connective constants, based around the existence of unimodular graph height functions. $bullet$ Examples are presented of Cayley graphs of finitely presented groups that possess graph height functions (that are, in addition, harmonic and unimodular), and that do not. $bullet$ The review closes with a brief account of the speed of SAW.
A quantum walker moves on the integers with four extra degrees of freedom, performing a coin-shift operation to alter its internal state and position at discrete units of time. The time evolution is described by a unitary process. We focus on finding
the limit probability law for the position of the walker and study it by means of Fourier analysis. The quantum walker exhibits both localization and a ballistic behavior. Our two results are given as limit theorems for a 2-period time-dependent walk and they describe the location of the walker after it has repeated the unitary process a large number of times. The theorems give an analytical tool to study some of the Parrondo type behavior in a quantum game which was studied by J. Rajendran and C. Benjamin by means of very nice numerical simulations [1]. With our analytical tools at hand we can easily explore the phase space of parameters of one of the games, similar to the winning game in their papers. We include numerical evidence that our two games, similar to theirs, exhibit a Parrondo type paradox.
A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a small numbe
r of mobile particles travel. These trajectories are self-avoiding and non-intersecting, and their relationship to self-avoiding random walks is explored. Near $rho=0.5$ the distribution of path lengths becomes power-law like up to some cutoff length, suggesting a possible critical state.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
