113
click to vote
CORR
2002
Springer
15 years 2 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 ...