相关论文: Scattering model for quantum random walk on the hy…

We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of…

We consider two independent quantum walks on separate lines augmented by partial or full swapping of coins after each step. For classical random walks, swapping or not swapping coins makes little difference to the random walk…

Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…

Quantum random walk in a two-dimensional lattice with randomly distributed traps is investigated. Distributions of quantum walkers are evaluated dynamically for the cases of Hadamard, Fourier, and Grover coins, and quantum to classical…

Quantum walks are considered to be quantum counterparts of random walks.They show us impressive probability distributions which are different from those of random walks.That fact has been precisely proved in terms of mathematics and some of…

Quantum random walks are shown to have non-intuitive dynamics, which makes them an attractive area of study for devising quantum algorithms for well-known classical problems as well as those arising in the field of quantum computing. In…

We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum…

This paper examines the stability of the quantum random walk search algorithm, when the walk coin is constructed by generalized Householder reflection and additional phase shift, against inaccuracies in the phases used to construct the…

In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…

The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…

We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead…

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…

We apply a discrete quantum walk from a quantum particle on a discrete quantum spacetime from loop quantum gravity and show that the related Entanglement Entropy can drive a entropic force. We apply this concepts to propose a model of a…

A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…

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…

Quantum random walks (QRWs) are random processes in which the resulting probability density of the "walker" state, whose movement is governed by a "coin" state, is described in a non-classical manner. Previously, Q-plates have been used to…

In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum…

Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in presence percolation and decoherence. We consider…

In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is…

We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…