tag:blogger.com,1999:blog-3722233.post4123992773585237133..comments2024-03-28T18:17:00.135-05:00Comments on Computational Complexity: Favorite Theorems: Quantum Interactive ProofsLance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-3722233.post-75196808245873163882014-09-04T08:42:27.981-05:002014-09-04T08:42:27.981-05:00See also Quantum Multiprover Interactive Proofs wi...See also Quantum Multiprover Interactive Proofs with Communicating Provers. Even if the provers have a classical communication channel, but the verifier sends quantum messages, it still contains NEXP.Anonymousnoreply@blogger.com