7 search results - page 1 / 2 » Hidden translation and orbit coset in quantum computing |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
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...
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...
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 ...