{
  "annotation_id": "3a0bcc1e-e910-4c87-b53e-0d249abfd36e",
  "date_created": "2026-03-02T18:02:33.448000Z",
  "date_modified": "2026-03-02T18:02:33.448000Z",
  "file_hash": "3383cfd2fa08fbcc5998b2537eb68808c2623935e41824e1b6571b9d32de96a8",
  "private": false,
  "record": {
    "abstract": "We present a computational framework based on geometric structures. No\nquantum mechanics is involved, and yet the algorithms perform tasks analogous\nto quantum computation. Tensor products and entangled states are not needed --\nthey are replaced by sets of basic shapes. To test the formalism we solve in\ngeometric terms the Deutsch-Jozsa problem, historically the first example that\ndemonstrated the potential power of quantum computation. Each step of the\nalgorithm has a clear geometric interpetation and allows for a cartoon\nrepresentation.",
    "arxiv_id": "quant-ph/0611279",
    "authors": [
      "Diederik Aerts",
      "Marek Czachor"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/1751-8113/40/13/F01",
    "journal_ref": "J. Phys. A: Math. Theor. 40 (2007) F259-F266",
    "title": "Cartoon Computation: Quantum-like computing without quantum mechanics",
    "url": "https://arxiv.org/abs/quant-ph/0611279"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "62d6ee8d-f05e-48f0-a9f4-b30677c37ca0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}