Quantum walk based search algorithms

Simple item page
dc.creatorSantha, Miklos
dc.date2008-08-01
dc.date.accessioned2026-07-07T09:54:14Z
dc.date.available2026-07-07T09:54:14Z
dc.descriptionIn this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum analogues of classical search procedures. We present a rather detailed description of a somewhat simplified version of the MNRS algorithm. Finally, in the query complexity model, we show how quantum walks can be applied to the following search problems: Element Distinctness, Matrix Product Verification, Restricted Range Associativity, Triangle, and Group Commutativity.
dc.description16 pages, survey paper
dc.identifierhttps://arxiv.org/abs/0808.0059
dc.identifierhttp://arxiv.org/abs/0808.0059
dc.identifier5th Theory and Applications of Models of Computation (TAMC08), Xian, April 2008, LNCS 4978, 31-46
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166237
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.titleQuantum walk based search algorithms
dc.typetext

Files

Collections

arXiv