Related papers: Experimental Two-dimensional Quantum Walk on a Pho…
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always…
Quantum random walks are shown to have non-intuitive dynamics, which makes them an attractive area of study for devising quantum algorithms for well-known classical problems as well as those arising in the field of quantum computing. In…
Quantum walks with one-dimensional translational symmetry are important for quantum algorithms, where the speed-up of the diffusion speed can be reached if long-range couplings are added. Our work studies a scheme of a ring under the strong…
Quantum evolution is crucial for the understanding of complex quantum systems. However, current implementations of time evolution on quantum photonic platforms are limited by both low photon generation efficiency and high propagation loss,…
Graph representations are a powerful concept for solving complex problems across natural science, as patterns of connectivity can give rise to a multitude of emergent phenomena. Graph-based approaches have proven particularly fruitful in…
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior…
Full control over the dynamics of interacting, indistinguishable quantum particles is an important prerequisite for the experimental study of strongly correlated quantum matter and the implementation of high-fidelity quantum information…
As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide…
Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks…
Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in…
We explore a continuous-time quantum walk starting at a single vertex on the discrete path and cycle with a cubic nonlinearity. Such nonlinearities arise in Bose-Einstein condensates described by the Gross-Pitaevskii equation or by…
Several research groups are giving special attention to quantum walks recently, because this research area have been used with success in the development of new efficient quantum algorithms. A general simulator of quantum walks is very…
We propose a novel implementation of discrete time quantum walks for a neutral atom in an array of optical microtraps or an optical lattice. We analyze a one-dimensional walk in position space, with the coin, the additional qubit degree of…
We show that with the addition of multiple walkers, quantum walks on a line can be transformed into lattice graphs of higher dimension. Thus, multi-walker walks can simulate single-walker walks on higher dimensional graphs and vice versa.…
We demonstrate quantum walks of correlated photons in a 2D network of directly laser written waveguides coupled in a 'swiss cross' arrangement. The correlated detection events show high-visibility quantum interference and unique composite…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…
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…
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…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…