Related papers: Lackadaisical quantum walks on 2D grids with multi…
We propose a new multi-dimensional discrete-time quantum walk (DTQW), whose continuum limit is an extended multi-dimensional Dirac equation, which can be further mapped to the Schr\"{o}dinger equation. We show in two ways that our DTQW is…
The Maximum Matching problem has a quantum query complexity lower bound of $\Omega(n^{3/2})$ for graphs on $n$ vertices represented by an adjacency matrix. The current best quantum algorithm has the query complexity $O(n^{7/4})$, which is…
A new family of discrete-time quantum walks (DTQWs) on the line with an exact discrete $U(N)$ gauge invariance is introduced. It is shown that the continuous limit of these DTQWs, when it exists, coincides with the dynamics of a Dirac…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
We present a thorough classification of the isotropic quantum walks on lattices of dimension $d=1,2,3$ for cell dimension $s=2$. For $d=3$ there exist two isotropic walks, namely the Weyl quantum walks presented in Ref. [G. M. D'Ariano and…
In this work we study certain aspects of Open Quantum Random Walks (OQRWs), a class of quantum channels described by S. Attal et al. \cite{attal}. As a first objective we consider processes which are nonhomogeneous in time, i.e., at each…
We provide first evidence that under certain conditions, 1/2-spin fermions may naturally behave like a Grover search, looking for topological defects in a material. The theoretical framework is that of discrete-time quantum walks (QW), i.e.…
We consider the problem of searching a general $d$-dimensional lattice of $N$ vertices for a single marked item using a continuous-time quantum walk. We demand locality, but allow the walk to vary periodically on a small scale. By…
The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems,…
We present an idea to convert to a unitary quantum walk any open quantum walk which is defined on lattices as well as on finite graphs. This approach generalizes to the domain of open quantum walks (or quantum Markov chains) the framework…
A Quantum Walk (QW) simulating the flat $(1 + 2)$D Dirac Eq.\ on a spatial polar grid is constructed. Because fermions are represented by spinors, which do not constitute a representation of the rotation group, but rather of its double…
A two-dimensional discrete-time quantum walk (DTQW) can be realized by alternating a two-state DTQW in one spatial dimension followed by an evolution in the other dimension. This was shown to reproduce a probability distribution for a…
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…
We show that the hitting time of the discrete quantum walk on a symmetric Cayley graph over $\Z_2^n $ from a vertex to its antipodal is polynomial in degree of the graph. We prove that returning time of quantum walk on a symmetric Cayley…
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…
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,…
This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to…
Quantum random walks (QRWs) can be used to perform both quantum simulations and quantum algorithms. In order to exploit this potential, quantum walks on different types of graphs must be physically implemented. To this end we design, model…