论文标题
组和量子复杂性类别$ \ operatatorName {mip}^{co，s} $的近似跟踪
Approximate traces on groups and the quantum complexity class $\operatorname{MIP}^{co,s}$
论文作者
论文摘要
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.我们介绍了QC-Modulus的概念，该概念编码量子通勤相关性的近似值，并表明可计算的QC-Modulus的存在对上述问题的自然变体给出了负面答案。
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.
