more progress on computational complexity?
11 views
Skip to first unread message
Joao Marcos
Jan 27, 2020, 8:29:17 AM1/27/20
to Lista acadêmica brasileira dos profissionais e estudantes da área de LOGICA
MIP*=RE
https://www.scottaaronson.com/blog/?p=4512
Quantum Provers to Infinity and Beyond
https://blog.computationalcomplexity.org/2020/01/quantum-provers-to-infinity-and-beyond.html
###
("MIP* is the set of things provable to a classically random
polynomial-time verifier by two separated provers with an unlimited
number of quantumly entangled qubits.")
###
JM
https://www.scottaaronson.com/blog/?p=4512
Quantum Provers to Infinity and Beyond
https://blog.computationalcomplexity.org/2020/01/quantum-provers-to-infinity-and-beyond.html
###
("MIP* is the set of things provable to a classically random
polynomial-time verifier by two separated provers with an unlimited
number of quantumly entangled qubits.")
###
JM
Reply all
Reply to author
Forward
0 new messages