{
  "annotation_id": "1af45658-fbad-4c56-9056-b92182ca332c",
  "date_created": "2026-03-02T18:02:40.647000Z",
  "date_modified": "2026-03-02T18:02:40.647000Z",
  "file_hash": "004ad51e65103139133a3f4c6bd83ed9b1b3aaa65a9dcdf5884f5f53c69796ef",
  "private": false,
  "record": {
    "abstract": "A hierarchical, reversible mapping between levels of tree structured\ncomputation, applicable for structuring the Quantum Computation algorithm for\nNP-complete problem is presented. It is proven that confining the state of a\nquantum computer to a subspace of the available Hilbert space, where states are\nconsistent with the problem constraints, can be done in polynomial time. The\nproposed mapping, together with the method of state reduction can be\npotentially used for solving NP-complete problems in polynomial time.",
    "arxiv_id": "quant-ph/9712033",
    "authors": [
      "Wojciech Burkot"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Reversible Mapping for Tree Structured Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/9712033"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "de986403-49e7-49b1-85b4-ec65c1376688",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}