Published January 2004
| public
Journal Article
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
© János Bolyai Mathematical Society 2004. Received September 14, 2000. Supported in part by NSF grants CCR-9820931 and CCR-0208929. Supported in part by NSF CAREER grant 0049092, the NSF Institute for Quantum Information, the Charles Lee Powell Foundation, and the Mathematical Sciences Research Institute. Supported in part by an NSF Mathematical Sciences Postdoctoral Research Fellowship and NSF grant DMS-0301320. Supported in part by DARPA QUIST grant F30602-01-2-0524, ARO grant DAAD19-03-1-0082, and NSF ITR grant CCR-0121555.Additional details
- Eprint ID
- 98354
- DOI
- 10.1007/s00493-004-0009-8
- Resolver ID
- CaltechAUTHORS:20190829-131534342
- CCR-9820931
- NSF
- CCR-0208929
- NSF
- CCF-0049092
- NSF
- Institute for Quantum Information
- Charles Lee Powell Foundation
- Mathematical Sciences Research Institute (MSRI)
- NSF Postdoctoral Fellowship
- DMS-0301320
- NSF
- Defense Advanced Research Projects Agency (DARPA)
- F30602-01-2-0524
- Air Force Office of Scientific Research (AFOSR)
- DAAD19-03-1-0082
- Army Research Office (ARO)
- CCR-0121555
- NSF
- Created
-
2019-08-30Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field