Andrew W. Cross, David P. Divincenzo, et al.
Quantum Information and Computation
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. © 1998 The American Physical Society.
Andrew W. Cross, David P. Divincenzo, et al.
Quantum Information and Computation
Graeme Smith, John A. Smolin, et al.
IEEE Trans. Inf. Theory
Felix Leditzky, Debbie Leung, et al.
Physical Review Letters
David McKay, Sarah Sheldon, et al.
Physical Review Letters