51 search results - page 9 / 11 » Quantum lower bounds for the Goldreich-Levin problem |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
STOC
1998
ACM
15 years 1 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...