{
  "annotation_id": "b47084f8-08c6-4e1e-bcab-bcfb4ce1a2c3",
  "date_created": "2026-02-17T05:53:20.510000Z",
  "date_modified": "2026-02-17T05:53:20.510000Z",
  "file_hash": "a1d9a02b4107382bc42af2f930822deee687b53652b07e3d500108eb30385229",
  "private": false,
  "record": {
    "abstract": "We introduce a category $\\mathsf{qGph}$ of quantum graphs, whose definition is motivated entirely from noncommutative geometry. For all quantum graphs $G$ and $H$ in $\\mathsf{qGph}$, we then construct a quantum graph $[G,H]$ of homomorphisms from $G$ to $H$, making $\\mathsf{qGph}$ a closed symmetric monoidal category. We prove that for all finite graphs $G$ and $H$, the quantum graph $[G,H]$ is nonempty iff the $(G,H)$-homomorphism game has a winning quantum strategy, directly generalizing the classical case.\n  The finite quantum graphs in $\\mathsf{qGph}$ are tracial, real, and self-adjoint, and the morphisms between them are CP morphisms that are adjoint to a unital $*$-homomorphism. We show that Weaver\u0027s two notions of a CP morphism coincide in this context. We also show that every finite reflexive quantum graph is the confusability quantum graph of a quantum channel, answering a question of Daws.",
    "arxiv_id": "2601.09685",
    "authors": [
      "Andre Kornell",
      "Bert Lindenhovius"
    ],
    "categories": [
      "quant-ph",
      "math-ph",
      "math.CT",
      "math.MP",
      "math.OA"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Quantum graphs of homomorphisms",
    "url": "https://arxiv.org/abs/2601.09685",
    "version": "v2"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f23084ee-fe54-4c67-b73a-ed3cbbd56eaf",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}