ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (S,C)\left(\mathfrak{S},\mathfrak{C}\right) be a system with

S={(Vi,Wπ(i)):i∈{1,…,n}},\mathfrak{S}=\left\{\left(V_i,W_{\pi(i)}\right):i\in\{1,\ldots,n\}\right\},

where π\pi is a circular permutation of {1,…,n}\{1,\ldots,n\}, and

C={(Vi,Wi):i∈{1,…,n}}.\mathfrak{C}=\left\{\left(V_i,W_i\right):i\in\{1,\ldots,n\}\right\}.

Here Δ0(C)\Delta_0(\mathfrak{C}) is the sum of minimal coupling discrepancies and Δmin⁡(S,C)\Delta_{\min}(\mathfrak{S},\mathfrak{C}) is its minimum over couplings. General cyclic-system conjecture. The minimum discrepancy and degree of contextuality are

Δ0(C)=12∑i=1n∣⟨Vi⟩−⟨Wi⟩∣,\Delta_0\left(\mathfrak{C}\right)=\frac{1}{2}\sum_{i=1}^{n}\left|\left\langle V_i\right\rangle-\left\langle W_i\right\rangle\right|, Δmin⁡(S,C)=12max⁡(2Δ0(C),  sodd(⟨ViWπ(i)⟩:i∈{1,…,n})−n+2),\Delta_{\min}\left(\mathfrak{S},\mathfrak{C}\right)=\frac{1}{2}\max\left(2\Delta_0\left(\mathfrak{C}\right),\;\mathsf{s}_{odd}\left(\left\langle V_iW_{\pi(i)}\right\rangle:i\in\{1,\ldots,n\}\right)-n+2\right),

and

CNTX(S,C)=12max⁡(0,sodd(⟨ViWπ(i)⟩:i∈{1,…,n})−n+2−∑i=1n∣⟨Vi⟩−⟨Wi⟩∣).\mathsf{CNTX}\left(\mathfrak{S},\mathfrak{C}\right)=\frac{1}{2}\max\left(0,\mathsf{s}_{odd}\left(\left\langle V_iW_{\pi(i)}\right\rangle:i\in\{1,\ldots,n\}\right)-n+2-\sum_{i=1}^{n}\left|\left\langle V_i\right\rangle-\left\langle W_i\right\rangle\right|\right).

Consequently, the system has a noncontextual description if and only if

sodd(⟨ViWπ(i)⟩:i∈{1,…,n})≤n−2+∑i=1n∣⟨Vi⟩−⟨Wi⟩∣.\mathsf{s}_{odd}\left(\left\langle V_iW_{\pi(i)}\right\rangle:i\in\{1,\ldots,n\}\right)\le n-2+\sum_{i=1}^{n}\left|\left\langle V_i\right\rangle-\left\langle W_i\right\rangle\right|.

The conjecture unifies the SZLG, EPRB, and KCBS systems as cyclic systems of orders 33, 44, and 55. The source notes that a proof was available by February 2015, with a supporting lemma proved in the cited reference; a later passage states the corresponding noncontextuality criterion as a theorem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.