相关论文: Continuous-time quantum walks on the symmetric gro…

We study the distributions of the continuous-time quantum walk on a one-dimensional lattice. In particular we will consider walks on unbounded lattices, walks with one and two boundaries and Dirichlet boundary conditions, and walks with…

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…

In discrete time, coined quantum walks, the coin degrees of freedom offer the potential for a wider range of controls over the evolution of the walk than are available in the continuous time quantum walk. This paper explores some of the…

We introduce quantum walks on Cayley graphs of non-Abelian groups. We focus on the easiest case of virtually Abelian groups, and introduce a technique to reduce the quantum walk to an equivalent one on an Abelian group with coin system…

Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…

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,…

Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…

Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…

The finite dihedral group generated by one rotation and one flip is the simplest case of the non-abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the…

The discrete time quantum walk defined as a quantum-mechanical analogue of the discrete time random walk have recently been attracted from various and interdisciplinary fields. In this review, the weak limit theorem, that is, the asymptotic…

We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…

We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…

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…

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…

This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…

The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…

We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…

For quantum search via the continuous-time quantum walk, the evolution of the whole system is usually limited in a small subspace. In this paper, we discuss how the symmetries of the graphs are related to the existence of such an invariant…

A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…

The method of the quantum probability theory only requires simple structural data of graph and allows us to avoid a heavy combinational argument often necessary to obtain full description of spectrum of the adjacency matrix. In the present…