4 search results - page 1 / 1 » Quantum Random Walks Hit Exponentially Faster |
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
TOMACS
2002
13 years 4 months ago
2002
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
CRYPTO
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...