相关论文: Mixing-time and large-decoherence in continuous-ti…

In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…

We present a highly efficient quantum circuit for performing continuous time quantum walks (CTQWs) over an exponentially large set of combinatorial objects, provided that the objects can be indexed efficiently. CTQWs form the core mixing…

Coupled quantum dots are an example of the ubiquitous quantum double potential well. In a typical transport experiment, each quantum dot is also coupled to a continuum of states. Our approach takes this into account by using a Green's…

Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…

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

Quantum walks are dynamic systems with a wide range of applications in quantum computation and quantum simulation of analog systems, therefore it is of common interest to understand what changes from an isolated process to one embedded in…

We introduce an analytically treatable spin decoherence model for quantum walk on a line that yields the exact position probability distribution of an unbiased classical random walk at all-time scales. This spin decoherence model depicts a…

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…

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…

Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence…

The propagation by continuous time quantum walks (CTQWs) on one-dimensional lattices shows structures in the transition probabilities between different sites reminiscent of quantum carpets. For a system with periodic boundary conditions, we…

We discuss decoherence in discrete-time quantum walks in terms of a phenomenological model that distinguishes spin and spatial decoherence. We identify the dominating mechanisms that affect quantum walk experiments realized with neutral…

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 study the coherent exciton transport of continuous-time quantum walks (CTQWs) on Erdos-Renyi networks. The Erdos-Renyi network of N nodes is constructed by connecting every pair of nodes with probability $p$. We numerically calculate the…

We consider the quantum mechanical transport of (coherent) excitons on small-world networks (SWN). The SWN are build from a one-dimensional ring of N nodes by randomly introducing B additional bonds between them. The exciton dynamics is…

We study the problem of site recurrence of discrete time nearest neighbor open quantum random walks (OQWs) on the integer line, proving basic properties and some of its relations with the corresponding problem for unitary (coined) quantum…

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…

Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…

We consider coherent exciton transport modeled by continuous-time quantum walks (CTQWs) on long-range interacting cycles (LRICs), which are constructed by connecting all the two nodes of distance $m$ in the cycle graph. LRIC has a symmetric…

A number of recent studies have investigated the introduction of decoherence in quantum walks and the resulting transition to classical random walks. Interestingly, it has been shown that algorithmic properties of quantum walks with…