Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups

Quantum Information and Computation

Volumn 4, Issue 3, 2004, Pages 229-235

  Gavinsky, Dmitry ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM COMPUTERS;

ABELIAN GROUP; HIDDEN SUBGROUP PROBLEM; QUANTUM COMPUTING; SCHULMAN; TIME POLYNOMIALS;

GROUP THEORY;

EID: 4043084179     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. R. Beals, Quantum computation of Fourier transforms over symmetric groups Proceedings of the 29th Symposium on Theory of Computing, pp.48-53 (1997)
2. M. Ettinger and P. Hoyer, On quantum algorithms for noncommutative hidden subgroups Proceedings of the 16th Symposium on Theoretical Aspects of Computer, pp. 478-487 (1999)
3. M. Ettinger, P. Hoyer and E. Knill, Hidden subgroup states are almost orthogonal, http://arxiv.org, quant-ph/9901034 (1999)
4. S. Hallgren, A. Russell and A. Ta-Shma, Normal subgroup reconstruction and quantum computation using group representations Proceedings of the 32nd Symposium on Theory of Computing, pp. 627-635 (2000)
5. M. Grigni, L. J. Schulman, M. Vazirani and U. V. Vazirani, Quantum mechanical algorithms for the nonabelian hidden subgroup problem Proceedings of the 33th Symposium on Theory of Computing pp. 68-74 (2001)
6. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer SIAM Journal on Computing, 26(5) pp. 1484-1509 (1997)
7. D. R. Simon, On the power of quantum computation SIAM Journal on Computing, 26(5) pp. 1474-1483 (1997)
8. A. Yu. Kitaev, Quantum measurements and the Abelian stabilizer problem http://arxiv.org quant-ph/9511026 (1995)
9. K. Friedl, G. Ivanyos, F. Magniez, M. Santha and P. Sen, Hidden Translation and Orbit Coset in Quantum Computing, Proceedings of the 35th Symposium on Theory of Computing, pp. 1-9 (2003)
10. C. Moore, D. Rockmore and A. Russell, Generic Quantum Fourier Transforms http://arxiv.org quant-ph/0304064 (2003)
11. J. Watrous, Quantum algorithms for solvable groups Proceedings of the 33rd Symposium on Theory of Computing, pp. 60-67 (2001)
12. E. M. Luks, Permutation groups and polynomial-time computation Groups and Computation, DIMACS series in Discrete Mathematics and Theoretical Computer Science 11, pp. 139-175 (1993)