Skip to main content
  • Joseph F. Traub - Algorithms and Complexity for Quantum Computing

  • Monday, April 02, 2012 1:00 PM - 2:00 PM EDT
    Haas Hall, Rm. 101
    Purdue University

    Presented by Professor Joseph F.Traubof Columbia University

    Abstract:

    Are quantum computers more powerful than classical computers? To answer this question one must know the classical computational complexity. What is it about the problems of quantum chemistry and quantum physics that enables us to get lower bounds on the classical complexity? We also introduce a new classification of quantum speedups.


    We then turn to a particular problem, the ground state of the time-independentSchroedingerequation for a system of p particles. The classical deterministic complexity of this problem is exponential in p. We provide an algorithm for solving this problem on a quantum computer whose cost is linear in p. We discuss whether this exponential separation proves that quantum computers are exponentially more powerful than classical computers.

    We end with a selection of research directions and where to learn more.



Copyright © Purdue University, all rights reserved. Purdue University is an equal access/equal opportunity university.

Contact the College of Science at sciencehelp@purdue.edu for trouble accessing this page. Made possible by grant NSF CCF-0939370