8 search results - page 1 / 2 » On Quantum Algorithms for Noncommutative Hidden Subgroups |
STACS
1999
Springer
13 years 9 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
13 years 6 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...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
COCO
2007
Springer
13 years 11 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
2002
IEEE
13 years 10 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 ...