Single quantum querying of a database

Details Single quantum querying of a database Single quantum querying of a database

1997-05-23

arxiv.org/abs/quant-ph/9705041v4

Phys.Rev.A58:1822,1998

Physics

Quantum Physics

Replaced with expanded version, 6 pages revtex, 12 November 1997. Replaced again to fix small typographical errors, submitted

Scientific paper

10.1103/PhysRevA.58.1822

We 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.

Affiliated with

Also associated with

No associations

Rating

Single quantum querying of a database does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Single quantum querying of a database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Single quantum querying of a database will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-551582