23 search results - page 4 / 5 » One-dimensional quantum walks |
ICALP
2010
Springer
13 years 5 months ago
2010
Springer
IJBC
2010
13 years 4 months ago
2010
STOC
2003
ACM
14 years 7 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...