{
  "annotation_id": "95cb66b0-092f-4ccd-b658-b5616839ebfd",
  "date_created": "2026-03-02T18:02:48.187000Z",
  "date_modified": "2026-03-02T18:02:48.187000Z",
  "file_hash": "a02898ce109c7e6fad9dcb0026f4753493e731d33f754e6f239a4bebaf123b7b",
  "private": false,
  "record": {
    "abstract": "Residue arithmetic is an elegant and convenient way of computing with\nintegers that exceed the natural word size of a computer. The algorithms are\nhighly parallel and hence naturally adapted to quantum computation. The process\ndiffers from most quantum algorithms currently under discussion in that the\noutput would presumably be obtained by classical superposition of the output of\nmany identical quantum systems, instead of by arranging for constructive\ninterference in the wave function of a single quantum computer.",
    "arxiv_id": "quant-ph/9911050",
    "authors": [
      "S. A. Fulling"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Possible New Quantum Algorithm: Arithmetic with Large Integers via the   Chinese Remainder Theorem",
    "url": "https://arxiv.org/abs/quant-ph/9911050"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7a11d72a-509e-46d2-9106-92956156d607",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}