Single quantum querying of a database

Terhal, B.M.; Smolin, John A.

Single quantum querying of a database

Journal article (1998)

Authors

B.M. Terhal Universiteit van Amsterdam

John A. Smolin IBM Thomas J. Watson Research Centre

Affiliation

External organisation

To reference this document use:

http://resolver.tudelft.nl/uuid:89700e2f-59d7-4847-8aeb-25be3dcdd5d4

More Info

expand_more

Published Date

1998

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

We present a class of fast quantum algorithms, based on Bernstein and Vazirani’s parity problem, that retrieves the entire contents of a quantum database [Formula Presented] in a single query. The class includes binary search problems and coin-weighing problems. We compare the efficiency of these quantum algorithms with the classical algorithms that 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.

No files available

Metadata only record. There are no files for this journal article.