21 search results - page 1 / 5 » The Quantum Query Complexity of Algebraic Properties |
FCT
2007
Springer
13 years 10 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 ...
ALGORITHMICA
2002
13 years 4 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
CORR
2010
Springer
13 years 4 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...