{
  "annotation_id": "75c7fb34-bc69-465c-aca8-82d26f6185d1",
  "date_created": "2026-03-02T18:02:44.655000Z",
  "date_modified": "2026-03-02T18:02:44.655000Z",
  "file_hash": "faad5c8e84b37117b1c10306b4e105e099a8a8c4e7d7fb5f9634e10e85c74af0",
  "private": false,
  "record": {
    "abstract": "The topical quantum computation paradigm is a transposition of the Turing\nmachine into the quantum framework. Implementations based on this paradigm have\nlimitations as to the number of: qubits, computation steps, efficient quantum\nalgorithms (found so far). A new exclusively quantum paradigm (with no\nclassical counterpart) is propounded, based on the speculative notion of\ncontinuous uncomplete von Neumann measurement. Under such a notion, NP-complete\nis equal to P. This can provide a mathematical framework for the search of\nimplementable paradigms, possibly exploiting particle statistics.",
    "arxiv_id": "quant-ph/9810017",
    "authors": [
      "Giuseppe Castagnoli"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "An Inherently Quantum Computation Paradigm: NP-complete=P Under the   Hypothetical Notion of Continuous Uncomplete von Neumann Measurement",
    "url": "https://arxiv.org/abs/quant-ph/9810017"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0fb9a6a9-48ef-42db-8fe9-7719c265dcfb",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}