Related papers: Laplacian versus Adjacency Matrix in Quantum Walk …
Due to the topological nature of Aubry-Andr\'{e}-Harper (AAH) model, exotic edge states have been found existing in one-dimensional periodic and quasiperiodic lattices. In this article, we investigate continuous-time quantum walks of…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
We introduce a new type of discrete quantum walks, called vertex-face walks, based on orientable embeddings. We first establish a spectral correspondence between the transition matrix $U$ and the vertex-face incidence structure. Using the…
In this article we present an effective Hamiltonian approach for Discrete Time Quantum Random Walk. A form of the Hamiltonian for one dimensional quantum walk has been prescribed, utilizing the fact that Hamiltonians are the generators of…
We consider the quantum search problem with a continuous time quantum walk for networks of finite spectral dimension d_{s} of the network Laplacian. For general networks of fractal (integer or non-integer) dimension d_{f}, for which in…
Let $X$ be a graph with adjacency matrix $A$. The \textsl{continuous quantum walk} on $X$ is determined by the unitary matrices $U(t)=\exp(itA)$. If $X$ is the complete graph $K_n$ and $a\in V(X)$, then \[1-|U(t)_{a,a}|\le2/n. \] In a…
Random walks behave very differently for classical and quantum particles. Here we unveil a ubiquitous distinctive behavior of random walks of a photon in a one-dimensional lattice in the presence of a finite number of traps, at which the…
Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants of optimization. Here we introduce the semiclassical walks in discrete time, which are algorithms that combines classical…
We investigate continuous-time quantum walks of two indistinguishable particles (bosons, fermions or hard-core bosons) in one-dimensional lattices with nearest-neighbour interactions. The two interacting particles can undergo independent-…
In this work, we consider the spatial search for a general marked state on graphs by continuous time quantum walks. As a simplest case, we compute the amplitude expression of the search for the multi-vertex uniform superposition state on…
We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle…
A review of discrete quantum walk with two particle is given. The use of different states encountered in identical particle, and the idea of entanglement and superposition is explored to explored the interesting dynamics of two particle…
We investigate the behavior of coherence in scattering quantum walk search on complete graph under the condition that the total number of vertices of the graph is greatly larger than the marked number of vertices we are searching, $N \gg…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that…
The join $X\vee Y$ of two graphs $X$ and $Y$ is the graph obtained by joining each vertex of $X$ to each vertex of $Y$. We explore the behaviour of a continuous quantum walk on a weighted join graph having the adjacency matrix or Laplacian…
The Dirac equation can be modelled as a quantum walk, with the quantum walk being: discrete in time and space (i.e. a unitary evolution of the wave-function of a particle on a lattice); homogeneous (i.e. translation-invariant and…
The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and…
Quantum random walks are shown to have non-intuitive dynamics, which makes them an attractive area of study for devising quantum algorithms for well-known classical problems as well as those arising in the field of quantum computing. In…
Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and…