Related papers: Mapping a quantum walk by tuning the coupling coef…
We suggest a theoretical scheme for the simulation of quantum random walks on a line using beam splitters, phase shifters and photodetectors. Our model enables us to simulate a quantum random walk with use of the wave nature of classical…
Photonic circuits, engineered to couple optical modes according to a specific map, serve as processors for classical and quantum light. The number of components typically scales with that of processed modes, thus correlating system size,…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the…
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…
Quantum walks have a host of applications, ranging from quantum computing to the simulation of biological systems. We present an intrinsically stable, deterministic implementation of discrete quantum walks with single photons in space. The…
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…
The development of quantum walks in the context of quantum computation, as generalisations of random walk techniques, led rapidly to several new quantum algorithms. These all follow unitary quantum evolution, apart from the final…
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…
Photonics provide an efficient way to implement quantum walks, the quantum analogue of classical random walk that demonstrates rich physics with potential applications. However, most photonic quantum walks do not involve photon…
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…
Quantum walks in an elaborately designed graph, is a powerful tool simulating physical and topological phenomena, constructing analog quantum algorithms and realizing universal quantum computing. Integrated photonics technology has emerged…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
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 random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
We present a study demonstrating how random walk algorithms can be used for evolutionary image transition. We design different mutation operators based on uniform and biased random walks and study how their combination with a baseline…
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…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is…