137 search results - page 1 / 28 » Quantum algorithms for some hidden shift problems |
SODA
2003
ACM
13 years 5 months ago
2003
ACM
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
FOCS
2007
IEEE
13 years 11 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...
STOC
2001
ACM
14 years 4 months ago
2001
ACM
COCO
2007
Springer
13 years 10 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...
16
Voted
STOC
2006
ACM
13 years 10 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...