相关论文: Hitting time for quantum walks on the hypercube

We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…

We study the first detected recurrence time problem of continuous-time quantum walks on graphs. While previous works have employed projective measurements to determine the first return time, we implement a protocol based on weak…

Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…

We present analytical treatment of quantum walks on multidimensional hyper-cycle graphs. We derive the analytical expression of the probability distribution for strong and weak decoherence regimes. Upper bound to mixing time is obtained.

In this paper we unveil some features of a discrete-time quantum walk on the line whose coin depends on the temporal variable. After considering the most general form of the unitary coin operator, we focus on the role played by the two…

We present a study of the effects of decoherence in the operation of a discrete quantum walk on a line, cycle and hypercube. We find high sensitivity to decoherence, increasing with the number of steps in the walk, as the particle is…

We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…

Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node $u$ to reach node $v$. They have broad applications across domains such as network…

We study quantum Markov chains on graphs, described by completely positive maps, following the model due to S. Gudder (J. Math. Phys. 49, 072105, 2008) and which includes the dynamics given by open quantum random walks as defined by S.…

The continuous limit of one dimensional discrete-time quantum walks with time- and space-dependent coefficients is investigated. A given quantum walk does not generally admit a continuous limit but some families (1-jets) of quantum walks…

We obtain the uniform measure as a stationary measure of the one-dimensional discrete-time quantum walks by solving the corresponding eigenvalue problem. As an application, the uniform probability measure on a finite interval at a time can…

Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…

For any given vertices $u$ and $v$ in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex $v$ starting at vertex $u$. The expected value of the hitting time is the…

We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…

Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various…

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…

Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…

In the classical theory of Markov chains, one may study the mean time to reach some chosen state, and it is well-known that in the irreducible, finite case, such quantity can be calculated in terms of the fundamental matrix of the walk, as…

The effect of unitary noise on the discrete one-dimensional quantum walk is studied using computer simulations. For the noiseless quantum walk, starting at the origin (n=0) at time t=0, the position distribution Pt(n) at time t is very…

I obtain the dynamics of the continuous time quantum walk on a $d$-dimensional lattice, with periodic boundary conditions, as an appropriate limit of the dynamics of the discrete time quantum walk on the same lattice. This extends the main…