On quantum algorithms for noncommutative hidden subgroups

Advances in Applied Mathematics

Volumn 25, Issue 3, 2000, Pages 239-251

  Ettinger, Mark ^a   Høyer, Peter ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034288481     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.2000.0699     Document Type: Article

References (17)

1. Beals R. Quantum computation of Fourier transforms over symmetric groups. Proc. 29th Annual ACM Symposium on Theory of Computing. 1997;The Association for Computing Machinery, New York. p. 48-53.
2. Berthiaume A. Quantum computation. Hemaspaandra L. A., Selman A. L. Complexity Theory Retrospective II. 1997;23-51 Springer-Verlag, New York.
3. Boneh D., Lipton R. Quantum cryptoanalysis of hidden linear functions (extended abstract). Advances in Cryptology - CRYPTO '95. Lecture Notes of Computer Science. 963:1995;Springer-Verlag, Berlin. p. 424-437.
4. G. Brassard, and, P. Høyer, On the Power of Exact Quantum Polynomial Time, available on Los Alamos e-Print archive (http://xxx.lanl.gov) as quant-ph/9612017.
5. Brassard G., Høyer P. An exact quantum polynomial-time algorithm for Simon's problem. Proc. Fifth Israeli Symposium on Theory of Computing and Systems. 1997;IEEE Computer Society Press, Los Alamitos. p. 12-23.
6. Brassard G., Høyer P., Tapp A. Quantum counting. Proc. 25th International Colloquium on Automata, Languages, and Programming. Lecture Notes of Computer Science. 1443:1998;Springer-Verlag, Berlin. p. 820-831.
7. Grigoriev D. Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. Theoret. Comput. Sci. 180:1997;217-228.
8. Hoeffding W. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58:1963;13-30.
9. P. Høyer, Efficient Quantum Transforms, available on Los Alamos e-Print archive (http://xxx.lanl.gov) as quant-ph/9702028.
10. Jozsa R. Quantum algorithms and the Fourier transform. Proc. Roy. Soc. London Ser. A. 454:1998;323-337.
11. A. Kitaev, Quantum Measurements and the Abelian Stabilizer Problem, available on Los Alamos e-Print archive (http://xxx.lanl.gov) as quant-ph/9511026.
12. Maslen D., Rockmore D. Generalized FFTs - A survey of some recent results. Proc. 1996 DIMACS Workshop in Groups and Computation. 1997;Am. Math. Soc. Providence. p. 183-238.
13. Rockmore D. Some applications of generalized FFTs. Proc. 1996 DIMACS Workshop in Groups and Computation. 1997;Am. Math. Soc. Providence. p. 329-370.
14. M. Rötteler, and, T. Beth, Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of Non-Abelian Groups, available on Los Alamos e-Print archive (http://xxx.lanl.gov) as quant-ph/9812070.
15. Serre J.-P. Linear Representations of Finite Groups. 1977;Springer-Verlag, Berlin/New York.
16. Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26:1997;1484-1509.
17. Simon D. On the power of quantum computation. SIAM J. Comput. 26:1997;1474-1483.