Quantum mechanical algorithms for the nonabelian hidden subgroup problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 68-74

  Grigni, M ^a   Schulman, L J ^a   Vazirani, M ^a   Vazirani, U ^a  

^a EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; FOURIER TRANSFORMS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; SAMPLING;

QUANTUM COMPUTERS;

QUANTUM THEORY;

EID: 0034819348     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380769     Document Type: Conference Paper

References (14)

1. Quantum computation of fourier transforms over symmetric groups
2. Fast generalized fourier transforms
3. Efficient computation of the fourier transform of finite groups
4. On quantum algorithms for noncommutative hidden subgroups
5. Normal subgroup reconstruction and quantum computation using group representations
6. Quantum measurements and the abelian stabilizer problem
7. Computation of fourier transforms on the symmetric group
8. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
9. On the power of quantum computation