A Novel Approach to Quantum Heuristics for Structured Database Search

Simple item page
dc.creatorMurphy, Brian
dc.date2001-06-27
dc.date.accessioned2026-07-07T06:02:20Z
dc.date.available2026-07-07T06:02:20Z
dc.descriptionAn algorithm for structured database searching is presented and used to solve the set partition problem. O(n) oracle calls are required in order to obtain a solution, but the probability that this solution is optimal decreases exponentially with problem size. Each oracle call is followed by a measurement, implying that it is necessary to maintain quantum coherence for only one oracle call at a time.
dc.description17 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0106152
dc.identifierhttp://arxiv.org/abs/quant-ph/0106152
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89568
dc.subjectQuantum Physics
dc.titleA Novel Approach to Quantum Heuristics for Structured Database Search
dc.typetext

Files

Collections

arXiv