A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches

Simple item page
dc.creatorYounes, Ahmed
dc.creatorRowe, Jon
dc.creatorMiller, Julian
dc.date2003-11-25
dc.date.accessioned2026-07-07T09:54:51Z
dc.date.available2026-07-07T09:54:51Z
dc.descriptionIn this paper we will present a quantum algorithm which works very efficiently in case of multiple matches within the search space and in the case of few matches, the algorithm performs classically. This allows us to propose a hybrid quantum search engine that integrates Grover's algorithm and the proposed algorithm here to have general performance better that any pure classical or quantum search algorithm.
dc.description26 pages, 8 Figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0311171
dc.identifierhttp://arxiv.org/abs/quant-ph/0311171
dc.identifierIn Proceeding of ICENCO2006 (2006)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166468
dc.subjectQuantum Physics
dc.titleA Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches
dc.typetext

Files

Collections

arXiv