QIP = PSPACE
A link to the actual paper for those interested: http://www.cs.cmu.edu/~odonnell/hits09/jain-ji-upadhay-watro....
People wondering how IP = PSPACE can delve further into the free draft of this great book on the subject: http://www.cs.princeton.edu/theory/index.php/Compbook/Draft
This news (although not this particular link) was posted over a year ago.
Does this mean quantum computers can't do anything classical computers can't? Does it let the air out of quantum computing? Or am I misreading?
http://en.wikipedia.org/wiki/IP_(complexity)
Buh? Anyone care to explain what sort of problems would fall into this description?