Related papers: Wigner formula of rotation matrices and quantum wa…
In the literature, there are numerous studies of one-dimensional discrete-time quantum walks (DTQWs) using a moving shift operator. However, there is no exact solution for the limiting probability distributions of DTQWs on cycles using a…
We demonstrate a quantum walk with time-dependent coin bias. With this technique we realize an experimental single-photon one-dimensional quantum walk with a linearly-ramped time-dependent coin flip operation and thereby demonstrate two…
Properties of the probability distribution generated by a discrete-time quantum walk, such as the number of peaks it contains, depend strongly on the choice of the initial condition. In the present paper we discuss from this point of view…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. {[}Phys. Rev. Lett. \textbf{93}, 180601(2004){]} which exhibits…
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.…
We examine the physical implementation of a discrete time quantum walk with a four-dimensional coin. Our quantum walker is a photon moving repeatedly through a time delay loop, with time being our position space. The quantum coin is…
It has been observed that quantum walks on regular lattices can give rise to wave equations for relativistic particles in the continuum limit. In this paper we define the 3D walk as a product of three coined one-dimensional walks. The…
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…
A quantum walk on a toral phase space involving translations in position and its conjugate momentum is studied in the simple context of a coined walker in discrete time. The resultant walk, with a family of coins parametrized by an angle is…
The randomized quantum marginal problem asks about the joint distribution of the partial traces ("marginals") of a uniform random Hermitian operator with fixed spectrum acting on a space of tensors. We introduce a new approach to this…
We introduce quantized bipartite walks, compute their spectra, generalize the algorithms of Grover \cite{g} and Ambainis \cite{amb03} and interpret them as quantum walks with memory. We compare the performance of walk based classical and…
Quantum walk research has mainly focused on evolutions due to repeated applications of time-independent unitary coin operators. However, the idea of controlling the single particle evolution using time-dependent unitary coins has still been…
Quantum walk models have been used as an algorithmic tool for quantum computation and to describe various physical processes. This paper revisits the relationship between relativistic quantum mechanics and the quantum walks. We show the…
In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations,…
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…
A relativistic Wigner function for free Discrete Time Quantum Walks (DTQWs) on the square $2D$ space-time lattice is defined. Useful concepts such as discrete derivatives and discrete distributions are also introduced. The transport…
In quantum computation theory, quantum random walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. However, due to the importance of the quantum decoherence…
Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with…
The study of quantum walk processes has been widely divided into two standard variants, the discrete-time quantum walk (DTQW) and the continuous-time quantum walk (CTQW). The connection between the two variants has been established by…