Robust self-testing for linear constraint system games

Abstract

We study linear constraint system (LCS) games over the ring of arithmetic modulo $d$. We give a new proof that certain LCS games (the Mermin--Peres Magic Square and Magic Pentagram over binary alphabets, together with parallel repetitions of these) have unique winning strategies, where the uniqueness is robust to small perturbations. In order to prove our result, we extend the representation-theoretic framework of Cleve, Liu, and Slofstra (Journal of Mathematical Physics 58.1 (2017): 012202.) to apply to linear constraint games over ${\mathbb{Z}}_d$ for $d\ge 2$. We package our main argument into machinery which applies to any nonabelian finite group with a ''solution group'' presentation. We equip the $n$-qubit Pauli group for $n\ge 2$ with such a presentation; our machinery produces the Magic Square and Pentagram games from the presentation and provides robust self-testing bounds. The question of whether there exist LCS games self-testing maximally entangled states of local dimension not a power of $2$ is left open. A previous version of this paper falsely claimed to show self-testing results for a certain generalization of the Magic Square and Pentagram mod $d\ne 2$. We show instead that such a result is impossible.

44 pages, 16 figures, removes the false claim of self-testing results for Magic Square and Pentagram mod d

References in corpus (4)

• A generalization of the CHSH inequality self-testing maximally entangled states of any local dimension
• The Parallel-Repeated Magic Square Game is Rigid
• Extending and Characterizing Quantum Magic Games
• Separation of finite and infinite-dimensional quantum correlations, with infinite question or answer sets

Cited by in corpus (12)

• Self-testing of quantum systems: a review
• Maximal nonlocality from maximal entanglement and mutually unbiased bases, and self-testing of two-qutrit quantum systems
• Low-degree testing for quantum states, and a quantum entangled games PCP for QMA
• Robust self-testing of two-qubit states
• A generalization of the CHSH inequality self-testing maximally entangled states of any local dimension
• Parallel Self-Testing of the GHZ State with a Proof by Diagrams
• Almost synchronous quantum correlations
• Constant-sized correlations are sufficient to robustly self-test maximally entangled states with unbounded dimension
• A generalization of CHSH and the algebraic structure of optimal strategies
• Quantum Magic Rectangles: Characterization and Application to Certified Randomness Expansion
• Glued magic games self-test maximally entangled states
• Classical proofs of quantum knowledge