On quantum algorithms for noncommutative hidden subgroups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 478-487

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

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

GROUP THEORY;

DIHEDRAL GROUPS; FUTURE RESEARCH DIRECTIONS; GENERATING SET; HIDDEN SUBGROUP PROBLEM; INPUT FUNCTIONS; NON-COMMUTATIVE; NONCOMMUTATIVE GROUP; QUANTUM ALGORITHMS;

QUANTUM THEORY;

EID: 84957076172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_45     Document Type: Conference Paper

References (16)

1. Beals, R.: Quantum computation of Fourier transforms over symmetric groups. Proc. 29th Annual ACM Symposium on Theory of Computing (1997) 48-53
2. Berthiaume, A.: Quantum computation. In: Hemaspaandra, L.A., Selman, A. L. (eds.): Complexity Theory Retrospective II. Springer-Verlag (1997) 23-51
3. Boneh, D., Lipton R.: Quantum cryptoanalysis of hidden linear functions (Extended abstract). Advances in Cryptology|CRYPTO'95. Lecture Notes of Computer Science, Vol. 963. Springer-Verlag (1995) 424-437
4. Brassard, G., Høyer, P.: On the power of exact quantum polynomial time. Unpublished (1996). 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. IEEE Computer Society Press (1997) 12-23
6. Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. Proc. 30th ACM Symposium on Theory of Computing (1998) 63–68
7. Cleve, R., Buhrman, H.: Substituting quantum entanglement for communication. Physical Review A 56 (1997) 1201-1204
8. Grigoriev, D.: Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. Theoretical Computer Science 180 (1997) 217-228
9. Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (1963) 13-30
10. Høyer, P.: Eficient quantum transforms. Unpublished (1997). Available on Los Alamos e-Print archive (http://xxx.lanl.gov) as quant-ph/9702028
11. Jozsa, R.: Quantum algorithms and the Fourier transform. Proceedings of the Royal Society, London A454 (1998) 323-337
12. Kitaev, A.: Quantum measurements and the Abelian stabilizer problem. Unpublished (1995). Available on Los Alamos e-Print archive (http://xxx.lanl.gov) as quant-ph/9511026
13. Maslen, D., Rockmore, D.: Generalized FFTs|A survey of some recent results. Proc. 1996 DIMACS Workshop in Groups and Computation. American Mathematical Society (1997) 183-238
14. Rockmore, D.: Some applications of generalized FFTs. Proc. 1996 DIMACS Workshop in Groups and Computation. American Mathematical Society (1997) 329-370
15. Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26 (1997) 1484-1509
16. Simon, D.: On the power of quantum computation. SIAM Journal on Computing 26 (1997) 1474-1483