* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download A quantum walk based search algorithm, and its optical realisation
Wave–particle duality wikipedia , lookup
Relativistic quantum mechanics wikipedia , lookup
Topological quantum field theory wikipedia , lookup
Renormalization group wikipedia , lookup
Theoretical and experimental justification for the Schrödinger equation wikipedia , lookup
Bell test experiments wikipedia , lookup
Renormalization wikipedia , lookup
Double-slit experiment wikipedia , lookup
Basil Hiley wikipedia , lookup
Scalar field theory wikipedia , lookup
Quantum decoherence wikipedia , lookup
Probability amplitude wikipedia , lookup
Measurement in quantum mechanics wikipedia , lookup
Particle in a box wikipedia , lookup
Density matrix wikipedia , lookup
Bohr–Einstein debates wikipedia , lookup
Path integral formulation wikipedia , lookup
Quantum electrodynamics wikipedia , lookup
Quantum field theory wikipedia , lookup
Copenhagen interpretation wikipedia , lookup
Delayed choice quantum eraser wikipedia , lookup
Hydrogen atom wikipedia , lookup
Quantum entanglement wikipedia , lookup
Coherent states wikipedia , lookup
Bell's theorem wikipedia , lookup
Quantum dot wikipedia , lookup
Many-worlds interpretation wikipedia , lookup
Quantum fiction wikipedia , lookup
Symmetry in quantum mechanics wikipedia , lookup
Orchestrated objective reduction wikipedia , lookup
EPR paradox wikipedia , lookup
Quantum teleportation wikipedia , lookup
Interpretations of quantum mechanics wikipedia , lookup
History of quantum field theory wikipedia , lookup
Quantum computing wikipedia , lookup
Quantum group wikipedia , lookup
Canonical quantization wikipedia , lookup
Quantum state wikipedia , lookup
Quantum machine learning wikipedia , lookup
Quantum cognition wikipedia , lookup
A quantum walk based search algorithm, and its optical realisation Aurél Gábris FJFI, Czech Technical University in Prague [email protected] Abstract Quantum walks are quantum mechanical generalisations of classical random walks. Quantum walks are considered as a promising tool for the construction of efficient quantum algorithms: a key challenge for the practical use of a future quantum computer. Among other applications, the quantum walk paradigm has been successfully used for designing quantum search algorithms. I will begin my talk with an introduction to quantum walks on general graphs, and discuss a particular quantum walk search algorithm by Shenvi, Kempe and Whaley (SKW) [1]. Although the SKW algorithm’s complexity scales with the size of the search space identically to the Grover’s search, there are some subtle differences, which will also be discussed. Following, I will present an optical network that can be used for the realization of the SKW quantum walk search algorithm, providing a good example for a spatial search. I will briefly recall our results on the analysis of the impact of photon loss and phase imperfections, which are typical sources of errors in this particular physical system [2]. References [1] N. Shenvi, J. Kempe, and K. B. Whaley, Phys. Rev. A 67, 052307 (2003). [2] A. Gábris, T. Kiss, and I. Jex, Phys. Rev. A 76, 062315 (2007).