Related papers: Limit Theorems For Quantum Walks Associated with H…
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…
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…
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of several domains (e.g., probability, statistical physics, computer science). The aim of this paper is to propose a new approach to obtain some…
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…
Limit-cycle oscillators are the basic building blocks for synchronization; yet, the notion of a quantum limit cycle has remained unclear. Here, we study quantum limit cycles and synchronization in the presence of continuous heterodyne…
We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. {[}Phys. Rev. Lett. \textbf{93}, 180601(2004){]} which exhibits…
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.…
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
We show that a large class of 2-adic Schr\"odinger equations is the scaling limit of certain continuous-time quantum Markov chains (CTQMCs). Practically, a discretization of such an equation gives a CTQMC. As a practical result, we…
We consider a quantized version of the Sinai-Derrida model for "random walk in random environment". The model is defined in terms of a Lindblad master equation. For a ring geometry (a chain with periodic boundary condition) it features a…
We apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…
Quantum discrete-time walkers have, since their introduction, demonstrated applications in algorithmic and in modeling and simulating a wide range of transport phenomena. They have long been considered the discrete-time and discrete space…
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…
We investigate continuous-time quantum walks of two fermionic atoms loaded in one-dimensional optical lattices with on-site interaction and subjected to a Zeeman field. The quantum walks are accompanied by spin-flipping processes. We…
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
In this paper, we work on a quantum walk whose system is manipulated by a five-diagonal unitary matrix, and present long-time limit distributions. The quantum walk launches off a location and delocalizes in distribution as its system is…
This letter treats the quantum random walk on the line determined by a 2 times 2 unitary matrix U. A combinatorial expression for the mth moment of the quantum random walk is presented by using 4 matrices, P, Q, R and S given by U. The…
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…