Single quantum querying of a database

  title={Single quantum querying of a database},
  author={Barbara M. Terhal and John A. Smolin},
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 $Y$ 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… 

Figures from this paper

Quantum computers can search arbitrarily large databases by a single query
This paper shows that a quantum mechanical algorithm that can query information relating to multiple items of the database can search a database for a unique item satisfying a given condition, in a
A Quantum Computational Learning Algorithm
A natural extension of Fourier-based learning into the quantum domain is presented, which requires only an example oracle, and runs in O(sqrt(2^n) time, a result that appears to be classically impossible.
Query Complexity of Quantum Biased Oracles
The optimality of their algorithm is proved and a general method for designing robust algorithms querying biased oracles for solving various problems is shown, which is optimal in the sense that the additional number of queries tobiased oracles matches the lower bounds.
A quantum algorithm for examining oracles
In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some
Quantum Computer Algorithm for Parity Determination Based on Quantum Counting
A new quantum computer algorithm is proposed for determining the parity of function f(x) by using quantum counting algorithm, which is equivalent to determine the number of solutions, M, to an N item search problem.
Searching for quantum software
This thesis makes the case that evolutionary search techniques can be used to discover quantum circuits, quantum programs and ultimately new quantum algorithms, and presents a number of original results.
O ct 2 00 4 A quantum algorithm for examining oracles
This paper considers a quantum algorithm for solving the following problem: “Suppose f is a function given as a black box and f is invariant under some AND-mask and it extracts a global property of f (that is, invariance of f) while it neglects local properties of f.
Quantum search without entanglement
This paper presents methods for quantum search that give a speed-up over classical methods, but that do not require entanglement, and rely instead on interference to provide aSpeed-up.
Sophisticated quantum search without entanglement
  • Meyer
  • Computer Science, Physics
    Physical review letters
  • 2000
There is a quantum algorithm which searches a "sophisticated" database with a single query, but which it is shown does not require entanglement even for multiparticle implementations.
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
It is shown that, using the Goldreich-Levin Theorem, a quantum bit (or qubit) commitment scheme that is perfectly binding and computationally concealing can be obtained from any quantum one-way permutation.


Phase Information in Quantum Oracle Computing
Computational devices may be supplied with external sources of information (oracles). Quantum oracles may transmit phase information which is available to a quantum computer but not a classical
A fast quantum mechanical algorithm for database search
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
On the power of quantum computation
  • Daniel R. Simon
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.
Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract)
  • P. Shor
  • Computer Science, Mathematics
    FOCS 1994
  • 1994
This paper gives algorithms for the discrete log and the factoring problems that take random polynomial time on a quantum computer (thus giving the rst examples of quantum cryptanalysis).
Elements of Information Theory
The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.