Pith. sign in

REVIEW 3 major objections 3 minor 26 references

Classical models that faithfully reproduce n-party Mermin-GHZ correlations must surrender exactly F_min(n)=R/[2(R+1)] of measurement independence for n=3 through 13, and never more than half at any size.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-04 01:13 UTC pith:7XTQZGIM

load-bearing objection A genuinely new solution to Hall's faithful Mermin problem, with exact floors through n=13 that are probably right, but whose n≥5 certification rests on a machine-checked identity the paper never states. the 3 major comments →

arxiv 2608.00124 v1 pith:7XTQZGIM submitted 2026-07-31 quant-ph

Exact minimum measurement dependence for faithful local deterministic models of multipartite GHZ-Mermin correlations

Aaron Alai This is my paper
classification quant-ph
keywords measurement independenceBell inequalitiesMermin correlationsGHZ statelocal deterministic modelshidden variablesstabilizer Hamiltoniandevice-independent certification
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

This paper asks how much of the free-choice assumption must be given up by any classical local model that reproduces the Mermin-GHZ correlations of n qubits exactly—every full correlator correct and every smaller marginal zero. It answers that the minimum surrendered fraction follows the closed staircase F_min(n)=R/[2(R+1)] with R=2^floor((n-1)/2), certified for n=3 through 13: 1/3, 2/5, 4/9, 8/17, 16/33, 32/65, each value repeated at the following even size. The result is a squeeze between a proven combinatorial lower bound and an explicit construction whose optimal densities are uniform on the ground states of a frustrated Hamiltonian counting violated Mermin constraints—the classical shadow of the GHZ state's stabilizer. A universal ceiling F≤1/2 shows faithful reproduction never requires total measurement dependence, however many parties are involved. A sympathetic reader would care because these floors put an exact, finite price on measurement dependence as the Bell exit, and set the settings-dependence an adversary needs to counterfeit multipartite device-independent certificates.

Core claim

The central claim is that the exact minimum measurement dependence for faithful local deterministic models of n-partite Mermin-GHZ correlations is F_min(n)=R/[2(R+1)], R=2^floor((n-1)/2), for every n=3,...,13. Theorem 1 collapses the linear program to 2^{n+1} parity classes and proves the faithfulness constraints are free; Theorem 6 provides a general lower bound F≥(|S'|-m)/(|S'|-1) for any constraint subset S' with maximum satisfiability m; and the frustration ansatz—placing each setting's density uniformly on the least-frustrated classes of the violation-counting Hamiltonian—meets that bound on every computed scenario. The exact values are established by integer-arithmetic squeeze, indepen

What carries the argument

The argument runs on four connected pieces. (1) The parity-class reduction (Theorem 1) maps each deterministic strategy to a pair (P,γ), collapsing the variable space to 2^{n+1} classes and deleting the marginal constraints without changing the optimum. (2) The overlap lower bound (Theorem 6) states that for any subset S' of Mermin constraints whose maximum satisfiable count is m, F≥(|S'|-m)/(|S'|-1). (3) The frustration ansatz supplies matching upper bounds: each setting's hidden-variable density is uniform over the ground states of the Hamiltonian that counts violated Mermin constraints. (4) Fourier analysis over GF(2)^{n+1} shows this landscape cannot be generated by pairwise interactions

Load-bearing premise

The exact values for n≥5 rest on a computer-checked formula for how many of the Mermin equations one hidden state can satisfy at once; that formula is not written out for humans to audit.

What would settle it

Independently recompute the maximum satisfiability of the full Mermin constraint set at n=13, which the table's s values imply is 2080; if a brute-force or independent SAT-based count differs, the proven lower bound separates from the frustration ansatz and the exact staircase fails. A cheaper check is the predicted n=14 and n=15 floors, which the law fixes at 32/65 and 64/129.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • The reduction theorem makes faithfulness free: matching the Mermin correlators is enough, and the vanishing-marginal constraints can be imposed by a fiber lift without raising the minimum measurement dependence.
  • The universal ceiling F≤1/2 means no faithful local deterministic model of Mermin-GHZ correlations, at any number of parties, is forced to the conspiratorial limit of complete measurement dependence.
  • The exact floors double as counterfeiting thresholds: a classical adversary of a multipartite device-independent certificate needs at most the listed fraction of settings dependence to reproduce the Mermin violation, and at most half at any size.
  • The frustration ansatz characterizes the optimal hidden-variable densities explicitly as uniform measures on the ground states of the classicalized stabilizer Hamiltonian, and the Fourier analysis shows the landscape cannot be generated by pairwise interactions.
  • The closed staircase law is certified exactly on all computed points and, together with the ceiling, fixes the asymptotic price of measurement dependence for Mermin statistics at 1/2 from below.

Where Pith is reading between the lines

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

  • Editorial extension: if the staircase law continues beyond 13 parties, the exact floors saturate toward the ceiling 1/2 without reaching it; the next predicted values are 32/65 at n=14 and 64/129 at n=15, both directly computable with the paper's symmetry-reduced program.
  • Editorial extension: the pairwise no-go implies that any future 'lawful' measurement-dependent mechanism reproducing these correlations must depend on settings collectively (three or more parties at once), since no two-body interaction can generate the frustration landscape; a concrete search for such mechanisms should target collective rather than pairwise dependence.
  • Editorial extension: the out-of-sample cluster-state cores suggest a general inheritance principle—a scenario's floor is set by its tightest embedded irreducible all-versus-nothing sub-scenario. Computing the floor for additional graph-state cores, e.g. a seven-qubit ring cluster, would test whether the F·s=1/4 invariant survives outside the families studied.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper studies the minimum fraction of measurement independence that must be surrendered by a local deterministic model reproducing the n-partite GHZ–Mermin correlations, under the additional faithfulness requirement that all proper-subset marginals vanish. The main results are: a reduction theorem (Theorem 1) showing that the faithfulness constraints are cost-free, a lossless symmetrization (Theorem 2), hand proofs for the tripartite and four-partite floors F(3)=F(4)=1/3 (Theorems 3 and 4), a universal ceiling F_min(n)≤1/2 (Theorem 5), and a general overlap lower bound (Theorem 6). The paper claims exact values F_min(n)=R/[2(R+1)], R=2^{floor((n-1)/2)}, for every n=3,...,13, certified by an integer-arithmetic squeeze between the Theorem 6 lower bound and an explicit frustration-ansatz construction, and it gives a physical characterization of the optimal densities as uniform measures on contextual ground states of the classicalized stabilizer Hamiltonian.

Significance. If the exactness claims hold, this is a substantial extension of Hall's measurement-dependence pricing to faithful multipartite GHZ–Mermin correlations. The paper's rigorous contributions are real: the reduction theorem is elegant and practically important, the universal ceiling is a clean general result, Theorem 6 is a nontrivial general lower bound, and the hand proofs at n=3 and n=4 are complete. The exact integer-arithmetic certification philosophy and the availability of code are also strengths. The central caveat is that the exact values for n≥5 are not established in the text itself: they depend on two external computational claims—the satisfiability counts entering Theorem 6 and the frustration-ansatz overlap values—neither of which is stated in human-readable form.

major comments (3)
  1. [Secs. V and XI; Conjecture 1] The exact values for n≥5 are not verifiable from the manuscript. The lower bound of Theorem 6 is evaluated using satisfiability counts m(S') that are said to follow from 'an exhaustively machine-verified Mermin-operator identity' (Sec. V), and Sec. XI repeats that the counts follow from this identity, but the identity is never stated. For odd n the required count is m=2^{n-1}(R+1)/(2R); for even n the text invokes an embedded Mermin (n−1) sub-scenario without stating the corresponding construction. Without a statement of the identity and either a human proof or a formal machine-checkable certificate, the lower half of the squeeze cannot be checked. This is load-bearing: if m is wrong, the claimed equality F_min=R/[2(R+1)] can fail.
  2. [Sec. VIII A/B and Sec. XI] The upper-bound half of the squeeze, the frustration ansatz, is asserted to evaluate to R/[2(R+1)] and to be optimal for every computed n, with pairwise overlaps 'computed by pure integer counting' (Sec. XI). No closed-form expression or proof for these overlaps is given for general n. A referee cannot verify the upper bound from the manuscript. Please provide a general derivation of the ground-state counts and intersection counts entering the ansatz evaluation, or state precisely which steps are machine-checked and how the deposited code certifies them.
  3. [Introduction and Sec. V] The claim that 'complete proofs of all theorems are given in the main text and appendices' is misleading for the central exactness result. Theorems 1, 2, 5, and 6 are proved in the text, and Theorems 3 and 4 are hand-proved, but the values for n=5,...,13 are not theorems in the text: they are computational results whose certification depends on the unstated identity and on unstated overlap computations. The paper should state, as a theorem or a precisely described computational proposition, what is proved and what is certified by code, and should make the machine-verifiable artifact explicit and self-contained.
minor comments (3)
  1. [Sec. IV] The quoted symmetry-reduced variable count for n=9, '3,673', does not match the orbit count implied by Theorem 2, which gives 2∑_{k even}(k+1)(n−k+1)=220 variables for n=9. Please clarify what is being counted.
  2. [Table I] The CHSH row lacks entries for s and F_min·s. Consider using explicit em dashes to avoid implying missing values.
  3. [Sec. VIII E] The statement '0 of 120 orderings at n=4, exhaustive' is cryptic; please define the ordering test or provide the relevant script reference.

Circularity Check

0 steps flagged

No circularity: the exact floors are produced by an independent lower-bound theorem and an explicit upper-bound construction, not by fitting or by definition.

full rationale

The paper's derivation chain is not circular. The claimed exact values F_min(n)=R/[2(R+1)] are certified by a squeeze between Theorem 6's lower bound, proven from elementary support restriction and Chebyshev/pigeonhole arguments (Appendix C), and the explicit frustration-ansatz construction of Sec. VIII, whose overlap values are computed by integer counting. Neither side is defined in terms of the claimed F values. Theorem 6's evaluation uses maximum satisfiability counts m(S'), which are independent combinatorial data about the Mermin constraints, not quantities fitted to the staircase law. The upper bound is a constructive density assignment; it contains no parameter tuned to match the lower bound. The hand proofs at n=3 and n=4 (Theorems 3 and 4) are self-contained, and Hall's correlator-only 1/3 is independently re-derived via the reduction theorem rather than merely imported. Conjecture 1, the staircase law, is explicitly labeled a conjecture and is inferred from the computed points without entering the proofs, so it is not load-bearing. No self-citation, imported uniqueness theorem, or ansatz-via-citation appears. The one transparency concern is that exactness for n>=5 relies on an unstated 'exhaustively machine-verified Mermin-operator identity' (Sec. XI) and code-computed ansatz overlaps; this is an omitted-proof/external-computation dependency and a correctness risk, but not a reduction of the result to its inputs, and deposited self-certifying code provides an independent reproducibility route.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

The central claim rests on standard linear algebra, convexity, and LP theory, plus one load-bearing computational identity (satisfiability counts) and the GHZ/Mermin stabilizer formalism. No free parameters are fitted; the 'staircase law' is conjectural and not used as an axiom.

axioms (3)
  • ad hoc to paper The satisfiability counts m(S') for the full Mermin constraint set equal N(R+1)/(2R), verified by an exhaustively machine-verified Mermin-operator identity.
    Used in the exact squeeze to evaluate Theorem 6's lower bound for n=5–13; no human-readable statement or proof is given in the text (Secs. V and XI).
  • standard math Chebyshev's sum inequality and basic GF(2) linear algebra.
    Used in the proof of Theorem 6 and the reduction theorems; standard.
  • domain assumption The GHZ state's stabilizer formalism and Mermin operator algebra.
    Defines the scenario; standard quantum theory.

pith-pipeline@v1.3.0-alltime-deepseek · 12668 in / 18409 out tokens · 186873 ms · 2026-08-04T01:13:09.140318+00:00 · methodology

0 comments
read the original abstract

Bell derivations rest on locality, determinism, and measurement independence. Hall [Phys. Rev. Lett. 105, 250404 (2010)] priced the third assumption exactly for the singlet state, and in the Kochen-Specker analysis of Phys. Rev. A 84, 022102 (2011) priced the four tripartite Mermin perfect correlators at a surrendered fraction of 1/3, leaving open the problem of an optimal model for the Mermin state itself. This paper solves the faithful version of that problem -- every full correlator reproduced and every proper-subset marginal vanishing -- and extends it to thirteen parties. A reduction theorem shows the faithfulness constraints are free, so Hall's correlator-only threshold is promoted to the faithful value, F(3) = 1/3; linear-programming optima, certified exactly by an integer-arithmetic squeeze between a proven lower bound and an explicit construction, then give F(5) = 2/5, F(7) = 4/9, F(9) = 8/17, F(11) = 16/33, and F(13) = 32/65, each value through n = 11 repeated at the following even size. All computed points obey the closed law F = R/[2(R+1)] with R = 2^floor((n-1)/2) the Mermin violation ratio, a proven combinatorial lower bound is tight on every computed core, and a universal ceiling F <= 1/2 shows the statistics never require total abandonment of measurement independence at any size. The optimal hidden-variable densities have a closed physical form: uniform measures on the contextual ground states of the prepared state's frustrated stabilizer Hamiltonian, a structure confirmed out of sample on cluster states in three entanglement classes. The floors constitute counterfeiting thresholds for multipartite device-independent certificates and an exact demand curve that any measurement-dependent account of quantum correlations must fund. Complete proofs of all theorems are given in the main text and appendices.

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

26 extracted references · 4 linked inside Pith

  1. [1]

    J. S. Bell, On the Einstein Podolsky Rosen paradox, Physics Physique Fizika1, 195 (1964)

    1964

  2. [2]

    ForT= [n], P i αi ≡P. Lemma 2(Fiber structure).Each class(P, γ)is the image of exactly2 n−1 strategies:αranges over the affine cosetA P :={α: L i αi =P}of the parity hyperplane H0 :={h: L i hi = 0}, withβ=α⊕γdetermined. The groupH 0, acting byg h : (α, β)7→(α⊕h, β⊕h), preserves every class and acts simply transitively on each fiber. Proof.Immediate:g h fi...

  3. [3]

    M. J. W. Hall, Local deterministic model of singlet state correlations based on relaxing measurement inde- pendence, Phys. Rev. Lett.105, 250404 (2010)

    2010

  4. [4]

    At class level, the constraint of settingSreads fS(c) =t S withf S(c) :=P⊕ L i∈S γi and targetst ∅ = t[4] = 0,t {ij} = 1 (the GF(2) encoding of (1))

    itself. At class level, the constraint of settingSreads fS(c) =t S withf S(c) :=P⊕ L i∈S γi and targetst ∅ = t[4] = 0,t {ij} = 1 (the GF(2) encoding of (1)). Lemma 7(Contradiction catalog).Call a subsetCof settings aparity contradictionif P S∈C fS ≡0as a func- tional while P S∈C tS ≡1. There is no contradiction of size≤3containing distinct settings, and t...

  5. [5]

    C. H. Brans, Bell’s theorem does not eliminate fully causal hidden variables, Int. J. Theor. Phys.27, 219 (1988)

    1988

  6. [6]

    A. S. Friedman, A. H. Guth, M. J. W. Hall, D. I. Kaiser, and J. Gallicchio, Relaxed Bell inequalities with arbitrary measurement dependence for each observer, Phys. Rev. A99, 012121 (2019)

    2019

  7. [7]

    M. J. W. Hall and C. Branciard, Measurement- dependence cost for Bell nonlocality: Causal versus retro- causal models, Phys. Rev. A102, 052228 (2020)

    2020

  8. [8]

    M. J. W. Hall, Relaxed Bell inequalities and Kochen– Specker theorems, Phys. Rev. A84, 022102 (2011)

    2011

  9. [9]

    Barrett and N

    J. Barrett and N. Gisin, How much measurement inde- pendence is needed to demonstrate nonlocality?, Phys. Rev. Lett.106, 100406 (2011)

    2011

  10. [10]

    C. J. Wood and R. W. Spekkens, The lesson of causal discovery algorithms for quantum correlations: causal explanations of Bell-inequality violations require fine- tuning, New J. Phys.17, 033002 (2015)

    2015

  11. [11]

    Waegell and K

    M. Waegell and K. J. McQueen, From statistical depen- dence to the space of possible superdeterministic theories, Eur. J. Philos. Sci.15, 56 (2025), arXiv:2509.23047; M. Waegell, On measurement, superdeterminism, free will, and contextuality, arXiv:2604.00311 (2026)

    arXiv 2025

  12. [12]

    Sen and A

    I. Sen and A. Valentini, Superdeterministic hidden- variables models I: non-equilibrium and signalling, Proc. R. Soc. A476, 20200212 (2020); Superdeterministic hidden-variables models II: conspiracy, Proc. R. Soc. A 476, 20200214 (2020)

    2020

  13. [13]

    S. S. Hossain, M. K. Molla, A. Kundu, B. Paul, I. Chat- topadhyay, and D. Sarkar, Measurement dependence in tripartite non-locality, Quantum Inf. Process.23, 297 (2024), arXiv:2107.12495

    Pith/arXiv arXiv 2024

  14. [14]

    A. Roy, A. Mukherjee, S. S. Bhattacharya, M. Banik, and S. Das, Local deterministic simulation of equatorial Von Neumann measurements on tripartite GHZ state, arXiv:1310.8570 (2013)

    Pith/arXiv arXiv 2013

  15. [15]

    P. Pal, G. Sharma, and R. Podila, Loophole-robust certi- fication of quantum advantage, arXiv:2607.13090 (2026)

    Pith/arXiv arXiv 2026

  16. [16]

    N. D. Mermin, Extreme quantum entanglement in a su- perposition of macroscopically distinct states, Phys. Rev. Lett.65, 1838 (1990)

    1990

  17. [17]

    T. N. Palmer, The invariant set postulate, Proc. R. Soc. A465, 3165 (2009)

    2009

  18. [18]

    ’t Hooft,The Cellular Automaton Interpretation of Quantum Mechanics(Springer, 2016)

    G. ’t Hooft,The Cellular Automaton Interpretation of Quantum Mechanics(Springer, 2016)

    2016

  19. [19]

    Hossenfelder and T

    S. Hossenfelder and T. N. Palmer, Rethinking superde- 9 terminism, Front. Phys.8, 139 (2020)

    2020

  20. [20]

    Donadi and S

    S. Donadi and S. Hossenfelder, Toy model for local and deterministic wave-function collapse, Phys. Rev. A105, 022210 (2022)

    2022

  21. [21]

    Wharton and N

    K. Wharton and N. Argaman, Colloquium: Bell’s theo- rem and locally mediated reformulations of quantum me- chanics, Rev. Mod. Phys.92, 021002 (2020)

    2020

  22. [22]

    Adlam, Spooky action at a temporal distance, Entropy 20, 41 (2018)

    E. Adlam, Spooky action at a temporal distance, Entropy 20, 41 (2018)

    2018

  23. [23]

    Gottesman, The Heisenberg representation of quan- tum computers, arXiv:quant-ph/9807006 (1998)

    D. Gottesman, The Heisenberg representation of quan- tum computers, arXiv:quant-ph/9807006 (1998)

    Pith/arXiv arXiv 1998

  24. [24]

    Bravyi and D

    S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by Clifford gates, Phys. Rev. Lett.116, 250501 (2016)

    2016

  25. [25]

    P¨ utz, D

    G. P¨ utz, D. Rosset, T. J. Barnea, Y.-C. Liang, and N. Gisin, Arbitrarily small amount of measurement inde- pendence is sufficient to manifest quantum nonlocality, Phys. Rev. Lett.113, 190402 (2014)

    2014

  26. [26]

    Vieira, R

    C. Vieira, R. Ramanathan, and A. Cabello, Test of the physical significance of Bell non-locality, Nat. Commun. 16, 4390 (2025)

    2025