News for hackers. Stuff that matters.
Re:QIP = PSPACE by tocomment on Sunday January 02, 2011 @11:36PM (#2062094)
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?
Re:QIP = PSPACE by Dabacon on Sunday January 02, 2011 @11:51PM (#2062125)
No. It means that for the complexity class of interactive proofs quantum and classical are the same (when you ignore the number of rounds involved.) This doesn't tell us anything about whether quantum polynomial time equals classical polynomial time. The "IP" classes have problems that are very intractable...this basically says that for these very intractable problems quantum won't help (with the caveat that the quantum seems to allow fewer rounds in the interactive proof.)
Re:QIP = PSPACE by palish on Sunday January 02, 2011 @11:58PM (#2062148)
the quantum seems to allow fewer rounds in the interactive proof

This seems important. What if IP -> QIP is like O(N) -> O(log N)?

Re:QIP = PSPACE by Dabacon on Monday January 03, 2011 @01:05AM (#2062293)
The result, IIRC, is that all of QIP can be done in three rounds, whereas if the same held in the classical world the polynomial hierarchy would collapse (which is considered about as likely as P=NP). Not of practical value, but it does point out that QIP is a slightly different beast than IP when you include the number of rounds.
Re:QIP = PSPACE by DanielRibeiro on Sunday January 02, 2011 @11:43PM (#2062109)
No. It means that, when solving harder problems (way beyond NP, as PSPACE is a really big class), it doesn't matter having a quantum computer.
Re:QIP = PSPACE by michaelty on Sunday January 02, 2011 @11:41PM (#2062105)
Crap, we're still going to be using C when we get our flying cars!