Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 263-270

  Ivanyos, G ^a   Magniez, F ^a   Santha, M ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FOURIER TRANSFORMS; POLYNOMIALS; PROBLEM SOLVING;

QUANTUM ALGORITHMS;

QUANTUM CRYPTOGRAPHY;

EID: 0034830170     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378679     Document Type: Conference Paper

References (28)

1. Fast monte carlo algorithms for permutation groups
2. On the complexity of matrix group problems I
3. A polynomial-time theory of black-box groups I
4. Towards polynomial time algorithms for matrix groups
5. Las Vegas algorithms for matrix groups
6. Quantum cryptanalysis of hidden linear functions
7. An exact quantum polynomial-time algorithm for Simon's problem
8. On quantum algorithms for noncommutative hidden subgroups
9. Projective representations of minimum degree of group extensions
10. Quantum mechanical algorithms for the nonabelian hidden subgroup problem
11. Normal subgroup reconstruction and quantum computation using group representations
12. On the minimal degrees of projective representations of the finite Chevalley groups
13. Computing in solvable matrix groups
14. The hidden subgroup problem and eigenvalue estimation on a quantum computer
15. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
16. On the power of quantum computation
17. Quantum algorithms for solvable groups