群上的近似迹与量子复杂性类$\operatorname{MIP}^{co,s}$
Approximate traces on groups and the quantum complexity class $\operatorname{MIP}^{co,s}$
摘要：
量子复杂性理论中的一个开放问题是，由根据量子交换模型使用共享量子资源的交互证明器可以有效验证的语言组成的类$\operatorname{MIP}^{co}$是否与具有递归可验证补的语言的类$coRE$一致。我们介绍的qc-模的概念，它编码近似量子交换相关性，并表明，存在一个可计算的qc-模给出了一个否定的答案，上述问题的一个自然的变种。
英文摘要：
An open question in quantum complexity theory is whether or not the class $\operatorname{MIP}^{co}$, consisting of languages that can be efficiently verified using interacting provers sharing quantum resources according to the quantum commuting model, coincides with the class $coRE$ of languages with recursively enumerable complement. We introduce the notion of a qc-modulus, which encodes approximations to quantum commuting correlations, and show that the existence of a computable qc-modulus gives a negative answer to a natural variant of the aforementioned question.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
