Sean Hallgren
ABSTRACT
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resulting algorithms is the use of quantum coset states, which encode the hidden subgroup. An open question has been how hard it is to use these states to solve graph isomorphism. It was recently shown by Moore, Russell, and Schulman [30] that only an exponentially small amount of information is available from one, or a pair of coset states. A potential source of power to exploit are entangled quantum measurements that act jointly on many states at once. We show that entangled quantum measurements on at least Ω(n log n) coset states are necessary to get useful information for the case of graph isomorphism, matching an information theoretic upper bound. This may be viewed as a negative result because highly entangled measurements seem hard to implement in general. Our main theorem is very general and also rules out using joint measurements on few coset states for some other groups, such as GL(n,Fpm) and Gn where G is finite and satisfies a suitable property.
- D. Aharonov and A. Ta-Shma. Adiabatic quantum state generation and statistical zero knowledge. In Proceedings of the 35th Annual ACM Symposium on Theory of computing, pages 20--29, 2003. Also: ArXiv preprint quant--ph/0301023.]] Google Scholar
Digital Library
- G. Alagic, C. Moore, and A. Russell. Strong Fourier sampling fails over Gn. ArXiv preprint quant-ph/0511054, 2005.]]Google Scholar
- D. Bacon, A. Childs, and W. v. Dam. From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005. Also: ArXiv preprint quant--ph/0504083.]] Google ScholarDigital Library
- R. Beals. Quantum computation of Fourier transforms over the symmetric groups. In Proceedings of the Symposium on Theory of Computing (STOC'97), pages 48--53, El Paso, Texas, 1997.]] Google ScholarDigital Library
- C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM J. Comput., 26(5):1510--1523, 1997.]] Google ScholarDigital Library
- Y. G. Berkovich and E. M. Zhmud. Characters of finite groups, part 2, volume 181 of Translations of Mathematical Monographs. American Mathematical Society, 1999.]]Google Scholar
- G. Brassard and P. Hoyer. An exact polynomial--time algorithm for Simon's problem. In Proceedings of Fifth Israeli Symposium on Theory of Computing and Systems, pages 12--33. ISTCS, IEEE Computer Society Press, 1997. Also: ArXiv preprint quant--ph/9704027.]] Google ScholarDigital Library
- A. Childs and P. Wocjan. On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. ArXiv preprint quant--ph/0510185, 2005.]]Google Scholar
- M. Ettinger and P. Hoyer. On quantum algorithms for noncommutative hidden subgroups. Advances in Applied Mathematics, 25(3):239--251, 2000.]] Google ScholarDigital Library
- M. Ettinger, P. Hoyer, and E. Knill. A quantum observable for the graph isomorphism problem. ArXiv preprint quant--ph/9901029, 1999.]]Google Scholar
- M. Ettinger, P. Hoyer, and E. Knill. Hidden subgroup states are almost orthogonal. ArXiv preprint quant--ph/9901034, 1999.]]Google Scholar
- K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen. Hidden translation and orbit coset in quantum computing. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 1--9, 2003. Also: ArXiv preprint quant--ph/0211091.]] Google ScholarDigital Library
- W. Fulton and J. Harris. Representation theory: A first course, volume 129 of Graduate Texts in Mathematics. Springer, 1991.]]Google Scholar
- P. X. Gallagher. Character values at involutions. Proceeedings of the American Mathematical Society, 120(3):657--659, 1994.]]Google ScholarCross Ref
- M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica, pages 137--154, 2004.]] Google ScholarDigital Library
- L. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 212--219, 1996. Also: ArXiv preprint quant--ph/9605043.]] Google ScholarDigital Library
- S. Hallgren. Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proceedings of the 34th Annual ACM Symposium on Theory of computing, pages 653--658, 2002.]] Google ScholarDigital Library
- S. Hallgren. Fast quantum algorithms for computing the unit group and class group of a number field. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 468--474, 2005.]] Google ScholarDigital Library
- S. Hallgren, M. Rötteler, and P. Sen. Limitations of quantum coset states for graph isomorphism. arXiv preprint quant-ph/0511148.]]Google Scholar
- S. Hallgren, A. Russell, and A. Ta-Shma. The hidden subgroup problem and quantum computation using group representations. SIAM Journal on Computing, 32(4):916--934, 2003.]]Google ScholarCross Ref
- I. M. Isaacs. Character theory of finite groups. Academic Press, 1976.]]Google Scholar
- 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, pages 723--740, 2003. Also: ArXiv preprint quant--ph/0102014.]]Google ScholarCross Ref
- G. James and A. Kerber. The representation theory of the symmetric group. Addison-Wesley, Reading, 1981.]]Google Scholar
- A. Y. Kitaev. Quantum measurements and the abelian stabilizer problem. ArXiv preprint quant--ph/9511026, 1995.]]Google Scholar
- J. Köbler, U. Schöning, and J. Torán. The graph isomorphism problem. Birkhäuser, 1993.]]Google ScholarCross Ref
- G. Kuperberg. A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. ArXiv preprint quant--ph/0302112, 2003.]]Google Scholar
- J. D. Lafferty and D. Rockmore. Fast Fourier analysis for rm SL2 over a finite field and related numerical experiments. Experimental Mathematics, 1(2):115--139, 1992.]]Google ScholarCross Ref
- C. Moore, D. Rockmore, A. Russell, and L. Schulman. The power of basis selection in fourier sampling: Hidden subgroup problems in affine groups. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1113--1122, 2004. Journal version in preparation. Also: ArXiv preprint quant--ph/0503095.]] Google ScholarDigital Library
- C. Moore and A. Russell. The symmetric group defies strong Fourier sampling: Part II. ArXiv preprint quant--ph/0501066, 2005.]]Google Scholar
- C. Moore, A. Russell, and L. Schulman. The symmetric group defies strong Fourier sampling. In Proceedings of the 46th Annual IEEE Symposium on the Foundations of Computer Science, pages 479--488, 2005. Also: ArXiv preprint quant--ph/0501056.]] Google ScholarDigital Library
- M. Mosca and A. Ekert. The hidden subgroup problem and eigenvalue estimation on a quantum computer. In Quantum Computing and Quantum Communications, volume 1509 of Lecture Notes in Computer Science, pages 174--188. Springer-Verlag, 1998.]] Google ScholarDigital Library
- M. Nielsen and I. Chuang. Quantum computation and quantum information. Cambridge University Press, 2000.]] Google ScholarDigital Library
- J. Radhakrishnan, M. Rötteler, and P. Sen. On the power of random bases in Fourier sampling: Hidden subgroup problem in the Heisenberg group. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 3580, pages 1399--1411. Springer-Verlag, 2005. Also: ArXiv preprint quant--ph/0503114.]] Google ScholarDigital Library
- Y. Roichman. Upper bound on the characters of the symmetric groups. Inventiones Mathematicae, 125:451--485, 1996.]]Google ScholarCross Ref
- A. Schmidt and U. Vollmer. Polynomial time quantum algorithm for the computation of the unit group of a number field. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 475--480, 2005.]] Google ScholarDigital Library
- P. Sen. Random measurement bases, quantum state distinction and applications to the hidden subgroup problem. In Proceedings of the 21st IEEE Conference on Computational Complexity, 2006. To appear. Also: ArXiv preprint quant--ph/0512085.]] Google ScholarDigital Library
- J. P. Serre. Linear representations of finite groups. Springer, 1977.]]Google ScholarCross Ref
- P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484--1509, 1997.]] Google ScholarDigital Library
- D. R. Simon. On the power of quantum computation. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 116--123, Los Alamitos, CA, 1994. Institute of Electrical and Electronic Engineers Computer Society Press.]]Google ScholarDigital Library
Index Terms
- Limitations of quantum coset states for graph isomorphism
Recommendations
Limitations of quantum coset states for graph isomorphism
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resulting ...
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
Mathematical Methods in Computer ScienceMany exponential speedups that have been achieved in quantum computing are obtained via hidden subgroup problems (HSPs). We show that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer. These groups are well-known in ...
Quantum algorithms for Simon's problem over nonabelian groups
Daniel Simon's 1994 discovery of an efficient quantum algorithm for finding “hidden shifts” of Z2n provided the first algebraic problem for which quantum computers are exponentially faster than their classical counterparts. In this article, we study the ...
Comments