{
  "annotation_id": "2b4da399-82b1-46ae-96d6-9bfbd5f383b1",
  "date_created": "2026-03-02T18:02:41.158000Z",
  "date_modified": "2026-03-02T18:02:41.158000Z",
  "file_hash": "cbee2f68ba0fa5688e1927b1fed745a532d6142cba0150faffee6a4f8e1e7b88",
  "private": false,
  "record": {
    "abstract": "Computation is currently seen as a forward propagator that evolves (retards)\na completely defined initial vector into a corresponding final vector. Initial\nand final vectors map the (logical) input and output of a reversible Boolean\nnetwork respectively, whereas forward propagation maps a one-way propagation of\nlogical implication, from input to output. Conversely, hard NP-complete\nproblems are characterized by a two-way propagation of logical implication from\ninput to output and vice versa, given that both are partly defined from the\nbeginning. Logical implication can be propagated forward and backward in a\ncomputation by constructing the gate array corresponding to the entire\nreversible Boolean network and constraining output bits as well as input bits.\nThe possibility of modeling the physical process undergone by such a network by\nusing a retarded and advanced in time propagation scheme is investigated. PACS\nnumbers: 89.70.+c, 02.50.-r, 03.65.-w, 89.80.+h",
    "arxiv_id": "quant-ph/9706019",
    "authors": [
      "Giuseppe Castagnoli"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/S0167-2789(98)00044-X",
    "title": "Quantum Computation Based on Retarded and Advanced Propagation",
    "url": "https://arxiv.org/abs/quant-ph/9706019"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "1a4bd520-4126-4352-9249-2a6b50f457a4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}