Practical parallel self-testing of Bell states via magic rectangles

Adamson, Sean A.; Wallden, Petros

doi:10.1103/physreva.105.032456

Cited by 1 publication

(1 citation statement)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The graph incidence groups of most of the graphs in this characterization do not have interesting structure, but an exception is the family of graphs K 3,n , which we analyze in Subsection 5.3. The games G(K m,n , b) have also recently been studied in [AW20,AW22] under the title of magic rectangle games, although our results do not seem to overlap. The proofs of Theorems 1.4 and 1.5 are given in Section 5.…”

Section: Introductionmentioning

confidence: 55%

Arkhipov's theorem, graph minors, and linear system nonlocal games

Paddock¹,

Russo²,

Silverthorne³

et al. 2022

Preprint

View full text Add to dashboard Cite

The perfect quantum strategies of a linear system game correspond to certain representations of its solution group. We study the solution groups of graph incidence games, which are linear system games in which the underlying linear system is the incidence system of a (non-properly) twocoloured graph. While it is undecidable to determine whether a general linear system game has a perfect quantum strategy, for graph incidence games this problem is solved by Arkhipov's theorem, which states that the graph incidence game of a connected graph has a perfect quantum strategy if and only if it either has a perfect classical strategy, or the graph is nonplanar. Arkhipov's criterion can be rephrased as a forbidden minor condition on connected twocoloured graphs. We extend Arkhipov's theorem by showing that, for graph incidence games of connected two-coloured graphs, every quotient closed property of the solution group has a forbidden minor characterization. We rederive Arkhipov's theorem from the group theoretic point of view, and then find the forbidden minors for two new properties: finiteness and abelianness. Our methods are entirely combinatorial, and finding the forbidden minors for other quotient closed properties seems to be an interesting combinatorial problem. the most restrictive model of finite-dimensional strategies. Commuting-operator strategies refers to the most permissive model of infinite-dimensional strategies.

show abstract

Section: Introductionmentioning

confidence: 55%