Related papers: Hitting time for quantum walks on the hypercube
It is known that under some assumptions the hitting time in quantum Markov chains is quadratically smaller than the hitting time in classical Markov chains. This work extends this result for decoherent quantum Markov chains. The decoherence…
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.…
We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. classical time-dependent fluctuations affecting the tunneling amplitudes of…
Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such…
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…
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…
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…
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where 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…
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the…
The intuitive classical space-time picture breaks down in quantum gravity, which makes a comparison and the development of semiclassical techniques quite complicated. Using ingredients of the group averaging method to solve constraints one…
We explore a discrete-time, coined quantum walk on a quantum network where the coherent superposition of walker-moves originates from the unitary interaction of the walker-coin with the qubit degrees of freedom in the quantum network. 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 show how to search N items arranged on a $\sqrt{N}\times\sqrt{N}$ grid in time $O(\sqrt N \log N)$, using a discrete time quantum walk. This result for the first time exhibits a significant difference between discrete time and continuous…
How self-loops on vertices affect quantum walks is an interesting issue, and self-loops play important roles in quantum walk based algorithms. However, the original model that adjusting the effect of self-loops by changing their number has…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
We set the criteria under which superposition of causal order can be incorporated in to quantum walks. In particular, we show that only periodic quantum walks or those with at least one disorder exhibit Superposition of causal order under…
Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…
Quantum walks subject to decoherence generically suffer the loss of their genuine quantum feature, a quadratically faster spreading compared to classical random walks. This intuitive statement has been verified analytically for certain…