pith. sign in

arxiv: 2606.23577 · v1 · pith:JCMEKWINnew · submitted 2026-06-22 · 🪐 quant-ph · cs.CC

Genuine Global Kochen-Specker Contextuality as Classical Coordination Cost

Ming Yang This is my paper

Pith reviewed 2026-06-26 08:18 UTC · model grok-4.3

classification 🪐 quant-ph cs.CC
keywords Kochen-Specker contextualityglobal contextualitycoordination costhidden variable modelsempirical modelsBell localityquantum correlationsclassical simulation
0
0 comments X

The pith

Some quantum correlations admit no global noncontextual hidden-variable model even though every local subsystem and every tested multipartite block separately does.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that quantum-like empirical models can display genuine global Kochen-Specker contextuality: local parts are noncontextual, multipartite blocks satisfy generalized Bell locality, yet no single noncontextual assignment works for the whole collection. This regime is distinct from ordinary local contextuality or Bell nonlocality because the obstruction appears only when all contexts must be explained together. The authors introduce a coordination-cost framework that treats communication, memory, and local computation as interchangeable classical resources for maintaining consistency from locally available information. An abstract lifting theorem transfers lower bounds from known contextual seed families to these global cases, and concrete examples such as a polarization-path Hardy obstruction and postselected KCBS-type tasks are analyzed to illustrate the phenomenon.

Core claim

The manuscript identifies a regime of genuine global Kochen-Specker contextuality in which an empirical model is locally noncontextual, its tested multipartite blocks are generalized-Bell-local, yet admits no global noncontextual hidden-variable explanation. This global contextuality is quantified and lifted via a coordination-cost framework that measures the classical resources (coordination bits, global contextual covering numbers) needed to simulate the model from local information, supported by scaling laws for task families and a lifting theorem that transfers simulation lower bounds from KS-contextual seeds.

What carries the argument

The coordination-cost framework, which treats communication, memory, and local computation as resources a classical simulator uses to maintain a global noncontextual explanation from locally available information; it introduces coordination bits and global contextual covering numbers together with a lifting theorem.

If this is right

  • Lower bounds on classical simulation cost for known KS-contextual families transfer directly to genuinely global-KS models via the lifting theorem.
  • Coordination bits and global contextual covering numbers provide quantitative measures of the classical resources needed for the global models.
  • Scaling laws derived in the framework apply to infinite families of tasks exhibiting this global contextuality.
  • Both the polarization-path Hardy obstruction and postselected KCBS-type tasks serve as explicit realizations that separate global from local contextuality.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The framework could be used to certify quantum advantage in distributed sensing or computing tasks where only local measurements are performed but global consistency matters.
  • It suggests that tests for contextuality should include global consistency checks even when local and pairwise data appear classical.
  • The coordination-cost view may connect to resource theories in quantum information that quantify memory or communication overhead in simulation.

Load-bearing premise

The concrete polarization-path Hardy obstruction and postselected KCBS-type tasks actually realize genuine global contextuality without the postselection or choice of tested blocks allowing a global noncontextual model after all.

What would settle it

Explicit construction of a single global noncontextual hidden-variable assignment that reproduces all the observed probabilities in the polarization-path Hardy obstruction example.

read the original abstract

Classical simulations of quantum correlations can fail because no low-communication local hidden-variable model exists, or because no single noncontextual hidden state can explain all compatible measurement contexts. This manuscript studies a third regime: genuine global Kochen-Specker contextuality, where local subsystems are noncontextual and the tested multipartite blocks are generalized-Bell-local, but the whole empirical model admits no global noncontextual hidden-variable explanation. We propose a coordination-cost framework in which communication, memory, and local computation are treated as different ways for a classical simulator to maintain a global classical explanation from locally available information. We introduce coordination bits, global contextual covering numbers, scaling laws for task families, and an abstract lifting theorem showing how classical simulation lower bounds for KS-contextual seed families can be transferred to genuinely global-KS models. As worked examples, we analyze a polarization-path Hardy obstruction and postselected KCBS-type tasks.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript claims that there exist empirical models which are locally noncontextual, with tested multipartite blocks that are generalized-Bell-local, yet admit no global noncontextual hidden-variable explanation; this 'genuine global KS contextuality' is formalized and quantified via a coordination-cost framework that treats communication, memory, and local computation as classical resources for maintaining global consistency from local information. The framework introduces coordination bits and global contextual covering numbers, provides scaling laws for task families, and states an abstract lifting theorem that transfers classical simulation lower bounds from KS-contextual seed families to genuinely global-KS models. Concrete illustrations are given via a polarization-path Hardy obstruction and postselected KCBS-type tasks.

Significance. If the lifting theorem and the concrete examples hold without hidden global noncontextual assignments, the work supplies a new resource-theoretic language for multipartite contextuality that is distinct from both standard Bell nonlocality and ordinary KS contextuality. The coordination-cost perspective could connect contextuality research to communication-complexity bounds and might yield falsifiable predictions for simulation overhead in larger systems.

major comments (2)
  1. [worked examples paragraph] Worked examples paragraph (postselected KCBS-type tasks): the claim of genuine global KS contextuality rests on postselected statistics. Postselection conditions the observed correlations on a subset of runs and can introduce effective dependencies that permit a single global noncontextual hidden-variable assignment consistent with all local noncontextual marginals. The manuscript must supply an explicit verification that no such global assignment reproduces the conditioned data; without it the separation from ordinary KS contextuality is not established.
  2. [abstract] Abstract (lifting theorem): the abstract states that lower bounds for KS-contextual seed families can be transferred to genuinely global-KS models, but provides no indication of the precise hypotheses under which the transfer preserves the 'genuine' property (i.e., that the lifted model remains locally noncontextual and multipartite-block Bell-local). If the lifting construction inadvertently relaxes one of these locality conditions, the central separation claim fails.
minor comments (1)
  1. [abstract] The abstract introduces several new technical terms (coordination bits, global contextual covering numbers) without even a one-sentence definition; a brief parenthetical gloss would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and insightful comments on our manuscript. We address each major comment point by point below, providing clarifications where possible and agreeing to revisions where the concerns identify gaps in the current presentation. We believe these changes will strengthen the manuscript without altering its core claims.

read point-by-point responses

  1. Referee: Worked examples paragraph (postselected KCBS-type tasks): the claim of genuine global KS contextuality rests on postselected statistics. Postselection conditions the observed correlations on a subset of runs and can introduce effective dependencies that permit a single global noncontextual hidden-variable assignment consistent with all local noncontextual marginals. The manuscript must supply an explicit verification that no such global assignment reproduces the conditioned data; without it the separation from ordinary KS contextuality is not established.

    Authors: We agree that an explicit verification is necessary to rigorously establish the separation. While the manuscript argues via the coordination-cost framework and covering numbers that the postselected statistics remain inconsistent with any global noncontextual model (as the local marginals are preserved but the global consistency fails), we will add a dedicated subsection in the worked-examples section that explicitly enumerates or bounds the possible global assignments for the conditioned KCBS-type data and shows none reproduce the postselected correlations. This will be done by direct computation for the small finite case and by reference to the abstract lifting properties. revision: yes

  2. Referee: Abstract (lifting theorem): the abstract states that lower bounds for KS-contextual seed families can be transferred to genuinely global-KS models, but provides no indication of the precise hypotheses under which the transfer preserves the 'genuine' property (i.e., that the lifted model remains locally noncontextual and multipartite-block Bell-local). If the lifting construction inadvertently relaxes one of these locality conditions, the central separation claim fails.

    Authors: The lifting theorem in the body of the manuscript (Section on abstract lifting) is stated with explicit hypotheses: the seed family is KS-contextual, the lifting map acts only on the global coordination layer while leaving all tested multipartite blocks and their local noncontextual marginals unchanged, and the construction ensures generalized-Bell-locality of blocks by design. We acknowledge that the abstract is overly concise on these points and will revise it to include a brief clause specifying that the transfer preserves local noncontextuality and block Bell-locality under the stated hypotheses of the theorem. revision: yes

Circularity Check

0 steps flagged

No circularity: new framework and lifting theorem are self-contained

full rationale

The manuscript defines coordination bits, global contextual covering numbers, and an abstract lifting theorem that transfers lower bounds from KS-contextual seeds to global-KS models. These constructions are introduced as novel and applied to concrete examples (Hardy obstruction, postselected KCBS). No equation reduces a claimed prediction to a fitted input by construction, no self-citation is load-bearing for the central existence claim, and the derivation chain does not rename known results or smuggle ansatzes. The framework is presented as an independent classical-simulation cost measure rather than a tautological re-expression of the target contextuality.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

Only the abstract is available, so the ledger is inferred from the new terms and assumptions named there. The framework rests on standard quantum and hidden-variable background plus the existence of the cited examples.

axioms (2)
  • domain assumption Standard assumptions of quantum mechanics, Kochen-Specker theorem, and generalized Bell locality
    The separation into local noncontextual, generalized-Bell-local, and global contextual regimes presupposes these background notions.
  • domain assumption Existence of empirical models realizing genuine global KS contextuality (e.g., polarization-path Hardy and postselected KCBS)
    The worked examples are invoked to illustrate the regime; their validity is presupposed.
invented entities (2)
  • coordination bits no independent evidence
    purpose: Quantify the classical coordination cost required to maintain a global noncontextual explanation
    New measure introduced in the coordination-cost framework.
  • global contextual covering numbers no independent evidence
    purpose: Provide scaling laws for families of global-KS tasks
    New measure for the cost of global contextuality.

pith-pipeline@v0.9.1-grok · 5677 in / 1589 out tokens · 47843 ms · 2026-06-26T08:18:32.506336+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

28 extracted references · 18 linked inside Pith

  1. [1]

    The sheaf-theoretic structure of non-locality and contextuality.New Journal of Physics, 13:113036, 2011.https://arxiv.org/abs/ 1102.0264

    Samson Abramsky and Adam Brandenburger. The sheaf-theoretic structure of non-locality and contextuality.New Journal of Physics, 13:113036, 2011.https://arxiv.org/abs/ 1102.0264

    Pith/arXiv arXiv 2011

  2. [2]

    Relational databases and Bell’s theorem

    Samson Abramsky. Relational databases and Bell’s theorem. Preprint, 2012.https: //arxiv.org/abs/1208.6416

    Pith/arXiv arXiv 2012

  3. [3]

    The contextual fraction as a measure of contextuality.Physical Review Letters, 119:050504, 2017.https://arxiv

    Samson Abramsky, Rui Soares Barbosa, and Shane Mansfield. The contextual fraction as a measure of contextuality.Physical Review Letters, 119:050504, 2017.https://arxiv. org/abs/1705.07918. 31

    Pith/arXiv arXiv 2017

  4. [4]

    The quan- tum monad on relational structures

    Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, and Octavio Zapata. The quan- tum monad on relational structures. Preprint, 2017.https://arxiv.org/abs/1705. 07310

    2017

  5. [5]

    Non-locality, contextuality and valuation algebras: a general theory of disagreement

    Samson Abramsky and Giovanni Caru. Non-locality, contextuality and valuation algebras: a general theory of disagreement. Preprint, 2019.https://arxiv.org/abs/1911.03521

    arXiv 2019

  6. [6]

    Briegel, David E

    Hans J. Briegel, David E. Browne, Wolfgang Dur, Robert Raussendorf, and Maarten Van den Nest. Measurement-based quantum computation.Nature Physics, 5:19–26, 2009. https://arxiv.org/abs/0910.1116

    Pith/arXiv arXiv 2009

  7. [7]

    A generative modeling approach for bench- marking and training shallow quantum circuits.npj Quantum Information, 5:45, 2019

    Marcello Benedetti, Delfina Garcia-Pintos, Oscar Perdomo, Vicente Leyton-Ortega, Yun- seong Nam, and Alejandro Perdomo-Ortiz. A generative modeling approach for bench- marking and training shallow quantum circuits.npj Quantum Information, 5:45, 2019. https://arxiv.org/abs/1801.07686

    Pith/arXiv arXiv 2019

  8. [8]

    Short proofs are narrow—resolution made simple

    Eli Ben-Sasson and Avi Wigderson. Short proofs are narrow—resolution made simple. Journal of the ACM, 48(2):149–169, 2001

    2001

  9. [9]

    Characterizing the nonlocal corre- lations created via entanglement swapping.Physical Review Letters, 104:170401, 2010

    Cyril Branciard, Nicolas Gisin, and Stefano Pironio. Characterizing the nonlocal corre- lations created via entanglement swapping.Physical Review Letters, 104:170401, 2010. https://arxiv.org/abs/0911.1314

    Pith/arXiv arXiv 2010

  10. [10]

    A limit on nonlocality in any world in which communication complexity is not trivial.Physical Review Letters, 96:250401, 2006.https://arxiv.org/abs/quant-ph/ 0508042

    Gilles Brassard, Harry Buhrman, Noah Linden, Andre Allan Methot, Alain Tapp, and Falk Unger. A limit on nonlocality in any world in which communication complexity is not trivial.Physical Review Letters, 96:250401, 2006.https://arxiv.org/abs/quant-ph/ 0508042

    2006

  11. [11]

    Quantum advantage with shallow circuits

    Sergey Bravyi, David Gosset, and Robert K¨ onig. Quantum advantage with shallow circuits. Science, 362:308–311, 2018.https://arxiv.org/abs/1704.00690

    Pith/arXiv arXiv 2018

  12. [12]

    Nonlocality and communication complexity.Reviews of Modern Physics, 82:665–698, 2010.https: //arxiv.org/abs/0907.3584

    Harry Buhrman, Richard Cleve, Serge Massar, and Ronald de Wolf. Nonlocality and communication complexity.Reviews of Modern Physics, 82:665–698, 2010.https: //arxiv.org/abs/0907.3584

    Pith/arXiv arXiv 2010

  13. [13]

    Information-theoretic bounds on quantum advantage in machine learning.Physical Review Letters, 126:190505, 2021.https: //arxiv.org/abs/2101.02464

    Hsin-Yuan Huang, Richard Kueng, and John Preskill. Information-theoretic bounds on quantum advantage in machine learning.Physical Review Letters, 126:190505, 2021.https: //arxiv.org/abs/2101.02464

    arXiv 2021

  14. [14]

    Contextuality supplies the magic for quantum computation.Nature, 510:351–355, 2014.https://arxiv.org/ abs/1401.4174

    Mark Howard, Joel Wallman, Victor Veitch, and Joseph Emerson. Contextuality supplies the magic for quantum computation.Nature, 510:351–355, 2014.https://arxiv.org/ abs/1401.4174

    Pith/arXiv arXiv 2014

  15. [15]

    Gustavo Fagundes and Matthias Kleinmann. Memory cost for simulating all quantum correlations of the Peres-Mermin scenario.Journal of Physics A: Mathematical and Theo- retical, 50:325302, 2017.https://arxiv.org/abs/1611.07515

    Pith/arXiv arXiv 2017

  16. [16]

    Karanjai, J

    A. Karanjai, J. J. Wallman, and S. D. Bartlett. Contextuality bounds the efficiency of classical simulation of quantum processes.Quantum, 2:125, 2019.https://arxiv.org/ abs/1802.07744

    Pith/arXiv arXiv 2019

  17. [17]

    Portillo, Jan-Ake Larsson, and Adan Cabello

    Matthias Kleinmann, Otfried Guhne, Jose R. Portillo, Jan-Ake Larsson, and Adan Cabello. Memory cost of quantum contextuality.New Journal of Physics, 13:113011, 2011.https: //arxiv.org/abs/1007.3650

    Pith/arXiv arXiv 2011

  18. [18]

    Jeff Kimble

    H. Jeff Kimble. The quantum internet.Nature, 453:1023–1030, 2008.https://arxiv. org/abs/0806.4195. 32

    Pith/arXiv arXiv 2008

  19. [19]

    Cambridge University Press, 1997

    Eyal Kushilevitz and Noam Nisan.Communication Complexity. Cambridge University Press, 1997

    1997

  20. [20]

    Differentiable learning of quantum circuit Born machines

    Jin-Guo Liu and Lei Wang. Differentiable learning of quantum circuit Born machines. Physical Review A, 98:062324, 2018.https://arxiv.org/abs/1804.04168

    Pith/arXiv arXiv 2018

  21. [21]

    Quantum generative adversarial learning.Physical Review Letters, 121:040502, 2018.https://arxiv.org/abs/1804.09139

    Seth Lloyd and Christian Weedbrook. Quantum generative adversarial learning.Physical Review Letters, 121:040502, 2018.https://arxiv.org/abs/1804.09139

    Pith/arXiv arXiv 2018

  22. [22]

    Lucas E. A. Porto, Gabriel Ruffolo, Rafael Rabelo, Marcelo Terra Cunha, and Pawel Kurzy´ nski. Trade-Off relations between Bell nonlocality and local Kochen–Specker con- textuality in generalized Bell scenarios.New Journal of Physics, 26:083028, 2024.https: //arxiv.org/abs/2405.02964

    arXiv 2024

  23. [23]

    Browne, and Hans J

    Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel. Measurement-based quantum computation on cluster states.Physical Review A, 68:022312, 2003.https://arxiv.org/ abs/quant-ph/0301052

    Pith/arXiv arXiv 2003

  24. [24]

    Contextuality in measurement-based quantum computation.Physical Review A, 88:022322, 2013.https://arxiv.org/abs/0907.5449

    Robert Raussendorf. Contextuality in measurement-based quantum computation.Physical Review A, 88:022322, 2013.https://arxiv.org/abs/0907.5449

    Pith/arXiv arXiv 2013

  25. [25]

    Is quantum advantage the right goal for quantum machine learning?PRX Quantum, 3:030101, 2022.https://arxiv.org/abs/2203.01340

    Maria Schuld and Nathan Killoran. Is quantum advantage the right goal for quantum machine learning?PRX Quantum, 3:030101, 2022.https://arxiv.org/abs/2203.01340

    arXiv 2022

  26. [26]

    Global Kochen–Specker contextuality without local contextuality and gener- alized Bell nonlocality

    Ming Yang. Global Kochen–Specker contextuality without local contextuality and gener- alized Bell nonlocality. Preprint, 2026.https://arxiv.org/abs/2605.28702

    Pith/arXiv arXiv 2026

  27. [27]

    Hard examples for resolution.Journal of the ACM, 34(1):209–219, 1987

    Alasdair Urquhart. Hard examples for resolution.Journal of the ACM, 34(1):209–219, 1987

    1987

  28. [28]

    Quantum internet: A vision for the road ahead.Science, 362:eaam9288, 2018

    Stephanie Wehner, David Elkouss, and Ronald Hanson. Quantum internet: A vision for the road ahead.Science, 362:eaam9288, 2018. 33

    2018