Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research establishes a definitive "all-vs-nothing" operational manifestation of preparation contextuality using a parity-oblivious Hidden Matching task, where quantum protocols achieve perfect success while noncontextual models are fundamentally limited. By proving that no preparation-noncontextual model can succeed perfectly for even $n \ge 6$, the study highlights a qualitative separation rooted in Fourier-analytic sum rules rather than mere quantitative advantages. These findings advance foundational quantum theory by demonstrating how contextuality enables information-processing tasks impossible under noncontextual assumptions, with specific cases like $n=8$ now within potential experimental reach.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

All-vs-Nothing Operational Manifestation of Preparation Contextuality

arXiv3 min read

arXiv:2609.34964v1 Announce Type: new 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+\Theta(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.

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+\Theta(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.

arXiv:2609.34964 [quant-ph]

(or arXiv:2609.34964v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.34964 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 315 words

Related coverage