Related papers: Quantum walks on quotient graphs
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
We propose categories of $1$-dimensional and multi-dimensional quantum walks. In the categories, an object is a quantum walk, and a morphism is an intertwining operator between two quantum walks. The new framework enables us to discuss…
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum…
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…
It has been proved by Kempe that discrete quantum walks on the hypercube (HC) hit exponentially faster than the classical analog. The same was also observed numerically by Krovi and Brun for a slightly different property, namely, the…
The theory of random walks on finite graphs is well developed with numerous applications. In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. They have been…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
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…
There are few known exponential speedups for quantum algorithms and these tend to fall into even fewer families. One speedup that has mostly resisted generalization is the use of quantum walks to traverse the welded-tree graph, due to…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are…
We consider to what extent quantum walks can constitute models of thermalization, analogously to how classical random walks can be models for classical thermalization. In a quantum walk over a graph, a walker moves in a superposition of…
In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
The interest in quantum walks has been steadily increasing during the last two decades. It is still worth to present new forms of quantum walks that might find practical applications and new physical behaviors. In this work, we define…
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every…
The time evolutions of discrete-time quantum walks on graphs are determined by the local adjacency relations of the graphs. In this paper, first, we construct a discrete-time quantum walk model that reflects the embedding on the surface so…
A new approach to quantum walks is presented. Considering a quantum system undergoing some unitary discrete-time evolution in a directed graph G, we think of the vertices of G as sites that are occupied by the quantum system, whose internal…
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…