493 search results - page 7 / 99 » Quantum Query Complexity of Some Graph Problems |
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
GD
2009
Springer
13 years 10 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
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 ...
FOCS
2003
IEEE
14 years 22 days ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...