CS Colloquiumfor Emanuel Knill 3/13/03
Stephanie Morris
Department of Computer Science
ECOT 717 Engineering Center
Campus Box 430
Boulder, Colorado 80309–0430
(303) 492–7514, FAX: (303) 492–2844
CS COLLOQUIUM
On Models of Quantum Computation
Emanuel Knill
Los Alamos Labs
Thursday, March 13, 2003
3:30 – 4:30 PM
Engineering Center Classroom 265
Refreshments will be served afterwards in ECOT 832
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.
------------------------------
http://www.cs.colorado.edu/department/events/colloquia/colloquia.html
Sign Language Interpreters Available Upon Request. Please contact
Stephanie Morris, Department of Computer Science, Engineering ECOT 722,
303-492-6101, at least five days prior to the colloquium.
_______________________________________________
cscolloq mailing list
csco...@cs.colorado.edu
http://www.cs.colorado.edu/mailman/listinfo/cscolloq