Related papers: Equivalent Laplacian and Adjacency Quantum Walks o…
The Grover walk is one of the most well-studied quantum walks on graphs. In this paper, we investigate its periodicity to reveal the relationship between the quantum walk and the underlying graph, focusing particularly on the…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I…
In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding…
We examine the time dependent amplitude $ \phi_{j}\left( t\right)$ at each vertex $j$ of a continuous-time quantum walk on the cycle $C_{n}$. In many cases the Lissajous curve of the real vs. imaginary parts of each $ \phi_{j}\left(…
The two major discrete time formulations for quantum walks, coined and scattering, are unitarily equivalent for arbitrary position dependent transition amplitudes and any topology (PRA {\bf 80}, 052301 (2009)). Although the proof explicit…
Quantum walks with long-range steps $R^{-\gamma}$ ($R$ being the distance between sites) on a discrete line behave in similar ways for all $\gamma\geq2$. This is in contrast to classical random walks, which for $\gamma >3$ belong to a…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
A continuous-time quantum walk is investigated on complex networks with the characteristic property of community structure, which is shared by most real-world networks. Motivated by the prospect of viable quantum networks, I focus on the…
Multi-photon quantum walks in integrated optics are an attractive controlled quantum system, that can mimic less readily accessible quantum systems and exhibit behavior that cannot in general be accurately replicated by classical light…
A classical lazy random walk on cycles is known to mix to the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibit strong non-uniform mixing properties. Our results include the following: - The…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…
Using the spectral distribution associated with the adjacency matrix of graphs, we introduce a new method of calculation of amplitudes of continuous-time quantum walk on some rather important graphs, such as line, cycle graph $C_n$,…
The lackadaisical quantum walk, which is a quantum walk with a weighted self-loop at each vertex, has been shown to speed up dispersion on the line and improve spatial search on the complete graph and periodic square lattice. In these…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…
Let $M\circ N$ denote the Schur product of two matrices $M$ and $N$. A graph $X$ with adjacency matrix $A$ is walk regular if $A^k\circ I$ is a constant times $I$ for each $k\ge0$, and $X$ is 1-walk-regular if it is walk regular and…
Quantum walks (QWs) describe particles evolving coherently on a lattice. The internal degree of freedom corresponds to a Hilbert space, called coin system. We consider QWs on Cayley graphs of some group $G$. In the literature,…