Table of Contents
Fetching ...

Exclusivity principle, Ramsey theory, and $n$-cycle PR boxes

Raman Choudhary, Rui Soares Barbosa

TL;DR

The paper addresses how the E-principle constrains contextual correlations in KS scenarios, focusing on $n$-cycle PR boxes and activation effects when combining independent copies. It introduces an edge-colored joint exclusivity multigraph Γ^k to preserve the source of exclusivity and connects activation theory with Ramsey theory, enabling noncomputational analysis. The authors show that two copies yield E-principle violations only for $n=4$ (CHSH) and $n=5$ (KCBS), while no activation occurs for $n\ge 6$ with two or even three copies; they derive lower bounds on $n$ as a function of the number of copies and provide bounds showing no violation for larger $k$ when $n$ surpasses certain thresholds. This work reveals a deep link between quantum contextuality, combinatorics, and Ramsey theory, offering a general methodology to rule out E-principle violations in broad KS contexts and guiding future explorations of contextuality via graph-theoretic and combinatorial techniques.

Abstract

The exclusivity principle (E-principle) states that the sum of probabilities of pairwise exclusive events cannot exceed 1. Unlike other principles proposed to characterize quantum correlations, its intrinsically non-bipartite formulation enables its application in more general contextuality scenarios. Although equivalent to the no-signalling condition for any bipartite Bell scenario, this equivalence breaks down for two independent copies of the same scenario. Such violation of the E-principle due to multiple copies, known as its activation effect, was studied in [Nat Commun 4, 2263 (2013)] for the nonlocal extremal boxes of $(2,m,2)$, $(2,2,d)$, and $(3,2,2)$ Bell scenarios. The authors mapped the problem of exhibiting activation effects to finding certain cliques inside joint exclusivity graphs. In this work, we refine the joint exclusivity structure to be an edge-colored exclusivity multigraph. This allows us to draw a novel connection to Ramsey theory, which guarantees the existence of certain monochromatic subgraphs in sufficiently large edge-colored cliques, providing a powerful tool for ruling out E-principle violations. We then exploit this connection, drawing on Ramsey-theoretic results to study violations of the E-principle by multiple copies of the contextual extremal boxes of $n$-cycle scenarios, called $n$-cycle PR boxes. For the usual ($n=4$) PR box we show that the known E-principle violation of $5/4$ is the maximal achievable using two copies, and that this same upper bound applies to two copies of the KCBS ($n = 5$) PR box. We then prove that $n \geq 6$-cycle PR boxes, unlike the extremal boxes of the aforementioned Bell scenarios, do not exhibit activation effects with two or three copies. Finally, for any number of independent copies $k$, we establish a lower bound on $n$ above which $n$-cycle PR boxes do not exhibit activation effects with $k$ copies.

Exclusivity principle, Ramsey theory, and $n$-cycle PR boxes

TL;DR

The paper addresses how the E-principle constrains contextual correlations in KS scenarios, focusing on -cycle PR boxes and activation effects when combining independent copies. It introduces an edge-colored joint exclusivity multigraph Γ^k to preserve the source of exclusivity and connects activation theory with Ramsey theory, enabling noncomputational analysis. The authors show that two copies yield E-principle violations only for (CHSH) and (KCBS), while no activation occurs for with two or even three copies; they derive lower bounds on as a function of the number of copies and provide bounds showing no violation for larger when surpasses certain thresholds. This work reveals a deep link between quantum contextuality, combinatorics, and Ramsey theory, offering a general methodology to rule out E-principle violations in broad KS contexts and guiding future explorations of contextuality via graph-theoretic and combinatorial techniques.

Abstract

The exclusivity principle (E-principle) states that the sum of probabilities of pairwise exclusive events cannot exceed 1. Unlike other principles proposed to characterize quantum correlations, its intrinsically non-bipartite formulation enables its application in more general contextuality scenarios. Although equivalent to the no-signalling condition for any bipartite Bell scenario, this equivalence breaks down for two independent copies of the same scenario. Such violation of the E-principle due to multiple copies, known as its activation effect, was studied in [Nat Commun 4, 2263 (2013)] for the nonlocal extremal boxes of , , and Bell scenarios. The authors mapped the problem of exhibiting activation effects to finding certain cliques inside joint exclusivity graphs. In this work, we refine the joint exclusivity structure to be an edge-colored exclusivity multigraph. This allows us to draw a novel connection to Ramsey theory, which guarantees the existence of certain monochromatic subgraphs in sufficiently large edge-colored cliques, providing a powerful tool for ruling out E-principle violations. We then exploit this connection, drawing on Ramsey-theoretic results to study violations of the E-principle by multiple copies of the contextual extremal boxes of -cycle scenarios, called -cycle PR boxes. For the usual () PR box we show that the known E-principle violation of is the maximal achievable using two copies, and that this same upper bound applies to two copies of the KCBS () PR box. We then prove that -cycle PR boxes, unlike the extremal boxes of the aforementioned Bell scenarios, do not exhibit activation effects with two or three copies. Finally, for any number of independent copies , we establish a lower bound on above which -cycle PR boxes do not exhibit activation effects with copies.

Paper Structure

This paper contains 30 sections, 12 theorems, 10 equations, 14 figures, 2 tables.

Key Result

Proposition 1

The monochromatic projection $H_i(\Gamma^k)$ contains a subgraph isomorphic to $G_i$.

Figures (14)

  • Figure 1: Exclusivity graph of the PR box
  • Figure 2: An example illustrating multicolor product of two graphs $G_1$ and $G_2$. The multigraph obtained can be thought to have multiple layers of nodes where each layer is isomorphic to $G_1$ (resp. $G_2$) with one of the colors, while the graph obtained by picking one node from each layer and the edges of the other color is necessarily isomorphic to $G_2$ (resp. $G_1$) as shown in the middle (resp. rightmost) representation above.
  • Figure 3: The joint exclusivity multigraph constructed in \ref{['fig:graph_product']} and its monochromatic projections.
  • Figure 4: An edge between non-adjacent nodes in a cycle divides it into two smaller cycles. If the original cycle is odd, a chord necessarily leads to (a) an even and an odd cycle. If the original cycle is even, a chord can divide the cycle into (b) two even cycles or (c) two odd cycles.
  • Figure 5: Compatibility graphs of the $n$-cycle scenarios for $n = 4,5,6$. Each bi-colored node represents a dichotomic measurement and each edge denotes joint measurability of connected measurements. $C_4$ corresponds to the CHSH scenario while $C_5$ is the KCBS scenario.
  • ...and 9 more figures

Theorems & Definitions (25)

  • Proposition 1
  • proof
  • Proposition 2
  • proof
  • Corollary 3
  • proof
  • Theorem 4
  • proof
  • Corollary 5
  • proof
  • ...and 15 more