REVIEW 2 major objections 5 minor 17 references
Modeling Pauli measurements on graph states with nearest-neighbor classical communication
T0 review · 2 major / 5 minor · reviewed 2026-08-28 · deepseek-v4-flash
Pith's one-line read This paper proves that a local hidden-variable model with a single round of nearest-neighbor classical communication reproduces the global outcome of every Pauli-product measurement on every graph state, and that reproducing the finer…
desk verdict Nearest-neighbor classical communication reproduces all global Pauli correlations on graph states, but the subcorrelation lower bound needs a missing algebraic step. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the communication-assisted local-hidden-variable model itself. Each graph state is defined by stabilizer generators $G_j = X_j \prod_{k \in N(j)} Z_k$, and the model assigns hidden variables $z_j$, $x_j = \prod_{k \in N(j)} z_k$, and $y_j = z_j x_j$ to every site. Site $j$ sends its neighbors the bit $c_j = 0$ for $I$ or $Z$, $c_j = 1$ for $X$ or $Y$, and flips its output when the number of $X/Y$-measuring neighbors, $t_j = \sum_{k \in N(j)} c_k \bmod 4$, falls in the range prescribed by rules 3 and 4. The correctness proof uses two structural facts: the $n$-tuples of hidden variables form an abelian group whose coset decomposition matches the stabilizer's classification of Pauli products, and multiplying a Pauli product by a stabilizer generator changes only neighboring sites' measurements and phases in a way the sign-flip rules exactly compensate. For the no-go results, the load-bearing structures are the five submeasurement constraints (10a)–(10e) on a triangle-arranged ring graph, whose right-hand sides are claimed to satisfy an algebraic identity forcing $1 = -1$, and the notion of site invariance, which forbids symmetric nodes from making different sign-flip decisions.
What would settle it
Compute the right-hand sides of constraints (10a)–(10e) explicitly for the $n=12$ ring with $f=1$; if the product of the last four is not equal to the first, the asserted contradiction $1=-1$ fails and the communication-distance bound is not proven. For the positive claim, run the model on every Pauli product and every submeasurement of a small graph such as the $3\times3$ cluster state: quantum mechanics fixes the outcome whenever $\pm M$ is in the stabilizer, so a single mismatch would falsify the model's claimed correctness.
Extended reading notes
Core claim
The paper's central claim is that the global correlation of any Pauli product $M = \bigotimes_j M_j$ on any graph state can be matched by a classical model with local outputs and one round of nearest-neighbor communication. The hidden variables are binary values $z_j = \pm 1$; the model defines $x_j = \prod_{k \in N(j)} z_k$ and $y_j = z_j x_j$, and each site sends its neighbors a single bit saying whether it measures $X/Y$ or $I/Z$. Site $j$'s output is the relevant hidden variable, flipped according to the number of neighbors measuring $X$ or $Y$ modulo 4, as specified in rules 1–4. The proof that this works first treats a no-communication version: products of the hidden variables form a group whose cosets mirror the stabilizer structure, giving the right random answer outside the stabilizer and the right $+1$ for stabilizer elements; an induction over stabilizer generators then shows that the sign-flip rules repair the only remaining case, $-M$ in the stabilizer. The paper additionally proves the negative part: for ring graph states with $n = 12f$ qubits arranged as a triangle, five global Pauli measurements with certain submeasurements force five constraints on any distance-$d$ model, and an algebraic identity among those constraints yields the contradiction $1 = -1$ whenever $d \le 4\lfloor n/24 - 1/2\rfloor + 1$. It also shows that any site-invariant protocol built on these hidden variables fails on some graph states, while a site-invariant protocol with unlimited communication succeeds on all one-dimensional cluster states.
Load-bearing premise
The proof that limited communication distance cannot reproduce all subset correlations depends on an unstated algebraic identity: that multiplying four of the five derived equations gives exactly the fifth equation, forcing $1=-1$; if this identity is wrong, the lower bound on communication distance is not established.
Editorial extensions
If this is right
- For any graph state, the full set of global Pauli-product statistics is classically simulable with communication cost equal to twice the number of edges, in a single round, between neighboring qubits only.
- Reproducing all subcorrelations is strictly harder: on some $n$-qubit graph states any protocol must let information travel over at least $n/6$ edges, so constant-distance or sublinear-distance models fail somewhere.
- Symmetry is a separate obstruction: a site-invariant protocol built on these hidden variables, even one allowed unlimited communication, cannot reproduce all subcorrelations on every graph state; the $2\times3$ cluster state is a concrete counterexample.
- One-dimensional cluster states are exceptional: a site-invariant protocol with unlimited communication reproduces all of their subcorrelations, separating them from two-dimensional cluster states.
Reading between the lines
- The lower bound gives a way to quantify contextuality of a graph state: the minimal communication distance needed to reproduce all its subcorrelations, which is at least $n/6$ for some ring states.
- The site-invariance failure on two-dimensional cluster states may indicate why measurement-based quantum computation is hard to simulate classically even though global Pauli correlations are easy: the computational power may reside in subcorrelations, not in global products.
- A direct numerical check of the five-constraint identity on small rings ($f=1,3,5$) would be a cheap way to test the no-go theorem's most fragile step before relying on it.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a communication-assisted local-hidden-variable (LHV) model for graph states, in which each node holds a binary hidden variable z_j and derives x_j and y_j as products of neighboring z's. A single round of nearest-neighbor classical communication (each node sends one bit indicating whether it measures X or Y) is used to decide sign flips of the local outputs. The authors prove that, for any graph state and any n-fold tensor product of Pauli operators, the product of all parties' outputs matches the quantum prediction in all three stabilizer cases: +1, -1, or random. They then study submeasurements, i.e., products over subsets of the parties. They show that any communication-assisted LHV model with communication distance d bounded by Eq. (6) must fail on some submeasurements for some graph state, by constructing a 12f-node ring (f odd) and deriving five constraints Eqs. (10a)-(10e) whose product yields the contradiction 1 = -1. They also prove that any site-invariant communication protocol based on their hidden variables fails for some submeasurements on a 2x3 cluster state, while a site-invariant protocol with unlimited communication successfully reproduces all subcorrelations for one-dimensional cluster states. The paper concludes that reproducing all subcorrelations requires communication distance scaling at least as n/6 and that site symmetry is an additional obstruction for two-dimensional cluster states.
Significance. The positive result is a clean and explicit construction: a simple nearest-neighbor communication protocol reproduces all global Pauli correlations of arbitrary graph states, which sharpens our understanding of the nonlocality of graph states and of the communication resources needed to simulate them. The negative results are also significant: they establish that global correlations are far easier to simulate than subcorrelations, and they identify communication distance and site-invariance as two independent limitations. The proofs are self-contained, the counterexamples are explicit and checkable, and the model has no fitted parameters. A particularly valuable feature is the constructive site-invariant protocol for one-dimensional cluster states, which gives a positive counterpart to the impossibility result. If the missing algebraic verification in Sec. IV A is supplied, the paper's central claims are correct and the work constitutes a useful contribution to the study of classical simulation of quantum correlations.
major comments (2)
- [Sec. IV A, Eqs. (10a)-(10e)] The contradiction 1 = -1 rests on the assertion that the right-hand side of Eq. (10a) equals the product of the right-hand sides of Eqs. (10b)-(10e). The manuscript says this follows from the partition identity A = A∩(S1∪...∪S6) and the fact that all variables square to 1, but no calculation is shown. This is a load-bearing step for the communication-distance lower bound. I have checked the identity by tracking the multiplicity of every variable: each x_j^Y and y_j^Y appears exactly twice in the product of (10b)-(10e), each x_j^X appears once, and the special-point factors reduce to x_{2f}x_{4f}x_{6f}x_{8f}x_{10f}x_{12f}. The identity is therefore true, but the proof as written obliges the reader to reproduce a nontrivial cancellation. Please include the full derivation, either in the main text or in an appendix, so that the proof of Eq. (6) is self-contained.
- [Sec. IV A, final paragraph] The statement that the contradiction can be adapted to two-dimensional cluster states, in particular that a (3f+3)×(3f+3) cluster state with f odd requires communication distance at least 2f, is given without proof or reference. If this is a standalone claim, it needs a proof sketch or a citation; if it is not needed for the main theorem, it should be explicitly labeled as a conjecture or removed.
minor comments (5)
- [Sec. IV C] The use of S1 and S2 to denote sentences in the proof for one-dimensional cluster states clashes with the segment notation S1,...,S6 introduced in Sec. IV A. Consider renaming one of the two notations to avoid confusion.
- [Sec. III B] The sentence 'the value returned for a measurement of G_j, which is 1' is potentially misleading: the product of the outputs for the generator G_j is +1, but the value at site j alone is x_j. Please clarify that the statement refers to the product over all parties.
- [Sec. IV B] The sentence 'In this second case, rules 1–4 say that the two qubits measuring Y at nodes 2 and 5 should introduce a sign flip' could be misread as applying the rules to the submeasurement ~M in isolation. The intended meaning is that these are the sign-flip decisions made in the context of the global measurement M = Y1Y2Y3Y4Y5Y6. Please make this explicit.
- [Sec. III B, proof for case (iii)] The argument that the n-tuples (z_1^{a_1},...,z_n^{a_n}) form a complete set of coset representatives is stated very tersely. Adding one sentence explaining that the two subgroups intersect only at the identity and have equal order would aid readability.
- [General] There are minor typographical and spacing artifacts in the text (e.g., 'S treet' in the affiliations), presumably from the production process; these should be cleaned up in the final version.
Circularity Check
No significant circularity: the LHV model is constructed and then verified by induction against stabilizer predictions, and the negative results are contradiction arguments from independent subcorrelation constraints.
full rationale
The paper is not significantly circular. The positive model is defined explicitly (Eqs. (2) and rules 1–4) and then verified by induction against the stabilizer-formalism outcomes; the hidden-variable definitions intentionally track the stabilizer generators, but that is a stated construction choice rather than an unacknowledged input, and the nontrivial content lies in the independent verification of cases (ii) and (iii) and in the no-go proofs. The Sec. IV A lower bound is a contradiction argument from the assumption that a distance-d model reproduces all subcorrelations; it is not fitted to any data. Its only fragile point is the unstated algebraic identity asserted after Eqs. (10a)–(10e): the paper says that "the right-hand side of Eq. (10a) is equal to the product of the right-hand sides of the other four equations," yielding 1 = -1. This is an omitted proof that should be checked, but it is not circularity: the five constraints are themselves derived from independent quantum stabilizer predictions, and if the identity fails the argument collapses on grounds of correctness, not circular reasoning. The two self-citations (Ref. [8] as inspiration; Ref. [13] for a deferred classification) are present but not load-bearing for the central theorems.
Assumptions & free parameters
assumptions (5)
- standard math The stabilizer description of graph states: a graph state is the unique simultaneous +1 eigenstate of operators G_j = X_j ∏_{k∈N(j)} Z_k, and every stabilizer element has product form.
- ad hoc to paper The hidden variables z_j are independent and uniformly random over ±1.
- ad hoc to paper The hidden-variable algebra is commutative and has no imaginary unit: x_j = ∏_{k∈N(j)} z_k, y_j = x_j z_j, with x_j^2 = y_j^2 = z_j^2 = 1.
- ad hoc to paper Site-invariance is a defining property of the restricted protocol class in Sec. IV B: nodes in identical situations under graph automorphisms must make the same sign-flip decision.
- domain assumption The ring construction in Sec. IV A restricts attention to a particular infinite family of graph states (12f-node rings, plus isolated nodes for other n) to derive the communication-distance lower bound.
Cite this review
Pith. "Pith review of Modeling Pauli measurements on graph states with nearest-neighbor classical communication." pith.science (2026). https://pith.science/paper/YATATJJX
@misc{pith2026quant-ph0603032,
author = {Pith},
title = {Pith review of: Modeling Pauli measurements on graph states with nearest-neighbor classical communication},
year = {2026},
howpublished = {\url{https://pith.science/paper/YATATJJX}},
note = {Machine review of arXiv:quant-ph/0603032}
}
read the original abstract
We propose a communication-assisted local-hidden-variable model that yields the correct outcome for the measurement of any product of Pauli operators on an arbitrary graph state, i.e., that yields the correct global correlation among the individual measurements in the Pauli product. Within this model, communication is restricted to a single round of message passing between adjacent nodes of the graph. We show that any model sharing some general properties with our own is incapable, for at least some graph states, of reproducing the expected correlations among all subsets of the individual measurements. The ability to reproduce all such correlations is found to depend on both the communication distance and the symmetries of the communication protocol.
Figures
Reference graph
Works this paper leans on
-
[1]
Each site at which an X or a Z is measured broad- casts the measurement performed upon it
-
[2]
This clearly gets any stabilizer right and thus all global correlations right
Each site that measures X determines if it is the middle (implying an odd number of Xs) qubit in a 8 word of the form (11c) in a submeasurement sen- tence, and if so, flips its hidden-variable entry, i.e., changesx to −x. This clearly gets any stabilizer right and thus all global correlations right. The only question remaining is whether this protocol work...
-
[3]
If Mj =X,vj = { xj if tj = 0, 1, −xj if tj = 2, 3
-
[4]
If Mj =Y , vj = { yj if tj = 1, 2, −yj if tj = 0, 3. This protocol reproduces the quantum predictions for any global Pauli measurement on graph states, as we show in the next subsection. In other words, if we take the product of the outputs from all the sites, the result is the same as the quantum prediction for a measurement of the operator M = ⨂ n j=1Mj...
-
[5]
Stabilizer codes can be realized as graph codes
D. Schlingemann, quant-ph/0111080
-
[6]
Van den Nest, J
M. Van den Nest, J. Dehaene, and B. De Moor, Phys. Rev. A 69, 022316 (2004)
2004
-
[7]
H. J. Briegel and R. Raussendorf, Phys. Rev. Lett. 86, 910 (2001)
2001
-
[8]
Raussendorf and H
R. Raussendorf and H. J. Briegel, Phys. Rev. Lett. 86, 5188 (2001)
2001
Show all 17 references
-
[9]
M. Hein, W. D¨ ur, J. Eisert, R. Raussendorf, M. Van den Nest and H.-J. Briegel, quant-ph/0602096
-
[10]
G¨ uhne, G
O. G¨ uhne, G. T´ oth, P. Hyllus, and H. J. Briegel, Phys. Rev. Lett. 95, 120405 (2005)
2005
-
[11]
Scarani, A
V. Scarani, A. Ac ´in, E. Schenck, and M. Aspelmeyer, Phys. Rev. A 71, 042325 (2005)
2005
-
[12]
T. E. Tessier, C. M. Caves, I. H. Deutsch, B. Eastin, and D. Bacon, Phys. Rev. A 72, 032305 (2005)
2005
-
[13]
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, England, 2000), Sec. 10.5.3
2000
-
[14]
Diestel, Graph Theory (Springer-Verlag New York, Inc., 2000)
R. Diestel, Graph Theory (Springer-Verlag New York, Inc., 2000)
2000
-
[15]
Anders and H
S. Anders and H. J. Briegel, Phys. Rev. A 73, 022334 (2006)
2006
- [16]
-
[17]
M. B. Elliott, B. Eastin, and C. M. Caves, in preparation
Reviewed August 28, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.