SIAMCOMP
2008
14 years 11 days ago
2008
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
FOCS
2002
IEEE
14 years 5 months ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
COCO
2007
Springer
14 years 6 months ago
2007
Springer
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
FOCS
2007
IEEE
14 years 6 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...