Related papers: Quantum walk on a ladder

Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for…

We study the motion of two non-interacting quantum particles performing a random walk on a line and analyze the probability that the two particles are detected at a particular position after a certain number of steps (meeting problem). The…

Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We…

We employ the broken-link model to create a barrier with slits in a two-dimensional lattice. The diffraction and interference patterns of the probability distribution of quantum walkers passing through the slits are analyzed. Simulations…

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…

Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…

A return probability of random walks is one of the interesting subjects. As it is well known, the return probability strongly depends on the structure of the space where the random waker moves. On the other hand, the return probability of…

The dynamics of the survival probability of quantum walkers on a one-dimensional lattice with random distribution of absorbing immobile traps are investigated. The survival probability of quantum walkers is compared with that of classical…

In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph,…

The quantum random walk is a possible approach to construct new quantum algorithms. Several groups have investigated the quantum random walk and experimental schemes were proposed. In this paper we present the experimental implementation of…

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…

It has been discovered that open quantum walks diffusively distribute in space, since they were introduced in 2012. Indeed, some limit distributions have been demonstrated and most of them are described by Gaussian distributions. We operate…

The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…

We study one-dimensional quantum walk with four internal degrees of freedom resulted from two entangled qubits. We will demonstrate that the entanglement between the qubits and its corresponding coin operator enable one to steer the…

Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…

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…

The probability distributions of discrete-time quantum walks have been often investigated, and many interesting properties of them have been discovered. The probability that the walker can be find at a position is defined by diagonal…

A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…

It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…

We consider a continuous-time quantum walk on a triple graph and investigate the influence of the side chain on the propagation in the main chain. Calculating the interchange of the probabilities between the two parts of the main chain, we…