Related papers: A versatile quantum walk resonator with bright cla…
Quantum walks of correlated particles offer the possibility to study large-scale quantum interference, simulate biological, chemical and physical systems, and a route to universal quantum computation. Here we demonstrate quantum walks of…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
One can view quantum mechanics as a generalization of classical probability theory that provides for pairwise interference among alternatives. Adopting this perspective, we ``quantize'' the classical random walk by finding, subject to a…
Quantum walks contribute significantly to developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional quantum walk in the $d$-dimensional quantum domain, where $d>2$, and show its…
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The…
The preparation of initial superposition states of discrete-time quantum walks (DTQWs) are necessary for the study and applications of DTQWs. In linear optics, it is easy to prepare initial superposition states of the coin, which are always…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
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-…
The present letter gives a rigorous way from quantum to classical random walks by introducing an independent random fluctuation and then taking expectations based on a path integral approach.
We present an approach using quantum walks (QWs) to redistribute ultracold atoms in an optical lattice. Different density profiles of atoms can be obtained by exploiting the controllable properties of QWs, such as the variance and the…
Efficient and coherent data retrieval and storage are essential for harnessing quantum algorithms' speedup. Such a fundamental task is addressed by a quantum Random Access Memory (qRAM). Despite their promising scaling properties, current…
Quantum walks are considered in a one-dimensional random medium characterized by static or dynamic disorder. Quantum interference for static disorder can lead to Anderson localization which completely hinders the quantum walk and it is…
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…
Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various…
We introduce the driven discrete time quantum walk, where walkers are added during the walk instead of only at the beginning. This leads to interference in walker number and very different dynamics when compared to the original quantum…
We propose an implementation scheme for the continuous-time quantum walk using a diatomic molecule and an optical frequency comb. We show an analogy between the quantum walk and the cascade rotational transitions induced by the optical…
Quantum gates are crucial for processing quantum information, but implementing them in a photonic platform poses unique challenges due to the peculiar way photons propagate and interfere. Here, we examine quantum photonic gates that utilize…
In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph,…
We analyze the quantum walk on a cycle using discrete Wigner functions as a way to represent the states and the evolution of the walker. The method provides some insight on the nature of the interference effects that make quantum and…
We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas a continuous-time walk can effectively perform multiple walk…