Approximate traces on groups and the quantum complexity class \operatorname{MIP}^{co,s}
From MaRDI portal
Publication:6411017
Abstract: An open question in quantum complexity theory is whether or not the class , consisting of languages that can be efficiently verified using interacting provers sharing quantum resources according to the quantum commuting model, coincides with the class 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.
This page was built for publication: Approximate traces on groups and the quantum complexity class $\operatorname{MIP}^{co,s}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6411017)
