{
  "id": "oai:papers.qnfo.org:visual-graphs-vs-matrices-epistemic-design",
  "slug": "visual-graphs-vs-matrices-epistemic-design",
  "title": "Visual Graphs vs Matrices: Epistemic Limits, Cognitive Preference, and the Design of Understandable Computation",
  "authors": [
    "Rowan Brad Quni-Gudzinas"
  ],
  "abstract": "The ZX calculus and the matrices of linear algebra denote exactly the same maps. A field that knows this has, nonetheless, converged on the pictures: the community's canonical manual is titled Picturing Quantum Software, and the annual conference's technical program is, to a first approximation, representation engineering. This paper argues that the convergence is not a matter of taste and not a matter of mathematics. It is a fact about bounded cognition: a representation determines what a finite reasoner can see, and diagrams win because they chunk, because their rewrites are locally auditable, and because they draw the interfaces that matrices bury in index bookkeeping. The same boundedness has a second consequence. Where comprehension and optimality diverge — minimal gate counts, minimal depths, minimal widths are hard to compute — the field has not chosen between the two; it has split the difference into a two-layer structure: a human-auditable canonical fragment, and an automated optimizer over it. The claim, stated precisely and with falsifiers, is that this two-layer structure is the signature of any mature technical field with hard optimization problems, and that the design principle it licenses is the one the last decade of quantum software has already been practicing: we design systems that design algorithms that optimize themselves and other systems, with legibility as a first-class constraint. The paper verifies its quantitative claims computationally, situates the claim against the cognitive-science and human-computer-interaction record, and closes by stating where its own premises end.",
  "abstract_markdown": "The ZX calculus and the matrices of linear algebra denote exactly the same maps. A field that knows this has, nonetheless, converged on the pictures: the community's canonical manual is titled *Picturing Quantum Software*, and the annual conference's technical program is, to a first approximation, representation engineering. This paper argues that the convergence is not a matter of taste and not a matter of mathematics. It is a fact about bounded cognition: a representation determines what a finite reasoner can see, and diagrams win because they chunk, because their rewrites are locally auditable, and because they draw the interfaces that matrices bury in index bookkeeping. The same boundedness has a second consequence. Where comprehension and optimality diverge — minimal gate counts, minimal depths, minimal widths are hard to compute — the field has not chosen between the two; it has split the difference into a two-layer structure: a human-auditable canonical fragment, and an automated optimizer over it. The claim, stated precisely and with falsifiers, is that this two-layer structure is the signature of any mature technical field with hard optimization problems, and that the design principle it licenses is the one the last decade of quantum software has already been practicing: we design systems that design algorithms that optimize themselves and other systems, with legibility as a first-class constraint. The paper verifies its quantitative claims computationally, situates the claim against the cognitive-science and human-computer-interaction record, and closes by stating where its own premises end.",
  "date": "2026-08-20",
  "first_published": "2026-08-20",
  "last_revised": "2026-08-20T00:00:00Z",
  "modified": "2026-08-20T00:00:00Z",
  "version": "1.1.0",
  "version_count": 1,
  "language": "en",
  "keywords": [
    "diagrammatic reasoning",
    "cognitive dimensions",
    "ZX calculus",
    "representation theory",
    "epistemology",
    "design"
  ],
  "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/visual-graphs-vs-matrices-epistemic-design",
  "license_url": "https://legal.qnfo.org/",
  "license_spdx": null,
  "sha256": "3770db1c791b813d0faa76fc1801aac2dce84ded5bf1232f910acfc1333bb992",
  "version_url": "https://papers.qnfo.org/papers/visual-graphs-vs-matrices-epistemic-design/v/1.1.0",
  "datacite": {
    "schemaVersion": "http://datacite.org/schema/kernel-4",
    "identifiers": [
      {
        "identifier": "https://papers.qnfo.org/papers/visual-graphs-vs-matrices-epistemic-design",
        "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": "Visual Graphs vs Matrices: Epistemic Limits, Cognitive Preference, and the Design of Understandable Computation"
      }
    ],
    "publisher": "QNFO",
    "publicationYear": "2026",
    "resourceType": {
      "resourceTypeGeneral": "Text",
      "resourceType": "ScholarlyArticle"
    },
    "subjects": [
      {
        "subject": "diagrammatic reasoning"
      },
      {
        "subject": "cognitive dimensions"
      },
      {
        "subject": "ZX calculus"
      },
      {
        "subject": "representation theory"
      },
      {
        "subject": "epistemology"
      },
      {
        "subject": "design"
      },
      {
        "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-20",
        "dateType": "Issued"
      },
      {
        "date": "2026-08-20",
        "dateType": "Updated"
      }
    ],
    "language": "en",
    "version": "1.1.0",
    "rightsList": [
      {
        "rightsUri": "https://legal.qnfo.org/"
      }
    ],
    "descriptions": [
      {
        "description": "The ZX calculus and the matrices of linear algebra denote exactly the same maps. A field that knows this has, nonetheless, converged on the pictures: the community's canonical manual is titled Picturing Quantum Software, and the annual conference's technical program is, to a first approximation, representation engineering. This paper argues that the convergence is not a matter of taste and not a matter of mathematics. It is a fact about bounded cognition: a representation determines what a finite reasoner can see, and diagrams win because they chunk, because their rewrites are locally auditable, and because they draw the interfaces that matrices bury in index bookkeeping. The same boundedness has a second consequence. Where comprehension and optimality diverge — minimal gate counts, minimal depths, minimal widths are hard to compute — the field has not chosen between the two; it has split the difference into a two-layer structure: a human-auditable canonical fragment, and an automated optimizer over it. The claim, stated precisely and with falsifiers, is that this two-layer structure is the signature of any mature technical field with hard optimization problems, and that the design principle it licenses is the one the last decade of quantum software has already been practicing: we design systems that design algorithms that optimize themselves and other systems, with legibility as a first-class constraint. The paper verifies its quantitative claims computationally, situates the claim against the cognitive-science and human-computer-interaction record, and closes by stating where its own premises end.",
        "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"
    ]
  }
}