اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدContinuous-Time Quantum Walk on Penrose Lattice
143
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we study the quantum walk on the 2D Penrose Lattice, which is intermediate between periodic and disordered structure. Quantum walk on Penrose Lattice is less efficient in transport comparing to the regular lattices. By calculating the final remaining probability on the initial nodes and estimating the low bound. Our results show that the broken of translational symmetry induces both the localized states and degeneracy of eigenstates at $E=0$, this two differences from regular lattices influence efficiency of quantum walk. Also, we observe the transition from inefficient to efficient transport after introducing the near hopping terms, which suggests that we can adjust the hopping strength and achieve a phase transition progress.
قيم البحث
اقرأ أيضاً
We define the hitting (or absorbing) time for the case of continuous quantum walks by measuring the walk at random times, according to a Poisson process with measurement rate $lambda$. From this definition we derive an explicit formula for the hittin
g time, and explore its dependence on the measurement rate. As the measurement rate goes to either 0 or infinity the hitting time diverges; the first divergence reflects the weakness of the measurement, while the second limit results from the Quantum Zeno effect. Continuous-time quantum walks, like discrete-time quantum walks but unlike classical random walks, can have infinite hitting times. We present several conditions for existence of infinite hitting times, and discuss the connection between infinite hitting times and graph symmetry.
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or discrete
time. But whereas a continuous-time random walk can be obtained as the limit of a sequence of discrete-time random walks, the two types of quantum walk appear fundamentally different, owing to the need for extra degrees of freedom in the discrete-time case. In this article, I describe a precise correspondence between continuous- and discrete-time quantum walks on arbitrary graphs. Using this correspondence, I show that continuous-time quantum walk can be obtained as an appropriate limit of discrete-time quantum walks. The correspondence also leads to a new technique for simulating Hamiltonian dynamics, giving efficient simulations even in cases where the Hamiltonian is not sparse. The complexity of the simulation is linear in the total evolution time, an improvement over simulations based on high-order approximations of the Lie product formula. As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model. Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.
We study the percolation of a quantum particle on quasicrystal lattices and compare it with the square lattice. For our study, we have considered quasicrystal lattices modelled on the pentagonally symmetric Penrose tiling and the octagonally symmetri
c Ammann-Beenker tiling. The dynamics of the quantum particle is modelled using continuous-time quantum walk (CTQW) formalism. We present a comparison of the behaviour of the CTQW on the two aperiodic quasicrystal lattices and the square lattice when all the vertices are connected and when disorder is introduced in the form of disconnections between the vertices. Unlike on a square lattice, we see a significant fraction of quantum state localised around the origin in quasicrystal lattice. With increase in disorder, the percolation probability of a particle on a quasicrystal lattice decreases significantly faster when compared to the square lattice. This study sheds light on the minimum fraction of disconnections allowed to see percolation of quantum particle on these quasicrystal lattices.
For quantum search via the continuous-time quantum walk, the evolution of the whole system is usually limited in a small subspace. In this paper, we discuss how the symmetries of the graphs are related to the existence of such an invariant subspace,
which also suggests a dimensionality reduction method based on group representation theory. We observe that in the one-dimensional subspace spanned by each desired basis state which assembles the identically evolving original basis states, we always get a trivial representation of the symmetry group. So we could find the desired basis by exploiting the projection operator of the trivial representation. Besides being technical guidance in this type of problem, this discussion also suggests that all the symmetries are used up in the invariant subspace and the asymmetric part of the Hamiltonian is very important for the purpose of quantum search.
Nowadays, quantum simulation schemes come in two flavours. Either they are continuous-time discrete-space models (a.k.a Hamiltonian-based), pertaining to non-relativistic quantum mechanics. Or they are discrete-spacetime models (a.k.a Quantum Walks o
r Quantum Cellular Automata-based) enjoying a relativistic continuous spacetime limit. We provide a first example of a quantum simulation scheme that unifies both approaches. The proposed scheme supports both a continuous-time discrete-space limit, leading to lattice fermions, and a continuous-spacetime limit, leading to the Dirac equation. The transition between the two can be thought of as a general relativistic change of coordinates, pushed to an extreme. As an emergent by-product of this procedure, we obtain a Hamiltonian for lattice-fermions in curved spacetime with synchronous coordinates.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
