اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum random walks on congested lattices
437
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled with lattices that contain static defects which reverse the walkers direction. We implement a dephasing process after each step which allows us to smoothly interpolate between classical and quantum random walkers as well as study the effect of dephasing on the quantum walk. Our key results show that a quantum walker escapes a finite boundary dramatically faster than a classical walker and that this advantage remains in the presence of heavily congested lattices. Also, we observe that a quantum walker is extremely sensitive to our model of dephasing.
قيم البحث
اقرأ أيضاً
We consider the Grover walk on infinite trees from the view point of spectral analysis. From the previous works, infinite regular trees provide localization. In this paper, we give the complete characterization of the eigenspace of this Grover walk,
which involves localization of its behavior and recovers the previous works. Our result suggests that the Grover walk on infinite trees may be regarded as a limit of the quantum walk induced by the isotropic random walk with the Dirichlet boundary condition at the $n$-th depth rather than one with the Neumann boundary condition.
It was recently pointed out that identifiability of quantum random walks and hidden Markov processes underlie the same principles. This analogy immediately raises questions on the existence of hidden states also in quantum random walks and their rela
tionship with earlier debates on hidden states in quantum mechanics. The overarching insight was that not only hidden Markov processes, but also quantum random walks are finitary processes. Since finitary processes enjoy nice asymptotic properties, this also encourages to further investigate the asymptotic properties of quantum random walks. Here, answers to all these questions are given. Quantum random walks, hidden Markov processes and finitary processes are put into a unifying model context. In this context, quantum random walks are seen to not only enjoy nice ergodic properties in general, but also intuitive quantum-style asymptotic properties. It is also pointed out how hidden states arising from our framework relate to hidden states in earlier, prominent treatments on topics such as the EPR paradoxon or Bells inequalities.
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains. We explore
the quantum trajectory point of view on these quantum random walks, that is, we show that measuring the position of the particle after each time- step gives rise to a classical Markov chain, on the lattice times the state space of the particle. This quantum trajectory is a simulation of the master equation of the quantum random walk. The physical pertinence of such quantum random walks and the way they can be concretely realized is discussed. Differences and connections with the already well-known quantum random walks, such as the Hadamard random walk, are established.
In this paper we define new Monte Carlo type classical and quantum hitting times, and we prove several relationships among these and the already existing Las Vegas type definitions. In particular, we show that for some marked state the two types of h
itting time are of the same order in both the classical and the quantum case. Further, we prove that for any reversible ergodic Markov chain $P$, the quantum hitting time of the quantum analogue of $P$ has the same order as the square root of the classical hitting time of $P$. We also investigate the (im)possibility of achieving a gap greater than quadratic using an alternative quantum walk. Finally, we present new quantum algorithms for the detection and finding problems. The complexities of both algorithms are related to the new, potentially smaller, quantum hitting times. The detection algorithm is based on phase estimation and is particularly simple. The finding algorithm combines a similar phase estimation based procedure with ideas of Tulsi from his recent theorem for the 2D grid. Extending his result, we show that for any state-transitive Markov chain with unique marked state, the quantum hitting time is of the same order for both the detection and finding problems.
We consider the discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of fractal goes to infinity in terms of their localization exponents $beta_w$ , total variation exponents $delta_w$ and relative
entropy exponents $eta_w$ . We define and solve the amplitude Green functions recursively when the level of the fractal graph goes to infinity. We obtain exact recursive formulas for the amplitude Green functions, based on which the hitting probabilities and expectation of the first-passage time are calculated. Using the recursive formula with the aid of Monte Carlo integration, we evaluate their numerical values. We also show that when the level of the fractal graph goes to infinity, with probability 1, the quantum random walks will return to origin, i.e., the quantum walks on Sierpinski gasket are recurrent.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
