Related papers: A remark on uniform Strichartz estimate for quantu…
We explore a continuous-time quantum walk starting at a single vertex on the discrete path and cycle with a cubic nonlinearity. Such nonlinearities arise in Bose-Einstein condensates described by the Gross-Pitaevskii equation or by…
Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in…
A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…
A previous paper (hep-lat/9311011) proposed a new kind of random walk on a spherically-symmetric lattice in arbitrary noninteger dimension $D$. Such a lattice avoids the problems associated with a hypercubic lattice in noninteger dimension.…
A coinless, discrete-time quantum walk possesses a Hilbert space whose dimension is smaller compared to the widely-studied coined walk. Coined walks require the direct product of the site basis with the coin space, coinless walks operate…
The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now is possible to implement short-depth quantum circuits with dozens of qubits and…
Discrete-time quantum walk in one-dimension is studied from a path-integral perspective. This enables derivation of a closed-form expression for amplitudes corresponding to any coin-position basis of the state vector of the quantum walker…
By adding an extra Hilbert space to Hadamard Quantum Walk on Cycles (QWC), we presented a new type of QWCs called M\"obius Quantum Walk (MQW). The new space configuration enables the particle to rotate around the axis of movement. We…
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.…
Quantum walks are known to have nontrivial interactions with absorbing boundaries. In particular it has been shown that an absorbing boundary in the one dimensional quantum walk partially reflects information, as observed by absorption…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective…
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…
We present an approach to simulate the Schr\"odinger equation through continuous time quantum walks. The CTQW-based simulation applies unitary evolution driven by a quantum walk to generate probability amplitude distributions at various…
In this paper, we study the recurrence of Open Quantum Walks induced by finite-dimensional coins on the line ($\mathbb{Z}$) and on the grid ($\mathbb{Z}^2$). Two versions are considered: discrete-time open quantum walks (OQW) and…
The Wigner functions on the one dimensional lattice are studied. Contrary to the previous claim in literature, Wigner functions exist on the lattice with any number of sites, whether it is even or odd. There are infinitely many solutions…
Lackadaisical quantum walk (LQW) is a quantum analog of a classical lazy walk, where each vertex has a self-loop of weight $l$. For a regular $\sqrt{N}\times\sqrt{N}$ 2D grid LQW can find a single marked vertex with $O(1)$ probability in…
We show that the structure of the quantum group $su_{q}(2)$ is intimately related to the random walks on a two dimentional lattice. Using this connection we obtain an appropriate candidate for the exact area distribution of closed random…
We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…
A randomly walking quantum particle evolving by Schr\"odinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time $\Theta(N^{3/4})$. In this paper, we give a weighted version of this graph that…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…