A quantum complexity approach to the Kirchberg Embedding Problem

07/27/2021
by   Isaac Goldbring, et al.
0

The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds into an ultrapower of the Cuntz algebra 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/04/2023

Locally universal C*-algebras with computable presentations

The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds in...
research
09/26/2021

The Connes Embedding Problem: A guided tour

The Connes Embedding Problem (CEP) is a problem in the theory of tracial...
research
11/02/2018

Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing

Based on our previous work on truly concurrent process algebra, we use i...
research
11/02/2018

Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing for Open Systems

Based on our previous work on truly concurrent process algebra, we use i...
research
07/27/2017

A Quantum Approach to Subset-Sum and Similar Problems

In this paper, we study the subset-sum problem by using a quantum heuris...
research
05/25/2021

Quantum Embedding Search for Quantum Machine Learning

This paper introduces a novel quantum embedding search algorithm (QES, p...
research
10/01/2019

Variational embedding for quantum many-body problems

Quantum embedding theories are powerful tools for approximately solving ...

Please sign up or login with your details

Forgot password? Click here to reset