Abstract

Self-testing has been a rich area of study in quantum information theory. It allows an experimenter to interact classically with a black box quantum system and to test that a specific entangled state was present and a specific set of measurements were performed. Recently, self-testing has been central to high-profile results in complexity theory as seen in the work on entangled games PCP of Natarajan and Vidick (FOCS 2018), iterated compression by Fitzsimons et al.\ (STOC 2019), and NEEXP in MIP* due to Natarajan and Wright (FOCS 2019). The most studied self-test is the CHSH game which features a bipartite system with two isolated devices. This game certifies the presence of a single EPR entangled state and the use of anti-commuting Pauli measurements. Most of the self-testing literature has focused on extending these results to self-test for tensor products of EPR states and tensor products of Pauli measurements.In this work, we introduce an algebraic generalization of CHSH by viewing it as a linear constraint system (LCS) game, exhibiting self-testing properties that are qualitatively different. These provide the first example of LCS games that self-test non-Pauli operators resolving an open question posed by Coladangelo and Stark (QIP 2017). Our games also provide a self-test for states other than the maximally entangled state, and hence resolves the open question posed by Cleve and Mittal (ICALP 2012). Additionally, our games have 1 bit question and log⁡n bit answer lengths making them suitable candidates for complexity theoretic application. This work is the first step towards a general theory of self-testing arbitrary groups. In order to obtain our results, we exploit connections between sum of squares proofs, non-commutative ring theory, and the Gowers-Hatami theorem from approximate representation theory. A crucial part of our analysis is to introduce a sum of squares framework that generalizes the solution group of Cleve, Liu, and Slofstra (Journal of Mathematical Physics 2017) to the non-pseudo-telepathic regime. Finally, we give a game that is not a self-test by "gluing" together two copies of the magic square game. Our results suggest a richer landscape of self-testing phenomena than previously considered.

Highlights

  • In 1964, Bell showed that local hidden-variable theories, which are classical in nature, cannot explain all quantum mechanical phenomena [Bel64]

  • We introduce a new generalization of CHSH to a family of non-pseudo-telepathic linear constraint system (LCS) games over Zn for all n ≥ 2

  • In addition to the infinite family of games, we introduce an LCS game that is obtained from “gluing” together two copies of the magic square game

Read more

Summary

Introduction

In 1964, Bell showed that local hidden-variable theories, which are classical in nature, cannot explain all quantum mechanical phenomena [Bel64]. We introduce a new generalization of CHSH to a family of non-pseudo-telepathic LCS games over Zn for all n ≥ 2 It is still possible to self-test any bipartite entangled state, in any dimension [CGS17] These self-test results are presented in terms of violations of correlations, unlike the CHSH game which arises from a non-local game (with binary payoff). In this paper we make partial progress in answering this question by introducing a SOS framework, and use it to prove self-testing for our games At its core, this framework utilizes the interplay between sum of squares proofs, non-commutative ring theory, and the Gowers-Hatami theorem [GH17, Vid18] from approximate representation theory. This glued magic square provides an example of a game that is not a self-test [Mer90]

Main Results
Proof techniques
Relation to prior work
Further work
Organization of paper
Notation
Non-local games
Linear constraint system games
Gowers-Hatami theorem and its application to self-testing
A generalization of CHSH
Strategies for Gn
Definition of the strategy
Analysis of the strategy
Group structure of Sn
Sum of squares framework
Optimality and rigidity for G3
Optimality of S3
Algebraic relations
Rigidity of G3
SOS approach to solution group
A non-rigid pseudo-telepathic LCS game
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.