The complexity class MIPco stands for interactive proof systems under the commuting-operator model of entanglement. In a recent paper, I showed that this complexity class is equivalent to coRE, the complexity class corresponding to the non-halting problem (the co modifier for both complexity classes actually stands for different things!).

In this talk, I will discuss some of the techniques used to prove this result, and some of the similarities and differences between MIPco and MIP*, interactive proof systems under the tensor-product model of entanglement. I will also talk about some of the consequences of this result for the quantum information and the operator algebra community.

*We strongly encourage attendees to use their full name (and if possible, their UMD credentials) to join the zoom session.*