Investigation of continuous-time quantum walk on root lattice An and honeycomb lattice
نویسنده
چکیده
The continuous-time quantum walk (CTQW) on root lattice An ( known as hexagonal lattice for n = 2) and honeycomb one is investigated by using spectral distribution method. To this aim, some association schemes are constructed from abelian group Z⊗n m and two copies of finite hexagonal lattices, such that their underlying graphs tend to root lattice An and honeycomb one, as the size of the underlying graphs grows to infinity. The CTQW on these underlying graphs is investigated by using the spectral distribution method and stratification of the graphs based on Terwilliger algebra, where we get the required results for root lattice An and honeycomb one, from large enough underlying graphs. Moreover, by using the stationary phase method, the long time behavior of CTQW on infinite graphs is approximated with finite ones. Also it is shown that the BoseMesner algebras of our constructed association schemes (called n-variable P -polynomial) can be generated by n commuting generators, where raising, flat and lowering operators (as elements of Terwilliger algebra) are associated with each generator. A system of n-variable orthogonal polynomials which are special cases of generalized Gegenbauer polynomials is constructed, where the probability amplitudes are given by integrals over these polynomials or their linear combinations. Finally the suppersymmetric structure of finite honeycomb lattices is revealed.
منابع مشابه
The Dirac equation as a quantum walk over the honeycomb and triangular lattices
A discrete-time Quantum Walk (QW) is essentially an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QWs admit a continuum limit, leading to well-known physics partial differential equations, such as the Dirac equation. We show that these simulation results need not rely on the grid: the Dirac equation in (2+1)–dimensions can also be simulated, t...
متن کاملSpatial search on a honeycomb network
The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. We propose a quantum algorithm for the spatial search problem on a honeycomb lattice with N sites and torus-like boundary conditions. The search algorithm is based on a modified quantum ...
متن کاملQuantum percolation and transition point of a directed discrete-time quantum walk
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson localisation. Here, we consider a directed discrete-time quantum walk as a model to study quantum percolation of a two-state particle on a two-dimensional latti...
متن کاملTight- binding study of electronic band structure of anisotropic honeycomb lattice
The two-dimensional structure of graphene, consisting of an isotropic hexagonal lattice of carbon atoms, shows fascinating electronic properties, such as a gapless energy band and Dirac fermion behavior of electrons at fermi surface. Anisotropy can be induced in this structure by electrochemical pressure. In this article, by using tight-binding method, we review anisotropy effects in the elect...
متن کاملLayer Anti-Ferromagnetism on Bilayer Honeycomb Lattice
Bilayer honeycomb lattice, with inter-layer tunneling energy, has a parabolic dispersion relation, and the inter-layer hopping can cause the charge imbalance between two sublattices. Here, we investigate the metal-insulator and magnetic phase transitions on the strongly correlated bilayer honeycomb lattice by cellular dynamical mean-field theory combined with continuous time quantum Monte Carlo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008