Weak fourier-schur sampling, the hidden subgroup problem, and the quantum collision problem

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

Volumn 4393 LNCS, Issue , 2007, Pages 598-609

  Childs, Andrew M ^a   Harrow, Aram W ^b   Wocjan, Pawel ^c  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

^c University of Central Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FOURIER ANALYSIS; HIDDEN MARKOV MODELS; INFORMATION THEORY; QUANTUM THEORY;

COLLISION PROBLEMS; HIDDEN SUBGROUP PROBLEM; SCHUR SAMPLING;

PROBLEM SOLVING;

EID: 38049181353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_51     Document Type: Conference Paper

References (42)

1. S. Aaronson and Y. Shi, Quantum lower bounds for the collision and the element distinctness problems, J. ACM 51 (2004), no. 4, 595-605.
2. D. Bacon, A. M. Childs, and W. van Dam, From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, Proc. 46th FOCS, 2005, pp. 469-478.
3. _, Optimal measurements for the dihedral hidden subgroup problem, Chicago J. Th. Comp. Sci. (2006), no. 2.
4. D. Bacon, I. L. Chuang, and A. W. Harrow, Efficient quantum circuits for Schur and Clebsch-Gordan transforms, quant-ph/0407082.
5. _, The quantum Schur transform: I. Efficient qudit circuits, to appear in Proc. 18th SODA, 2007, available at quant-ph/0601001.
6. A. Barenco, A. Berthiaume, D. Deutsch, A. Ekert, R. Jozsa, and C. Macchiavello, Stabilisation of quantum computations by symmetrisation, SIAM J. Comput. (1997), 1541-1557.
7. R. Beals, Quantum computation of Fourier transforms over symmetric groups, Proc. 29th STOC, 1997, pp. 48-53.
8. R. Boneh and R. Lipton, Quantum cryptanalysis of hidden linear functions, Proc. Advances in Cryptology, LNCS 963, 1995, pp. 424-437.
9. G. Brassard, P. Høyer, and A. Tapp, Quantum cryptanalysis of hash and clawfree functions, Proc. 3rd Latin American Symposium on Theoretical Informatics, LNCS 1380, 1998, pp. 163-169.
10. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf, Quantum fingerprinting, Phys. Rev. Lett. 87 (2001), 167902.
11. A. M. Childs and P. Wocjan, On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems, quant-ph/0510185.
12. D. Coppersmith, An approximate Fourier transform useful in quantum factoring, Technical Report RC 19642, IBM Research Division, Yorktown Heights, NY, 1994, quant-ph/0201067.
13. M. Christandl and G. Mitchison, The spectra of density operators and the Kronecker coefficients of the symmetric group, Commun. Math. Phys. 261 (2006), no. 3, 789-797.
14. M. Ettinger and P. Høyer, A quantum observable for the graph isomorphism problem, quant-ph/9901029.
15. M. Ettinger, P. Høyer, and E. Knill, Hidden subgroup states are almost orthogonal, quant-ph/9901034.
16. K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen, Hidden translation and orbit coset in quantum computing, Proc. 35th STOC, 2003, pp. 1-9.
17. D. Gavinsky, Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups, Quant. Inf. Comp. 4 (2004), 229-235.
18. R. Goodman and N. R. Wallach, Representations and Invariants of the Classical Groups, Cambridge University Press, Cambridge, 1998.
19. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani, Quantum mechanical algorithms for the nonabelian hidden subgroup problem, Combinatorica 24 (2004), 137-154.
20. L. K. Grover, A fast quantum mechanical algorithm for database search, Proc. 28th STOC, 1996, pp. 212-219.
21. S. Hallgren, Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem, Proc. 34th STOC, 2002, pp. 653-658.
22. _, Fast quantum algorithms for computing the unit group and class group of a number field, Proc. 37th STOC, 2005, pp. 468-474.
23. L. Hales and S. Hallgren, An improved quantum Fourier transform algorithm and applications, Proc. 41st FOCS, 2000, pp. 515-525.
24. S. Hallgren, C. Moore, M. Rötteler, A. Russell, and P. Sen, Limitations of quantum coset states for graph isomorphism, Proc. 38th STOC, 2006, pp. 604-617.
25. S. Hallgren, A. Russell, and A. Ta-Shma, The hidden subgroup problem and quantum computation using group representations, Proc. 32nd STOC, 2000, pp. 627-635.
26. A. W. Harrow, Applications of coherent classical communication and the Schur transform to quantum information theory, Ph.D. thesis, MIT, 2005.
27. M. Hayashi and K. Matsumoto, Quantum universal variable-length source coding, Phys. Rev. A 66 (2002), 022311.
28. G. Ivanyos, F. Magniez, and M. Santha, Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem, Int. J. Found. Comp. Sci. 14 (2003), 723-739.
29. S. Kerov, Gaussian limit for the Plancherel measure of the symmetric group, Comptes Rendus Acad. Sci. Paris, Sér. I 316 (1993), 303-308.
30. M. Keyl and R. F. Werner, Estimating the spectrum of a density operator, Phys. Rev. A 64 (2001), 052311.
31. G. Kuperberg, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem, SIAM J. Comput. 35 (2005), 170-188.
32. C. Moore, D. N. Rockmore, and A. Russell, Generic quantum Fourier transforms, Proc. 15th SODA, 2004, pp. 778-787.
33. C. Moore, D. N. Rockmore, A. Russell, and L. J. Schulman, The hidden subgroup problem in affine groups: Basis selection in Fourier sampling, Proc. 15th SODA, 2004, pp. 1113-1122.
34. C. Moore, A. Russell, and L. J. Schulman, The symmetric group defies strong Fourier sampling, Proc. 46th FOCS, 2005, pp. 479-490.
35. J. Radhakrishnan, M. Rötteler, and P. Sen, On the power of random bases in Fourier sampling: Hidden subgroup problem in the Heisenberg group, Proc. 32nd ICALP, LNCS 3580, 2005, pp. 1399-1411.
36. O. Regev, Quantum computation and lattice problems, Proc. 43rd FOCS, 2002, pp. 520-529.
37. _, A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space, quant-ph/0406151.
38. A. Schmidt and U. Vollmer, Polynomial time quantum algorithm for the computation of the unit group of a number field, Proc. 37th STOC, 2005, pp. 475-480.
39. P. Sen, Random measurement bases, quantum state distinction and applications to the hidden subgroup problem, quant-ph/0512085.
40. J. P. Serre, Linear Representations of Finite Groups, Graduate Texts in Mathematics, vol. 42, Springer, New York, 1977.
41. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (1997), 1484-1509.
42. R. P. Stanley, Theory and application of plane partitions, Studies in Appl. Math. 1 (1971), 167-187 and 259-279.