Related papers: Quantum walks of correlated particles

Inspired by recent breakthroughs with topological quantum materials, which pave the way to novel, high-efficiency, low-energy magnetoelectric devices and fault-tolerant quantum information processing, inter alia, topological quantum walks…

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 demonstrate an implementation of unambiguous state discrimination of two equally probable single-qubit states via a one-dimensional photonic quantum walk experimentally. Furthermore we experimentally realize a quantum walk algorithm for…

We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…

This PhD thesis is dedicated to the study of the interplay between symmetries of quantum states and their self-similar properties. It consists of three connected threads of research: polynomial invariants for multiphoton states,…

We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert…

Quantum walk is fundamental to designing many quantum algorithms. Here we consider the effects of quantum coherence and quantum entanglement for the quantum walk search on the complete bipartite graph. First, we numerically show the…

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…

In this work we propose a measure for the quantum discord of indistinguishable particles, based on the definition of entanglement of particles given in [H. M. Wiseman et al., Phis. Rev. Lett 91, 097902 (2003)]. This discord of particles is…

Measurements on a quantum particle unavoidably affect its state, since the otherwise unitary evolution of the system is interrupted by a non-unitary projection operation. In order to probe measurement-induced effects in the state dynamics…

The concept of open quantum walks (OQW), quantum walks exclusively driven by the interaction with the external environment, is reviewed. OQWs are formulated as discrete completely positive maps on graphs. The basic properties of OQWs are…

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.…

Quantum walks have been shown to be fruitful tools in analysing the dynamic properties of quantum systems. This article proposes to use quantum walks as an approach to Quantum Neural Networks (QNNs). QNNs replace binary McCulloch-Pitts…

Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to…

Multiple bosons undergoing coherent evolution in a coupled network of sites constitute a so-called quantum walk system. The simplest example of such a two-particle interference is the celebrated Hong-Ou-Mandel interference. When scaling to…

We study a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices. These Scattering Quantum Walks model the discrete dynamics of a system on the edges of the graph, with a scattering process at…

Quantum walk acts obviously different from its classical counterpart, but decoherence will lessen and close the gap between them. To understand this process, it is necessary to investigate the evolution of quantum walk under different…

Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…

We present a study of the effects of decoherence in the operation of a discrete quantum walk on a line, cycle and hypercube. We find high sensitivity to decoherence, increasing with the number of steps in the walk, as the particle is…

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…