Related papers: Integrated photonic 3D waveguide arrays for quantu…
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 investigate the counterparts of random walk in universal quantum computing and their implementation using standard quantum circuits. Quantum walk have been recently well investigated for traversing graphs with certain oracles. We focus…
There is great interest in designing photonic devices capable of disorder-resistant transport and information processing. In this work we propose to exploit 3D integrated photonic circuits in order to realize 2D discrete-time quantum walks…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
Open quantum walks (OQWs) are a new type of quantum walks which are entirely driven by the dissipative interaction with external environments and are formulated as completely positive trace-preserving maps on graphs. A generalized quantum…
The quantum walk (QW) has proven to be a valuable testbed for fundamental inquiries in quantum technology applications such as quantum simulation and quantum search algorithms. Many benefits have been found by exploring implementations of…
Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen…
A new model of nonlinear charged quantum relativistic fluids is presented. This model can be discretized into Discrete Time Quantum Walks (DTQWs), and a new hybrid (quantum-classical) algorithm for implementing these walks on NISQ devices…
Quantum walk is a key operation in quantum computing, simulation, communication and information. Here, we report for the first time the demonstration of quantum walks and localized quantum walks in a new type of optical fibers having a ring…
Quantum walks have proven to be a universal model for quantum computation and to provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) model, among others, is one of the most suitable candidates for circuit…
Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…
The transversely confined propagating light modes of a nano-photonic optical waveguide or nanofiber can mediate effectively infinite-range forces. We show that for a linear chain of particles trapped within the waveguide's evanescent field,…
Multi-photon quantum walks in integrated optics are an attractive controlled quantum system, that can mimic less readily accessible quantum systems and exhibit behavior that cannot in general be accurately replicated by classical light…
In this work we seek to generalize the connection between traversable wormholes and quantum channels. We do this via a connection between traversable wormholes and graph geometries on which we can perform quantum random walks for signal…
Classical optics can be used to efficiently implement certain quantum information processing tasks with a high degree of control, for example, one-dimensional quantum walks through the space of orbital angular momentum of light directed by…
The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…
A quantum walk whose continuous limit coincides with Dirac equation is usually called a Dirac Quantum Walk (DQW). A new systematic method to build DQWs coupled to electromagnetic (EM) fields is introduced and put to test on several examples…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
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…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective…