Related papers: Spectral Properties of Quantum Walks on Rooted Bin…
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>…
Classical random walks on finite graphs have an underrated property: a walk from any vertex can reach every other vertex in finite time, provided they are connected. Discrete-time quantum walks on finite connected graphs however, can have…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
We consider the effect of different unitary noise mechanisms on the evolution of a quantum walk (QW) on a linear chain with a generic coin operation: (i) bit-flip channel noise, restricted to the coin subspace of the QW, and (ii)…
Quantum walks have been shown to be fruitful tools in analysing the dynamic properties of quantum systems. This article proposes to use quantum walks as an approach to Quantum Neural Networks (QNNs). QNNs replace binary McCulloch-Pitts…
Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are…
We study a 2-D disordered time-discrete quantum walk based on 1-D `generalized elephant quantum walk' where an entangling coin operator is assumed and which paves the way to a new set of properties. We show that considering a given disorder…
We present a general account on the stationary scattering theory for unitary operators in a two-Hilbert spaces setting. For unitary operators $U_0,U$ in Hilbert spaces ${\cal H}_0,{\cal H}$ and for an identification operator $J:{\cal…
The unitary evolution maps in closed chaotic quantum graphs are known to have universal spectral correlations, as predicted by random matrix theory. In chaotic graphs with absorption the quantum maps become non-unitary. We show that their…
In this article we show that for any quantum walker with \textit{m}-dimensional coin subspace, we have $m^2\times m^2$ specific constant matrix $\mathcal{C}$ where it completely determines the asymptotic reduced density matrix of the…
One-dimensional discrete-time quantum walks show a rich spectrum of topological phases that have so far been exclusively analysed in momentum space. In this work we introduce an alternative approach to topology which is based on the…
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…
We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…
This study investigated the unitary equivalent classes of one-dimensional quantum walks. We determined the unitary equivalent classes of one-dimensional quantum walks, two-phase quantum walks with one defect, complete two-phase quantum…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
In this paper we study a class of discrete quantum walks, known as bipartite walks. These include the well-known Grover's walks. Any discrete quantum walk is given by the powers of a unitary matrix $U$ indexed by arcs or edges of the…
The conventional spectral mapping theorem for quantum walks can only be applied for walks employing a shift operator whose square is the identity. This theorem gives most of the eigenvalues of the time evolution $U$ by lifting the…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
This paper is a continuation of the paper \cite{W} by the third author, which studied quantum walks with special long-range perturbations of the coin operator. In this paper, we consider general long-range perturbations of the coin operator…
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…