Watrous
This commit is contained in:
parent
d0b11bc93f
commit
5a7d9336c6
28
events.xml
28
events.xml
|
@ -4,6 +4,34 @@
|
|||
<eventdefs>
|
||||
|
||||
<!-- Winter 2010 -->
|
||||
<eventitem date="2010-03-02" time="4:30 PM" room="DC1304" title="QIP=PSPACE">
|
||||
|
||||
<short><p>Dr. John Watrous of the <a href="http://www.iqc.ca">IQC</a> will present his recent result "QIP=PSPACE". The talk will not assume any familiarity with quantum computing or complexity theory, and light refreshments will be provided.
|
||||
</p></short>
|
||||
|
||||
|
||||
<abstract><p>The interactive proof system model of computation is a cornerstone of
|
||||
complexity theory, and its quantum computational variant has been
|
||||
studied in quantum complexity theory for the past decade. In this
|
||||
talk I will discuss an exact characterization of the power of quantum
|
||||
interactive proof systems that I recently proved in collaboration with
|
||||
Rahul Jain, Zhengfeng Ji, and Sarvagya Upadhyay. The characterization
|
||||
states that the collection of computational problems having quantum
|
||||
interactive proof systems consists precisely of those problems
|
||||
solvable with an ordinary classical computer using a polynomial amount
|
||||
of memory (or QIP = PSPACE in complexity-theoretic terminology). This
|
||||
characterization implies the striking fact that quantum computing does
|
||||
not provide any increase in computational power over classical
|
||||
computing in the context of interactive proof systems.
|
||||
</p><p>I will not assume that the audience for this talk has any familiarity
|
||||
with either quantum computing or complexity theory; and to be true to
|
||||
the spirit of the interactive proof system model, I hope to make this
|
||||
talk as interactive as possible -- I will be happy to explain anything
|
||||
related to the talk that I can that people are interested in learning
|
||||
about.
|
||||
</p></abstract>
|
||||
|
||||
</eventitem>
|
||||
<eventitem date="2010-02-26" time="7:00 PM" room="CnD Lounge" title="Contest Closing">
|
||||
<short><p>The <a href="http://contest.csclub.uwaterloo.ca">contest</a> is coming to a close tomorrow, so to finish it in style we will be having ice cream and code friday night.
|
||||
It would be a shame if Waterloo lost (we're not on top of the <a href="http://csclub.uwaterloo.ca/contest/rankings.php">leaderboard</a> right now) so come out and hack for the home team.</p></short>
|
||||
|
|
Loading…
Reference in New Issue