3 ms·
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)?
by palish 16y ago
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)?
- Dabacon 16y agoThe 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.