51 search results - page 6 / 11 » Quantum lower bounds for the Goldreich-Levin problem |
139
click to vote
TOC
2008
15 years 6 months ago
2008
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
187
click to vote
FCT
2007
Springer
16 years 25 days 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 ...
182
click to vote
COCOON
2005
Springer
16 years 6 days ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
184
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
211
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...