8 search results - page 1 / 2 » Quantum mechanical algorithms for the nonabelian hidden subg... |
STOC
2001
ACM
14 years 11 months ago
2001
ACM
FOCS
2007
IEEE
14 years 5 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
1999
Springer
14 years 3 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
SODA
2003
ACM
14 years 8 days 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...
COCO
2007
Springer
14 years 5 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...