{
  "id": "oai:papers.qnfo.org:zx-diagram-fault-lines",
  "slug": "zx-diagram-fault-lines",
  "title": "ZX Diagrams at the Seam: Spiders, Pauli Webs, Gadgets, and the Cafeteria Problem of Cross-Disciplinary Imports",
  "authors": [
    "Rowan Brad Quni-Gudzinas"
  ],
  "abstract": "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. This paper performs a fault-line audit of the three central constructs. It tables, for each construct, the exact import provenance — which discipline it came from, what it silently carries — and audits the mutual compatibility of those imports. The finding is precise: within the computational domain (circuits, codes, compilation) the imports are demonstrably coherent, and the diagrams earn every bit of their success; the fault lines appear exactly where 3+1-dimensional particle physics and 1-dimensional thermodynamics are mixed into a 2-dimensional map without any compatibility check. The paper then names the seam — the place where each diagram stops being a map and starts being mistaken for territory — and generalizes the resulting \"cafeteria problem\": siloed disciplines remain separate except when it is convenient to mix their imports, with no regard for mutual compatibility. The conclusion is not that the diagrams are wrong; it is that they are maps, and the discipline of using a map is knowing where it ends. Every claim here is either an externally verified fact about the literature, or an explicitly marked argument; the premises the argument rests on — that a formalism can be about a physical reality at all, that unchecked import-mixing is epistemically risky, and that the distinction between a picture of computation and a picture of reality is well-founded — are stated plainly in the final section, where the paper's own map ends.",
  "abstract_markdown": "Diagrammatic languages are the most successful interface between quantum computing and the\nhuman mind. The ZX calculus — with its spiders, Pauli webs, and gadgets — is taught as *the*\nintuitive picture of quantum processes, and its completeness theorems are among the finest\nresults in the field. Yet the same diagrams are increasingly being loaded with imports from\ndisciplines that have nothing in common with a drawing plane: loop-quantum-gravity spin\nnetworks, quantum groups, holographic entropy, and toy black holes. This paper performs a\nfault-line audit of the three central constructs. It tables, for each construct, the exact\nimport provenance — which discipline it came from, what it silently carries — and audits the\nmutual compatibility of those imports. The finding is precise: within the computational domain\n(circuits, codes, compilation) the imports are demonstrably coherent, and the diagrams earn\nevery bit of their success; the fault lines appear exactly where 3+1-dimensional particle\nphysics and 1-dimensional thermodynamics are mixed into a 2-dimensional map without any\ncompatibility check. The paper then names the seam — the place where each diagram stops being a\nmap and starts being mistaken for territory — and generalizes the resulting \"cafeteria problem\":\nsiloed disciplines remain separate except when it is convenient to mix their imports, with no\nregard for mutual compatibility. The conclusion is not that the diagrams are wrong; it is that\nthey are maps, and the discipline of using a map is knowing where it ends. Every claim here is\neither an externally verified fact about the literature, or an explicitly marked argument; the\npremises the argument rests on — that a formalism can be about a physical reality at all, that\nunchecked import-mixing is epistemically risky, and that the distinction between a picture of\ncomputation and a picture of reality is well-founded — are stated plainly in the final section,\nwhere the paper's own map ends.",
  "date": "2026-08-18",
  "first_published": "2026-08-18",
  "last_revised": "2026-08-18T00:00:00Z",
  "modified": "2026-08-18T00:00:00Z",
  "version": "0.4.1",
  "version_count": 1,
  "language": "en",
  "keywords": [
    "ZX calculus",
    "diagrammatic reasoning",
    "quantum computing",
    "map-territory",
    "epistemology",
    "import provenance"
  ],
  "quality_tags": [
    "High-quality scholarly research",
    "open-access scholarly work",
    "versioned research publication"
  ],
  "quality_label": "High-quality scholarly research",
  "quality_basis": "QNFO publisher classification for open-access, versioned research with a public revision history and reader correction channel; this is not a claim of independent peer review.",
  "quality_evidence_url": "https://qnfo.org/about",
  "peer_review_status": "Not independently peer-reviewed",
  "resource_type": "ScholarlyArticle",
  "doi": null,
  "doi_url": null,
  "url": "https://papers.qnfo.org/papers/zx-diagram-fault-lines",
  "license_url": "https://legal.qnfo.org/",
  "license_spdx": null,
  "sha256": "3df0eac4d3a8fb078ef8043d688db6682ef9c8ad1457f8c8593901addb9d6d34",
  "version_url": "https://papers.qnfo.org/papers/zx-diagram-fault-lines/v/0.4.1",
  "datacite": {
    "schemaVersion": "http://datacite.org/schema/kernel-4",
    "identifiers": [
      {
        "identifier": "https://papers.qnfo.org/papers/zx-diagram-fault-lines",
        "identifierType": "URL"
      }
    ],
    "creators": [
      {
        "name": "Rowan Brad Quni-Gudzinas",
        "nameType": "Personal",
        "nameIdentifiers": [
          {
            "nameIdentifier": "https://orcid.org/0009-0002-4317-5604",
            "nameIdentifierScheme": "ORCID",
            "schemeUri": "https://orcid.org"
          }
        ]
      }
    ],
    "titles": [
      {
        "title": "ZX Diagrams at the Seam: Spiders, Pauli Webs, Gadgets, and the Cafeteria Problem of Cross-Disciplinary Imports"
      }
    ],
    "publisher": "QNFO",
    "publicationYear": "2026",
    "resourceType": {
      "resourceTypeGeneral": "Text",
      "resourceType": "ScholarlyArticle"
    },
    "subjects": [
      {
        "subject": "ZX calculus"
      },
      {
        "subject": "diagrammatic reasoning"
      },
      {
        "subject": "quantum computing"
      },
      {
        "subject": "map-territory"
      },
      {
        "subject": "epistemology"
      },
      {
        "subject": "import provenance"
      },
      {
        "subject": "High-quality scholarly research",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      },
      {
        "subject": "open-access scholarly work",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      },
      {
        "subject": "versioned research publication",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      }
    ],
    "dates": [
      {
        "date": "2026-08-18",
        "dateType": "Issued"
      },
      {
        "date": "2026-08-18",
        "dateType": "Updated"
      }
    ],
    "language": "en",
    "version": "0.4.1",
    "rightsList": [
      {
        "rightsUri": "https://legal.qnfo.org/"
      }
    ],
    "descriptions": [
      {
        "description": "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. This paper performs a fault-line audit of the three central constructs. It tables, for each construct, the exact import provenance — which discipline it came from, what it silently carries — and audits the mutual compatibility of those imports. The finding is precise: within the computational domain (circuits, codes, compilation) the imports are demonstrably coherent, and the diagrams earn every bit of their success; the fault lines appear exactly where 3+1-dimensional particle physics and 1-dimensional thermodynamics are mixed into a 2-dimensional map without any compatibility check. The paper then names the seam — the place where each diagram stops being a map and starts being mistaken for territory — and generalizes the resulting \"cafeteria problem\": siloed disciplines remain separate except when it is convenient to mix their imports, with no regard for mutual compatibility. The conclusion is not that the diagrams are wrong; it is that they are maps, and the discipline of using a map is knowing where it ends. Every claim here is either an externally verified fact about the literature, or an explicitly marked argument; the premises the argument rests on — that a formalism can be about a physical reality at all, that unchecked import-mixing is epistemically risky, and that the distinction between a picture of computation and a picture of reality is well-founded — are stated plainly in the final section, where the paper's own map ends.",
        "descriptionType": "Abstract"
      },
      {
        "description": "Publisher quality classification: High-quality scholarly research. QNFO publisher classification for open-access, versioned research with a public revision history and reader correction channel; this is not a claim of independent peer review.",
        "descriptionType": "Other"
      },
      {
        "description": "Peer review status: Not independently peer-reviewed",
        "descriptionType": "Other"
      }
    ],
    "formats": [
      "text/html"
    ]
  }
}