We investigate the connection between the complexity of nonlocal games and the arithmetical hierarchy, a classification of languages according to the complexity of arithmetical formulas defining them. It was recently shown by Ji, Natarajan, Vidick, Wright and Yuen that deciding whether the (finite-dimensional) quantum value of a nonlocal game is $1$ or at most $\frac{1}{2}$ is complete for the class $Σ_1$ (i.e., $\mathsf{RE}$). A result of Slofstra implies that deciding whether the commuting operator value of a nonlocal game is equal to $1$ is complete for the class $Π_1$ (i.e., $\mathsf{coRE}$). We prove that deciding whether the quantum value of a two-player nonlocal game is exactly equal to $1$ is complete for $Π_2$; this class is in the second level of the arithmetical hierarchy and corresponds to formulas of the form "$\forall x \, \exists y \, ϕ(x,y)$". This shows that exactly computing the quantum value is strictly harder than approximating it, and also strictly harder than computing the commuting operator value (either exactly or approximately). We explain how results about the complexity of nonlocal games all follow in a unified manner from a technique known as compression. At the core of our $Π_2$-completeness result is a new "gapless" compression theorem that holds for both quantum and commuting operator strategies. Our compression theorem yields as a byproduct an alternative proof of Slofstra's result that the set of quantum correlations is not closed. We also show how a "gap-preserving" compression theorem for commuting operator strategies would imply that approximating the commuting operator value is complete for $Π_1$.
Generalized discord, entanglement, Einstein-Podolsky-Rosen steering, and Bell nonlocality in two-qubit systems under (non-)Markovian channels: Hierarchy of quantum resources and chronology of deaths and births
The NPA hierarchy does not always attain the commuting operator value
Inria, Télécom Paris - LTCI, Institut Polytechnique de Paris(法国国家信息与自动化研究所,巴黎电信学院-通信与图像处理实验室,巴黎理工学院);QMATH, Department of Mathematical Sciences, University of Copenhagen(哥本哈根大学数学科学系QMATH中心);Department of Pure Mathematics, University of Waterloo(滑铁卢大学纯数学系);Department of Mathematics and Statistics, University of Ottawa(渥太华大学数学与统计系)
Worst-case depth hierarchy for shallow quantum circuits
Hon Hai (Foxconn) Quantum Computing Research Center(鸿海(富士康)量子计算研究中心);University of Oxford(牛津大学);The University of Hong Kong(香港大学);University of Technology Sydney(悉尼科技大学)
Quantitative quantum soundness for all multipartite compiled nonlocal games
Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学与物理学院);Faculty of Mathematics, Natural Sciences and Information Technologies, University of Primorska(波雷克纳大学数学、自然科学与信息技术学院);Institute of Mathematics, Physics and Mechanics, Ljubljana(卢布尔雅那数学、力学与物理学研究所);School of Informatics, University of Edinburgh(爱丁堡大学信息学院);Inria Paris-Saclay(巴黎萨克雷法国国家信息与自动化研究所);CPHT, Ecole polytechnique, Institut Polytechnique de Paris(巴黎理工学院高等物理化学中心);LIX, Ecole polytechnique, Institut Polytechnique de Paris(巴黎理工学院计算机科学实验室);Université Grenoble Aples, CNRS, Grenoble INP, LIG(格勒诺布尔阿尔卑斯大学);Sorbonne Université, CNRS, LIP6(索邦大学)
Nonlocal Games Through Communication Complexity and Quantum Cryptography
Université de Toulouse(图卢兹大学);Institut de Mathématiques de Toulouse(图卢兹数学研究所);INRIA(法国国家信息与自动化研究所);National University of Singapore(新加坡国立大学);Télécom Paris(巴黎电信学院);LPT, Université de Toulouse(图卢兹大学理论物理实验室);CNRS(法国国家科学研究中心);Université d'Ottawa(渥太华大学)