Quantum algorithm for a generalized hidden shift problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1225-1234

  Childs, Andrew M ^a   Van Dam, Wim ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; QUANTUM COMPUTERS; QUANTUM THEORY; SUBROUTINES;

HIDDEN SUBGROUP PROBLEM; PRETTY-GOOD MEASUREMENTS; QUANTUM ALGORITHMS;

QUANTUM EFFICIENCY;

EID: 84969179622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. N. Alon and J. H. Spencer, The Probabilistic Method, 2nd ed., Wiley Interscience, New York, 2000.
2. D. Bacon, A. M. Childs, and W. van Dam, Optimal measurements for the dihedral hidden subgroup problem, to appear in Chicago Journal of Theoretical Computer Science. arXiv:quant-ph/0501044.
3. -, From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 469-478. arXiv:quant-ph/0504083.
4. R. Boneh and R. Lipton, Quantum cryptanalysis of hidden linear functions, Advances in Cryptology - Crypto'95, 1995, pp. 424-437.
5. I. Borosh and L. B. Treybig, Bounds on positive integral solutions of linear diophantine equations, Proceedings of the American Mathematical Society 55 (1976), 299-304.
6. H. Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag, Berlin, 1993.
7. W. van Dam, S. Hallgren, and L. Ip, Quantum algorithms for some hidden shift problems, Proceedings of the ACMSIAM Symposium on Discrete Algorithms, 2003, pp. 489-498. arXiv:quant-ph/0211140.
8. M. Ettinger and P. Høyer, A quantum observable for the graph isomorphism problem. arXiv:quant-ph/9901029.
9. -, On quantum algorithms for noncommutative hidden subgroups, Advances in Applied Mathematics 25 (2000), no. 3, 239-251. arXiv:quant-ph/9807029.
10. K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen, Hidden translation and orbit coset in quantum computing, Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 1-9. arXiv:quant-ph/0211091.
11. D. Gavinsky, Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups, Quantum Information and Computation 4 (2004), no. 3, 229-235.
12. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani, Quantum mechanical algorithms for the nonabelian hidden subgroup problem, Combinatorica 24 (2004), no. 1, 137-154.
13. S. Hallgren, C. Moore, M. Rötteler, A. Russell, and P. Sen, Limitations of quantum coset states for graph isomorphism, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 604-617. arXiv:quant-ph/0511148, arXiv:quant-ph/0511149.
14. P. Hausladen and W. K. Wootters, A 'pretty good' measurement for distinguishing quantum states, Journal of Modern Optics 41 (1994), no. 12, 2385-2390.
15. C. W. Helstrom, Quantum Detection and Estimation Theory, Academic Press, New York, 1976.
16. A. S. Holevo (Kholevo), On asymptotically optimal hypothesis testing in quantum statistics, Theory of Probability and its Applications 23 (1979), no. 2, 411-415. English translation of Teoriya Veroyatnosteǐ ieee Primeneniya 23 (1978), no. 2, 429-432.
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. G. Ivanyos, F. Magniez, and M. Santha, Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem, International Journal of Foundations of Computer Science 14 (2003), no. 5, 723-739. arXiv:quantph/0102014.
19. R. Kannan, Minkowski's convex body theorem and integer programming, Mathematics of Operations Research 12 (1987), no. 3, 415-440.
20. R. M. Karp, Reducibility among computational problems, Complexity of Computer Computations, 1972, pp. 85-103.
21. G. Kuperberg, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem, SIAM Journal on Computing 35 (2005), no. 1, 170-188. arXiv:quantph/0302112.
22. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen 261 (1982), no. 4, 515-534.
23. H. W. Lenstra, Jr., Integer programming with a fixed number of variables, Mathematics of Operations Research 8 (1983), no. 4, 538-548.
24. C. Moore, D. N. Rockmore, A. Russell, and L. J. Schulman, The hidden subgroup problem in affine groups: Basis selection in Fourier sampling, Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 1113-1122. arXiv:quant-ph/0211124, extended version available at arXiv:quant-ph/0503095.
25. C. Moore, A. Russell, and L. J. Schulman, The symmetric group defies strong Fourier sampling, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 479-490. arXiv:quant-ph/0501056.
26. M. A. Neumark, On a representation of additive operator set functions, Comptes Rendus de l'Académie des Sciences de l'URSS (Doklady Akademii Nauk SSSR) 41 (1943), 359-361.
27. O. Regev, Quantum computation and lattice problems, Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, 2002, pp. 520-529. arXiv:cs.DS/0304005.
28. -, A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space. arXiv:quantph/0406151.
29. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing 26 (1997), no. 5, 1484-1509.