2000 character limit reached
A quantum complexity approach to the Kirchberg Embedding Problem
Published 27 Jul 2021 in math.OA, cs.CC, and math.LO | (2107.14010v2)
Abstract: The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds into an ultrapower of the Cuntz algebra $\cal O_2$. Motivated by the recent refutation of the Connes Embedding Problem using the quantum complexity result MIP*=RE, we establish two quantum complexity consequences of a positive solution to KEP. Both results involve almost-commuting strategies to nonlocal games.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.