Related papers: Continuous Time Quantum Walks in finite Dimensions
Discrete-time quantum walks (DTQWs) in random artificial electric and gravitational fields are studied analytically and numerically. The analytical computations are carried by a new method which allows a direct exact analytical…
In this paper, we consider Szegedy's walk, a type of discrete time quantum walk, and corresponding continuous time quantum walk related to the birth and death chain. We show that the scaling limit of time averaged distribution for the…
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…
We propose a general framework for quantum walks on d-dimensional spaces. We investigate asymptotic behavior of these walks. Among them, existence of limit distribution of homogeneous walks is proved. In this theorem, the support of the…
We investigate the behavior of coherence in scattering quantum walk search on complete graph under the condition that the total number of vertices of the graph is greatly larger than the marked number of vertices we are searching, $N \gg…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
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…
L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
We define the discrete-time quantum walk on complex networks and utilize it for community detection. We numerically show that the quantum walk with the Fourier coin is localized in a community to which the initial node belongs. Meanwhile,…
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state…
Though classical random walks have been studied for many years, research concerning their quantum analogues, quantum random walks, has only come about recently. Numerous simulations of both types of walks have been run and analyzed, and are…
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation…
A fully connected vertex $w$ in a simple graph $G$ of order $N$ is a vertex connected to all the other $N-1$ vertices. Upon denoting by $L$ the Laplacian matrix of the graph, we prove that the continuous-time quantum walk (CTQW) -- with…
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…
In this paper, we introduce hierarchical random walks at first. In this model, we use two types of random walkers, {global and local} walkers. The global walker chooses a local walker at every step, then the chosen local walker moves a…
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…
Continuous-time quantum walks have proven to be an extremely useful framework for the design of several quantum algorithms. Often, the running time of quantum algorithms in this framework is characterized by the quantum hitting time: the…
Quantum walks underlie an important class of quantum computing algorithms, and represent promising approaches in various simulations and practical applications. Here we design stroboscopically monitored quantum walks and their subsequent…
In arbitrary spatial dimension $d\ge 1$, we study a generalized model of random walks in a time-varying random environment (RWRE) defined by a stochastic flow of kernels. We consider the quenched probability distribution of the random…