Quantum Algorithms

Invited Talk
  • Umesh Vazirani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2286)


Quantum computers are the only model of computing to credibly violate the modified Church-Turing thesis, which states that any reasonable model of com-putation can be simulated by a probabilistic Turing Machine with at most poly-nomial factor simulation overhead. This is dramatically demonstrated by Shor’s polynomial time algorithms for factorization and discrete logarithms [13]. Shor’s algorithm, as well as the earlier algorithm due to Simon [12] can both be cast into the general framework of the hidden subgroup problem (see for example [10]). Two recent papers [11],[9] study how well this framework extends to solving the hidden subgroup problem for non-abelian groups (which includes the graph iso-morphism problem).


  1. 1.
    Bernstein E and Vazirani U, 1993, Quantum complexity theory, SIAM Journal of Computation 26 5 pp 1411–1473 October, 1997.MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bennett, C.H., Bernstein, E., Brassard, G. and Vazirani, U.,“Strengths and weaknesses of quantum computation,”SIAM J.Computing, 26, pp.1510–1523 (1997).CrossRefGoogle Scholar
  3. 3.
    van Dam, W., Hallgren, H.,“Efficient Quantum Algorithms for Shifted Quadratic Character Problems ”, quant-ph/0011067.Google Scholar
  4. 4.
    van Dam, W., Mosca, M., Vazirani, U.,“How Powerful is Adiabatic Quantum Computing?”FOCS,2001.Google Scholar
  5. 5.
    van Dam, W., Vazirani, U.,“On the Power of Adiabatic Quantum Computing” manuscript, 2001.Google Scholar
  6. 6.
    E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser,“Quantum Comput tion by Adiab tic Evolution ”, quant-ph report no. 0001106 (2000)Google Scholar
  7. 7.
    E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda,“A Quantum Adiabatic Evolution Algorithm Applied to Random Inst nces of an NP-Complete Problem”, Science, Vol.292, April, pp.472–476 (2001)Google Scholar
  8. 8.
    Grover, L.,“Quantum mechanics helps in searching for needle in haystack,” Phys.Rev.Letters, 78, pp.325–328 (1997).CrossRefGoogle Scholar
  9. 9.
    Grigni, M., Schulman, S., Vazirani, M., Vazirani, U.,“Quantum Mech nical Al-gorithms for the Non beli n Hidden Subgroup Problem”, In Proceedings of the Thirty-third Annual ACM Symposium on the Theory of Computing Crete, Greece, 2001.Google Scholar
  10. 10.
    L. Hales and S. Hallgren.Quantum Fourier S mpling Simplified. In Proceedings of the Thirty-first Annual ACM Symposium on the Theory of Computing pages 330–338,Atlanta,Georgia, 1–4 May 1999.Google Scholar
  11. 11.
    Hallgren, S., Russell, A., T-Shma, A.,“Normal subgroup reconstruction nd quantum computation using group representations ”, In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing 627–635, 2000.Google Scholar
  12. 12.
    D. Simon.“On the power of quantum comput tion.” In Proc. 35th Symposium on Foundations of Computer Science (FOCS), 1994.Google Scholar
  13. 13.
    Shor P W, Polynomial-time lgorithms for prime factorization and discrete logarithms on quantum computer, SIAM J. Comp., 26 No.5, pp 1484–1509, October 1997.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Umesh Vazirani
    • 1
  1. 1.University of CaliforniBerkeleyUSA

Personalised recommendations