2022
DOI: 10.1103/physreva.105.022408
|View full text |Cite
|
Sign up to set email alerts
|

Network nonlocality via rigidity of token counting and color matching

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
11
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 13 publications
(17 citation statements)
references
References 44 publications
0
11
0
Order By: Relevance
“…, f n ) defined above admits an N -compatible matrix decomposition with the minimal aforementioned assumptions on the underlying physical theory. To prove our result we need to restrict to a subclass of networks first introduced in [22].…”
Section: Resultsmentioning
confidence: 99%
“…, f n ) defined above admits an N -compatible matrix decomposition with the minimal aforementioned assumptions on the underlying physical theory. To prove our result we need to restrict to a subclass of networks first introduced in [22].…”
Section: Resultsmentioning
confidence: 99%
“…( 2) for its definition] was proven not to admit triangle-local models [15]. The proof, based on token-counting arguments [22,23], does not resemble any connection to methods employed in standard Bell nonlocality. For this reason, it is commonly accepted as the first demonstration of genuinely quantum triangle nonlocality.…”
mentioning
confidence: 99%
“…One basic analytical tool is Finner's inequality [RWB + 19], that provides simple bounds on achievable correlations in non-signaling networks. In the case of classical networks, one can analytically certify the infeasibility of certain distributions based on so-called rigidity arguments [RB20]. A general possibility to further study classical, quantum or non-signaling networks is to use entropy-based outer approximations of the feasible correlations [CMG15,CB16,WC17].…”
mentioning
confidence: 99%