Los Alamos Labs

3/13/2003

3:30pm-4:30pm

Quantum computation and information enables more efficient problem solving in four main areas (so far): Experimental number theory (e.g. factoring), quantum physics modeling, combinatorial searching, and communication. Algorithms in these areas are designed for the standard model of quantum computation. There are many other models of quantum computation. What are the relationships between the computational power of these models? The talk will begin with an elementary introduction to quantum computation. After summarizing what is known about quantum algorithms, I will relate models of quantum computation to classes of promise problems which are derived from #P-complete sum-evaluation problems. A complete problem for bounded-error quantum polynomial-time promise problems will be given. The problem is combinatorially meaningful and can be used to analyze the power of quantum computation without referring to quantum mechanics.

*Refreshments will be served immediately following the talk in ECOT 831.*

Department of Computer Science

University of Colorado Boulder

Boulder, CO 80309-0430 USA

webmaster@cs.colorado.edu

University of Colorado Boulder

Boulder, CO 80309-0430 USA

webmaster@cs.colorado.edu