相关论文: Continuous-time Quantum Walks on a Cycle Graph
We consider quantum walks on the cycle in the non-stationary case where the `coin' operation is allowed to change at each time step. We characterize, in algebraic terms, the set of possible state transfers and prove that, as opposed to the…
We quantitatively differentiate between the spreads of discrete-time quantum and classical random walks on a cyclic graph. Due to the closed nature of any cyclic graph, there is additional "collision"- like interference in the quantum…
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification.…
We consider the effect of different unitary noise mechanisms on the evolution of a quantum walk (QW) on a linear chain with a generic coin operation: (i) bit-flip channel noise, restricted to the coin subspace of the QW, and (ii)…
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of returns to original states are analyzed in resulting model.
A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…
Quantum walk is fundamental to designing many quantum algorithms. Here we consider the effects of quantum coherence and quantum entanglement for the quantum walk search on the complete bipartite graph. First, we numerically show the…
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
The subject of this paper is quantum walks, which are expected to simulate several kinds of quantum dynamical systems. In this paper, we define analyticity for quantum walks on Z. Almost all the quantum walks on $\mathbb{Z}$ which have been…
The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum information theory. In the present paper, we focus on discrete time quantum walks viewed as quantization of random…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. Searching in this mathematical framework has interested the community since a long time. However, most results consider spatial search…
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…
We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem…
This paper gives the quantum walks determined by graph zeta functions. The result enables us to obtain the characteristic polynomial of the transition matrix of the quantum walk, and it determines the behavior of the quantum walk. We treat…
In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size of lattice, we derive an explicit expression for the…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…