Published July 2001
| public
Book Section - Chapter
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
Abstract
We provide positive and negative results concerning the "standard method" of identifying a hidden subgroup of a nonabelian group using a quantum computer.
Additional Information
© 2001 ACM. Supported in part by NSF grant CCR-9820931. Supported in part by NSF CAREER grant CCR-98761722, the NSF Institute for Quantum Information, and the Charles Lee Powell Foundation. Supported in part by an NSF Mathematical Sciences Postdoctoral Fellowship. Supported in part by NSF grant CCR-9800024 and Darpa grant F30602-00-2-0601.Additional details
- Eprint ID
- 71636
- DOI
- 10.1145/380752.380769
- Resolver ID
- CaltechAUTHORS:20161031-162455553
- CCR-9820931
- NSF
- CCR-98761722
- NSF
- Institute for Quantum Information
- Charles Lee Powell Foundation
- NSF Postdoctoral Fellowship
- CCR-9800024
- NSF
- F30602-00-2-0601
- Defense Advanced Research Projects Agency (DARPA)
- Created
-
2016-11-01Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field