Related papers: Quantum walks on a programmable two-dimensional 62…
We investigate continuous-time quantum walks of two indistinguishable particles (bosons, fermions or hard-core bosons) in one-dimensional lattices with nearest-neighbour interactions. The two interacting particles can undergo independent-…
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…
We show that the coined quantum walk on a line can be understood as an interference phenomenon, can be classically implemented, and indeed already has been. The walk is essentially two independent walks associated with the different coin…
Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like superposition, entanglement, and tunneling. Quantum walks (QWs)…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle…
Exploiting multi-dimensional quantum walks as feasible platforms for quantum computation and quantum simulation is attracting constantly growing attention from a broad experimental physics community. Here, we propose a two-dimensional…
We propose a scheme to implement the one-dimensional coined quantum walk with electrons transported through a two-dimensional network of spintronic semiconductor quantum rings. The coin degree of freedom is represented by the spin of the…
We present a mathematical formalism for the description of unrestricted quantum walks with entangled coins and one walker. The numerical behaviour of such walks is examined when using a Bell state as the initial coin state, two different…
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…
We present a discrete-time, one-dimensional quantum walk based on the entanglement between the momentum of ultracold rubidium atoms (the walk space) and two internal atomic states (the "coin" degree of freedom). Our scheme is highly…
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…
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…
Quantum walks represent an excellent testbed for investigating the interplay between unitary coherent and incoherent dissipative processes. Thanks to photonic quantum interferometers of considerable size, experimental studies could be…
We implement a quantum walk in phase space with a new mechanism based on the superconducting resonator-assisted double quantum dots. By analyzing the hybrid system, we obtain the necessary factors of realization of a quantum walk in phase…
We implement the proof of principle for the quantum walk of one ion in a linear ion trap. With a single-step fidelity exceeding 0.99, we perform three steps of an asymmetric walk on the line. We clearly reveal the differences to its…
We report on a discrete-time quantum walk that uses the momentum of ultra-cold rubidium-87 atoms as the walk space and two internal atomic states as the coin degree of freedom. Each step of the walk consists of a coin toss (a microwave…
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal quantum gate set. In this paper, we examine computation by quantum walks in terms of language…
Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM are presented up to now. It is desired to design more QWM for research, so that we can explore the…
A novel bulk optics scheme for quantum walks is presented. It consists of a one-dimensional lattice built on two concatenated displaced Sagnac interferometers that make it possible to reproduce all the possible trajectories of an optical…