no code implementations • 6 Dec 2011 • Mark Adcock, Peter Hoyer, Barry C. Sanders
The model is effective for problems where symmetries between the structure of the information associated with the problem and the structure of the unitary operators employed in the quantum algorithm can be exploited.
Quantum Physics
no code implementations • 11 Aug 2011 • Gilles Brassard, Peter Hoyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
Two of us showed in 2008 that Merkle's schemes are completely insecure against a quantum adversary, but that their security can be partially restored if the legitimate parties are also allowed to use quantum computation: the eavesdropper needed to spend a time proportional to N^{3/2} to break our earlier quantum scheme.
Quantum Physics
2 code implementations • 18 Jul 1996 • Christoph Durr, Peter Hoyer
We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.
Quantum Physics Data Structures and Algorithms
