Related papers: Increasing the efficiency of quantum walk with ent…
We use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As…
The split step quantum walk for two noninteracting particles is numerically simulated. The entropy of entanglement and spatial particle distributions are calculated for a range of initial states and for a range of disorder. The impact of…
Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here we present one dimensional three-state quantum walk(lazy quantum walk) and show its equivalence for circuit realization in ternary quantum…
Quenched randomness can have a dramatic effect on the dynamics of isolated 1D quantum many-body systems, even for systems that thermalize. This is because transport, entanglement, and operator spreading can be hindered by `Griffiths' rare…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
The evolution operator of a discrete-time quantum walk involves a conditional shift in position space which entangles the coin and position degrees of freedom of the walker. After several steps, the coin-position entanglement (CPE)…
One-dimensional discrete-time quantum walk has played an important role in development of quantum algorithms and protocols for different quantum simulations. The speedup observed in quantum walk algorithms is attributed to quantum…
Waves fail to propagate in random media. First predicted for quantum particles in the presence of a disordered potential, Anderson localization has been observed also in classical acoustics, electromagnetism and optics. Here, for the first…
We have studied carefully the behaviors of entangled qubits on the IBM Rochester with various connectivities and under a "noisy" environment. A phase trajectory analysis based on our measurements of the GHZ-like states is performed. Our…
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…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
We experimentally demonstrate a quantum walk on a line in phase space using one and two trapped ion. A walk with up to 23 steps is realized by subjecting an ion to state-dependent displacement operations interleaved with quantum coin…
An open quantum walk formalism for dissipative quantum computing is presented. The approach is illustrated with the examples of the Toffoli gate and the Quantum Fourier Transform for 3 and 4 qubits. It is shown that the algorithms based on…
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.…
Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…
We study a quantum walker on a one-dimensional lattice with a single defect site characterized by a phase. The spread and localization of discrete-time quantum walks starting at the impurity site are affected by the appearance of bound…
Recently, it was introduced a generalization of a nonstandard step operator named the elephant quantum walk (EQW). With proper statistical distribution for the steps, that generalized EQW (gEQW) can be tuned to exhibit a myriad of dynamical…
Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
We study the generation of hybrid entanglement in a one-dimensional quantum walk. In particular, we explore the preparation of maximally entangled states between position and spin degrees of freedom. We address it as an optimization…