ZX Diagrams at the Seam: Spiders, Pauli Webs, Gadgets, and the Cafeteria Problem of Cross-Disciplinary Imports

In the paper's words

Diagrammatic languages are the most successful interface between quantum computing and the human mind. The ZX calculus — with its spiders, Pauli webs, and gadgets — is taught as the intuitive picture of quantum processes, and its completeness theorems are among the finest results in the field. Yet the same diagrams are increasingly being loaded with imports from disciplines that have nothing in common with a drawing plane: loop-quantum-gravity spin networks, quantum groups, holographic entropy, and toy black holes.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

No sentence of this paper reports a figure with a unit or a quantity word, so none is shown.

How it is done

1. Yet the same diagrams that are so carefully proved to capture the algebra of quantum computation are increasingly shown alongside objects that no proof in the calculus touches: spin networks from loop quantum gravity [5], quantum groups [6], holographic codes with Rényi entropy and toy black holes [7], lattice-surgery geometries [8].

   from 1. Introduction: the satisfaction of diagrams

2. Within the computational domain, the answer is yes, with proof.

   from 4. Compatibility audit: where the map is coherent, and where it is not

3. The seam is exactly where the map's questions stop — and no theorem of the map can see past it.

   from 5. The seam: where the map ends

4. The imports audited here — spin networks, holographic entropy, lattice geometries, fault tolerance — all reappear in the 2026 record, now with new machinery: a complete rewrite theory for fault equivalence, an on-the-nose normal form for stabiliser codes, a calculus for infinite translation-invariant codes, and a Bruhat-Tits building theorem for exact gate synthesis.

   from Appendix: Post-publication evidence from QPL 2026 (added in version 0.4, 2026-08-19)

What would falsify it

1. The negative claim is bounded by the search and by its stated falsifier: a published compatibility audit that establishes mutual consistency of the physical imports — for example, a demonstrated agreement between the holographic dictionary and the 2D diagrammatic semantics — would falsify the "unchecked" component of the claim, and the claim is written to be revised if one appears.

   from 4. Compatibility audit: where the map is coherent, and where it is not

2. The open-problem claim admits a stated disconfirmation: a p-adic or ultrametric graphical calculus for quantum codes.

   from Appendix: Post-publication evidence from QPL 2026 (added in version 0.4, 2026-08-19)

Where the claim stops

1. Three things are assumed rather than derived, and the reader should weigh them accordingly.

   from 8. Conclusion: where this paper's map ends

2. It does not dispute the mathematics of the ZX calculus, which it imports and respects.

   from 1. Introduction: the satisfaction of diagrams

3. It does not claim the diagrams are useless, or that their use is necessarily misleading — within the computational domain they are exactly as good as their theorems say.

   from 1. Introduction: the satisfaction of diagrams

Where to read

1. Abstract311 words · 1 min
2. 1. Introduction: the satisfaction of diagrams469 words · 2 min
3. 2. The calculus and its constructs489 words · 2 min
4. 3. Import provenance: the cafeteria table306 words · 1 min
5. 4. Compatibility audit: where the map is coherent, and where it is not588 words · 3 min
6. 5. The seam: where the map ends323 words · 1 min
7. 6. The cafeteria problem211 words · 1 min
8. 7. Map-aware practice166 words · 1 min
9. 8. Conclusion: where this paper's map ends317 words · 1 min
10. Appendix: Post-publication evidence from QPL 2026 (added in version 0.4, 2026-08-19)700 words · 3 min