{
  "annotation_id": "e250f25a-9bc7-4a35-b456-260cceb747fe",
  "date_created": "2026-03-02T18:02:20.549000Z",
  "date_modified": "2026-03-02T18:02:20.549000Z",
  "file_hash": "18ae4ccfeb69b50c6ecf17ee07c7bf16f6bd3bb19bb89cc2905f4985da49f0dc",
  "private": false,
  "record": {
    "abstract": "The paper is devoted to a new idea of simulation of accounting by quantum\ncomputing. We expose the actual accounting principles in a pure mathematics\nlanguage. After that we simulated the accounting principles on quantum\ncomputers. We show that all arbitrary accounting actions are exhausted by the\ndescribed basic actions. The main problem of accounting are reduced to some\nsystem of linear equations in the economic model of Leontief. In this\nsimulation we use our constructed quantum Gau\\ss-Jordan Elimination to solve\nthe problem and the time of quantum computing is some square root order faster\nthan the time in classical computing.",
    "arxiv_id": "quant-ph/0511063",
    "authors": [
      "Do Ngoc Diep",
      "Do Hoang Giang"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s10773-017-3340-8",
    "journal_ref": "International Journal of Theoretical Physics, Vol. 56(2017)",
    "title": "Accounting Principles are Simulated on Quantum Computers",
    "url": "https://arxiv.org/abs/quant-ph/0511063"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ae834e71-c8a3-48bc-9b2b-29f73e1b0624",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}