{
  "annotation_id": "fdeed68c-1f1d-4b39-89b3-6c337acef7d6",
  "date_created": "2026-03-02T18:02:13.643000Z",
  "date_modified": "2026-03-02T18:02:13.643000Z",
  "file_hash": "e9adbb2c3c31bd5f275a63bdbb823aa2d5c3eea0925fa5623f53a255a08220db",
  "private": false,
  "record": {
    "abstract": "Algorithmic approach is based on the assumption that any quantum evolution of\nmany particle system can be simulated on a classical computer with the\npolynomial time and memory cost. Algorithms play the central role here but not\nthe analysis, and a simulation gives a \"film\" which visualizes many particle\nquantum dynamics and is demonstrated to a user of the model. Restrictions\nfollowing from the algorithm theory are considered on a level of fundamental\nphysical laws. Born rule for the calculation of quantum probability as well as\nthe decoherence is derived from the existence of a nonzero minimal value of\namplitude module - a grain of amplitude. The limitation on the classical\ncomputational resources gives the unified description of quantum dynamics that\nis not divided to the unitary dynamics and measurements and does not depend on\nthe existence of observer. It is proposed the description of states based on\nthe nesting of particles in each other that permits to account the effects of\nall levels in the same model. Algorithmic approach admits the possibility of\nrefutation, because it forbids the creation of a scalable quantum computer that\nis allowed in the conventional quantum formalism.",
    "arxiv_id": "quant-ph/0412196",
    "authors": [
      "Yuri Ozhigov"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Algorithmic approach to quantum physics",
    "url": "https://arxiv.org/abs/quant-ph/0412196"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "729e21af-b4fe-4c18-8ea7-97a8e9eaa096",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}