Quantum algorithms for solvable groups

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 60-67

  Watrous, J ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; QUANTUM THEORY;

QUANTUM ALGORITHMS;

COMPUTER SCIENCE;

EID: 0034832997     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380759     Document Type: Conference Paper

References (38)

1. Solvable black-box group problems are low for PP
2. Local expansion of vertex-transitive graphs and random generation in finite groups
3. Bounded round interactive proofs in finite groups
4. Randomization in group algorithms: Conceptual questions
5. A polynomial-time theory of black box groups I
6. Fast Monte Carlo algorithms for permutation groups
7. On the complexity of matrix group problems I
8. Quantum computation of fourier transforms over symmetric groups
9. Las Vegas algorithms for matrix groups
10. Logical reversibility of computation
11. Quantum cryptanalysis of hidden linear functions
12. An exact quantum polynomial-time algorithm for Simon's problem
13. Quantum algorithms revisited
14. Quantum theory, the church-turing principle and the universal quantum computer
15. On quantum algorithms for noncommutative hidden subgroups
16. Complexity limitations on quantum computation
17. Quantum mechanical algorithms for the nonabelian hidden subgroup problem
18. Testing shift-equivalence of polynomials using quantum machines
19. Asymptotically fast triangularization of matrices over rings
20. Normal subgroup reconstruction and quantum computation using group representations
21. Quantum algorithms and the fourier transform
22. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix
23. Quantum computations: Algorithms and error correction
24. Computing in solvable matrix groups
25. The hidden subgroup problem and eigenvalue estimation on a quantum computer
26. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
27. On the power of quantum computation
28. Succinct quantum proofs for properties of finite groups