Related papers: Experimental Implementation of Quantum Walks on IB…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
For quantum computation using photons, performing deterministic quantum gate operations is a challenge due to the probabilistic nature of the photon-photon interaction. Encoding qubits in multiple degrees-of-freedom of photons and…
The quantum random walk is a possible approach to construct new quantum algorithms. Several groups have investigated the quantum random walk and experimental schemes were proposed. In this paper we present the experimental implementation of…
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-…
In this letter we introduce the concept of a driven quantum walk. This work is motivated by recent theoretical and experimental progress that combines quantum walks and parametric down- conversion, leading to fundamentally different…
The quantum walk is the quantum analogue of the well-known random walk, which forms the basis for models and applications in many realms of science. Its properties are markedly different from the classical counterpart and might lead to…
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 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…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
We examine the physical implementation of a discrete time quantum walk with a four-dimensional coin. Our quantum walker is a photon moving repeatedly through a time delay loop, with time being our position space. The quantum coin is…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
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.…
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…
Program implementation and simulation are essential for research in the field of quantum algorithms. However, complex and large-scale quantum algorithms can pose challenges for existing quantum programming languages and simulators. Here, we…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
We introduce the quantum quincunx, which physically demonstrates the quantum walk and is analogous to Galton's quincunx for demonstrating the random walk. In contradistinction to the theoretical studies of quantum walks over orthogonal…
The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. Here we propose an alternative approach; we use a…
We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point…
Despite the rapid development of quantum computing these years, state-of-the-art quantum devices still contain only a very limited number of qubits. One possible way to execute more realistic algorithms in near-term quantum devices is to…
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard…