8 search results - page 2 / 2 » On Quantum Algorithms for Noncommutative Hidden Subgroups |
FOCS
2007
IEEE
14 years 3 hour 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...
STOC
2006
ACM
13 years 11 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...