From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 469-478

  Bacon, Dave ^a   Childs, Andrew M ^b   Van Dam, Wim ^c  

^a University of Washington   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; INFORMATION SCIENCE; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; QUANTUM THEORY;

HIDDEN SUBGROUP PROBLEM; METACYCLIC GROUPS; QUANTUM ALGORITHMS; UNITARY IMPLEMENTATION;

ALGORITHMS;

EID: 33748603175     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.38     Document Type: Conference Paper

References (31)

1. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley Interscience, New York, 2nd edition, 2000.
2. D. Bacon, A. Childs, and W. van Dam. Optimal measurements for the dihedral hidden subgroup problem. arXiv:quant-ph/0501044.
3. R. Beals. Quantum computation of Fourier transforms over symmetric groups. In Proc. 29th STOC, pages 48-53, 1997.
4. R. Boneh and R. Lipton. Quantum cryptoanalysis of hidden linear functions. In Lecture Notes in Computer Science, volume 963, pages 424-437. Springer-Verlag, Berlin, 1995.
5. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Springer-Verlag, Berlin, 2nd edition edition, 1997.
6. T. Dubé, B. Mishra, and C.-K. Yap. Complexity of Buchberger's algorithm for Gröbner bases. 1995.
7. M. Ettinger and P. Høyer. A quantum observable for the graph isomorphism problem. arXiv:quant-ph/9901029.
8. M. Ettinger and P. Høyer. On quantum algorithms for non-commutative hidden subgroups. Advances in Applied Mathematics, 25:239-251, 2000.
9. M. Ettinger, P. Høyer, and E. Knill. The quantum query complexity of the hidden subgroup problem is polynomial. Information Processing Letters, 91:43-48, 2004.
10. K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen. Hidden translation and orbit coset in quantum computing. In Proc. 35th STOC, pages 1-9, 2003.
11. D. Gavinsky. Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups. Quantum Inform. Comput., 4:229-235, 2004.
12. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In Proc. 33rdSTOC, pages 68-74, 2001.
13. S. Hallgren, A. Russell, and A. Ta-Shma. Normal subgroup reconstruction and quantum computing using group representations. In Proc. 32nd STOC, pages 627-635, 2000.
14. P. Hausladen and W. K. Wootters. A 'pretty good' measurement for distinguishing quantum states. J. Mod. Opt., 41:2385-2390, 1994.
15. A. S. Holevo. Statistical decisions in quantum theory. J. Multivar. Anal., 3:337-394, 1973.
16. P. Høyer. Efficient quantum transforms. arXiv:quant-ph/9702028.
17. Y. Inui and F. Le Gall. An efficient algorithm for the hidden subgroup problem over a class of semi-direct product groups. arXiv:quant-ph/0412033.
18. L. Ip. Shor's algorithm is optimal. 2003.
19. A. Kitaev. Quantum measurements and the abelian stabilizer problem. arXiv:quant-ph/9511026.
20. G. Kuperberg. A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. arXiv:quant-ph/0302112.
21. C. Moore, D. N. Rockmore, A. Russell, and L. J. Schulman. The power of basis selection in Fourier sampling: Hidden subgroup problems in affine groups. In Proc. 15th SODA, pages 1113-1122, 2004.
22. C. Moore and A. Russell. For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets. arXiv:quant-ph/0501177.
23. C. Moore, A. Russell, and L. J. Schulman. The symmetric group defies strong Fourier sampling. In Proc. 46th FOCS, 2005.
24. M. A. Neumark. On a representation of additive operator set functions. C. R. (Dokl.) Acad. Sci. URSS, 41:359-361, 1943.
25. J. Radhakrishnan, M. Rötteler, and P. Sen. On the power of random bases in Fourier sampling: Hidden subgroup problem in the Heisenberg group. arXiv:quant-ph/0503114.
26. O. Regev. A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space. arXiv:quant-ph/0406151.
27. O. Regev. Quantum computation and lattice problems. In Proc. 43rdFOCS, pages 520-529, 2002.
28. M. Rötteler and T. Beth. Polynomial-time solution to the hidden subgroup problem for a class of non-abelian groups. arXiv:quant-ph/9812070.
29. P. W. Shor. Algorithms for quantum computation: Discrete log and factoring. In Proc. 35th FOCS, pages 124-134, 1994.
30. J. Watrous. Quantum algorithms for solvable groups. In Proc. 33rd STOC, pages 60-67, 2001.
31. H. Yuen, R. Kennedy, and M. Lax. Optimum testing of multiple hypotheses in quantum detection theory. IEEE Trans. Inform. Theory, 21:125-134, 1975.