56 citations · 101 across the 2 of their papers we have counts for
2 papers
quant-ph1997★ 56 cited
Single quantum querying of a database
B. M. Terhal, J. A. Smolin
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 in a single query. The…
quant-ph1996★ 45 cited
The Parity Bit in Quantum Cryptography
C. H. Bennett, T. Mor, J. A. Smolin
An -bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that -bit string is described by one of two density matrices, and $ρ_1…