arXiv:2609.34964
All-vs-Nothing Operational Manifestation of Preparation Contextuality
Jayashree Karmakar, Rafiuddin Gazi, Biswadeep Chatterjee, Subhendu B Ghosh, Anandamay Das Bhowmik, Ananya Chakraborty, Manik Banik
Abstract
Preparation contextuality is often manifested operationally through a quantitative advantage over preparation-noncontextual models in information-processing tasks, yet quantum theory typically falls short of perfect success. Here we introduce a parity-oblivious Hidden Matching task that instead yields an all-vs-nothing manifestation of preparation contextuality. Alice encodes an $n$-bit string so that her message reveals no information about any input parity other than the two-bit parities. Bob, given a perfect matching on the input positions, must output an edge of the matching together with the parity of its two bits. A quantum protocol using a single $\lceil\log_2 n\rceil$-qubit message satisfies the parity-obliviousness constraint and succeeds with certainty. We prove that no preparation-noncontextual model achieves perfect success for any even $n\ge6$. The result holds for arbitrary ontic state spaces and assumes neither outcome determinism nor measurement noncontextuality. For $n=6$ and $n=8$, the optimal noncontextual success probabilities are $4/5$ and $3/4$, respectively, while asymptotically the optimal noncontextual success probability is $1/2+Θ(1/\sqrt n)$. Our asymptotic upper bound follows from a Fourier-analytic sum rule derived via hypercontractivity on the Boolean hypercube. The resulting separation is qualitative rather than merely quantitative: quantum theory achieves perfect success, whereas preparation-noncontextual models cannot. We aslo show that at $n=8$ the noncontextual bound remains $3/4$ even when Bob is restricted to just suitable $4$ of the $105$ possible perfect matchings, bringing the effect within experimental reach.
AI Summary
Can preparation contextuality provide perfect success in an information-processing task, rather than merely an advantage below unit success? The paper introduces parity-oblivious Hidden Matching. Alice receives a uniform $n$-bit string and sends a message revealing no individual parity except two-bit parities. Given a perfect matching, Bob must output an edge and its parity. The standard Hidden Matching quantum encoding, $|\psi_x\rangle=n^{-1/2}\sum_i(-1)^{x_i}|i\rangle$, uses $\lceil\log_2 n\rceil$ qubits, satisfies the obliviousness constraints, and succeeds with certainty. For every even $n\ge6$, perfect success is impossible in preparation-noncontextual models, including arbitrary ontic spaces, without outcome determinism or measurement noncontextuality. The obstruction uses only four-bit-parity obliviousness: a message can fix pairwise parities only within one clique of at most three coordinates, which some perfect matching avoids. For uniformly sampled matchings, the optimal noncontextual success probability is $1/2+\Theta(n^{-1/2})$. An exact reduction to optimization over nonnegative quadratic Fourier polynomials gives a hypercontractive upper bound $1/2+9/\sqrt{n-1}$ and matching-order lower bounds from odd-clique constructions. Exhaustive linear-program enumeration gives reported optima $4/5$ at $n=6$ and $3/4$ at $n=8$; four selected matchings retain the latter bound. The asymptotic bound is nontrivial only from $n=326$, and global optimality of odd-clique strategies remains open. The small-instance computations use floating-point arithmetic rather than rational certificates. Experimental certification of operational equivalences remains necessary; a bound accommodating residual forbidden-parity leakage is left open.
Error found: The exact noncontextual optima claimed at n=6 and n=8 rely on floating-point linear-programming upper bounds without exact certificates or rigorous numerical error bounds, so their exactness remains uncertified.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 21 pages (two-column) + 4 figures; Comments are welcome