Approximate traces on groups and the quantum complexity class MIP^co,s

09/16/2022
by   Isaac Goldbring, et al.
0

An open question in quantum complexity theory is whether or not the class 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2020

MIP*=RE

We show that the class MIP* of languages that can be decided by a classi...
research
02/24/2020

On the complexity of zero gap MIP*

The class MIP^* is the set of languages decidable by multiprover interac...
research
01/18/2023

stateQIP = statePSPACE

Complexity theory traditionally studies the hardness of solving classica...
research
05/23/2023

Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines

This work presents a study of Kolmogorov complexity for general quantum ...
research
12/19/2018

Beyond z=0. The Deutsch-Jozsa decided monochromatic languages

The present work points out that the Deutsch-Jozsa algorithm was the fir...
research
05/11/2018

Decision problems for Clark-congruential languages

A common question when studying a class of context-free grammars is whet...
research
09/15/2013

Beyond the quantum formalism: consequences of a neural-oscillator model to quantum cognition

In this paper we present a neural oscillator model of stimulus response ...

Please sign up or login with your details

Forgot password? Click here to reset