Single quantum querying of a database

Simple item page
dc.creatorTerhal, B. M.
dc.creatorSmolin, J. A.
dc.date1997-05-23
dc.date1997-11-14
dc.date.accessioned2026-07-07T12:22:43Z
dc.date.available2026-07-07T12:22:43Z
dc.descriptionWe present a class of fast quantum algorithms, based on Bernstein and Vazirani's parity problem, that retrieve the entire contents of a quantum database $Y$ in a single query. The class includes binary search problems and coin-weighing problems. Our methods far exceed the efficiency of classical algorithms which are bounded by the classical information-theoretic bound. We show the connection between classical algorithms based on several compression codes and our quantum-mechanical method.
dc.descriptionReplaced with expanded version, 6 pages revtex, 12 November 1997. Replaced again to fix small typographical errors, submitted to Phys. Rev. A
dc.identifierhttps://arxiv.org/abs/quant-ph/9705041
dc.identifierhttp://arxiv.org/abs/quant-ph/9705041
dc.identifierPhys.Rev.A58:1822,1998
dc.identifierdoi:10.1103/PhysRevA.58.1822
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/213744
dc.subjectQuantum Physics
dc.titleSingle quantum querying of a database
dc.typetext

Files

Collections

arXiv