The quantum query complexity of the abelian hidden subgroup problem

Theoretical Computer Science

Volumn 380, Issue 1-2, 2007, Pages 115-126

  Koiran, Pascal ^a   Nesme, Vincent ^a   Portier, Natacha ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Hidden subgroup problems; Lower bounds; Polynomial method; Quantum computing; Query complexity; Simon's problem

Indexed keywords

LINEAR ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; QUANTUM COMPUTERS; QUERY LANGUAGES; SET THEORY;

HIDDEN SUBGROUP PROBLEMS; LOWER BOUNDS; POLYNOMIAL METHODS; QUERY COMPLEXITY; SIMON'S PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 34248574521     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.057     Document Type: Article

References (20)

1. Aaronson S., and Shi Y. Quantum lower bounds for the collision and the element distinctness problems. Journal of the ACM 51 4 (2004) 595-605
2. Beals R. Quantum computation of Fourier transforms over symmetric groups. Proceedings of the 29th Annual ACM Symposium on the Theory of Computation, STOC (1997), ACM Press 48-53
3. Beals R., Buhrman H., Cleve R., Mosca M., and de~Wolf R. Quantum lower bounds by polynomials. Journal of the ACM 48 4 (2001) 778-797
4. Gilles Brassard, Peter Høyer, An exact quantum polynomial-time algorithm for Simon's problem, in: Israel Symposium on Theory of Computing Systems, 1997, pp. 12-23
5. Ettinger M., Høyer P., and Knill E. The quantum query complexity of the hidden subgroup problem is polynomial. Information Processing Letters 91 1 (2004) 43-48
6. Lisa R. Hales, The Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup Problem, Ph.D. Thesis, UC Berkeley, 2002
7. Hirvensalo M. Quantum Computing (Natural Computing Series) (2001), SpringerVerlag
8. Høyer P. Conjugated operators in quantum algorithms. Physics Review A 59 (1999) 3280-3289
9. Jozsa R. Quantum algorithms and the Fourier transform. Proceedings of the Royal Society of London Series A 454 (1998)
10. Pascal Koiran, Vincent Nesme, Natacha Portier, A quantum lower bound for the query complexity of Simon's problem. http://www.arxiv.org/pdf/quant-ph/0501060
11. Pascal Koiran, Vincent Nesme, Natacha Portier, The quantum query complexity of the Abelian hidden subgroup problem, LIP Technical Report RR2005-17. http://perso.ens-lyon.fr/pascal.koiran
12. Greg Kuperberg, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem, Quantum Physics e-Print Archive, 2003
13. Kurzweil H., and Stellmacher B. The Theory of Finite Groups, An Introduction (2004), Universitext, Springer
14. Kutin S. Quantum lower bound for the collision problem with small range. Theory of Computing 1 (2005) 29-36. http://theoryofcomputing.org
15. Nielsen M.A., and Chuang I.L. Quantum Computation and Quantum Information (2000), Cambridge University Press
16. Nisan N., and Szegedy M. On the degree of boolean functions as real polynomials. Comput. Complexity 4 4 (1994) 301-313
17. Paturi R. On the degree of polynomials that approximate symmetric boolean functions (preliminary version). STOC '92: Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing (1992) 468-474
18. Pierre Philipps, Bornes inférieures en calcul quantique : Méthode par adversaire vs. méthode des polynômes, Rapport de stage de DEA, effectué au LRI sous la direction de Frédéric Magniez, http://www.lri.fr/~magniez/stages-dea.html, 2003
19. Shor P.W. Polynomial-time algorithms for prime factorisation and discrete logarithms on a quantum computer. SIAM Journal on Computing 26 5 (1997) 1484-1509
20. Simon D.R. On the power of quantum computation. SIAM Journal on Computing 26 5 (1997) 1474-1483