UMass Lowell
Computer Science Colloquium 
Announcement
 
 
Speaker: Professor Steven Homer 
 Dept of Computer Science, BU
Date: November 28, 2001 
Time: 3:00pm--4:00pm
Place: Olsen 311 (The Media Lab)
 Refreshments are served at 2:30pm



 
  
 
 
  
  
 


 

Quantum Computability
 
A major impetus for the recent activity in quantum
computation is a very small number of quantum algorithms which
have been developed that (in principle) exhibit an advantage
of quantum computation over classical computation.
These examples raise questions concerning the power and
limits of quantum computation. One aspect of this topic is the
development of the general theory of efficient quantum algorithms.
This talk discusses some of the results in this area and several
open questions raised by these results.
 
We show how efficient computations by quantum algorithms
can be related to computations of standard (probabilistic)
algorithmic methods. Using this correspondence, we consider
natural classes of quantum algorithms and discuss their efficiency.
We do this by providing a classification for quantum algorithms and
measuring the efficiency of these algorithms using traditional
complexity measures



 
  
 
 
  
  
 


 

Colloquium Coordinator: Jie Wang, wang@cs.uml.edu

Website: http://www.cs.uml.edu/~wang/colloquia/