{
  "annotation_id": "4cef1586-da34-45e3-80a3-6cbd3b7de36f",
  "date_created": "2026-03-02T18:01:41.783000Z",
  "date_modified": "2026-03-02T18:01:41.783000Z",
  "file_hash": "d98311109edbd253c111cd8f78ca4c353fdaf2d36133ef74deaf01d5c5b8cb16",
  "private": false,
  "record": {
    "abstract": "Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and\nfunction evaluations 3 Algorithms and their complexity 4 From interferometers\nto computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase\nestimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional\nquantum dynamics 11 Decoherence and recoherence 12 Concluding remarks",
    "arxiv_id": "quant-ph/0011013",
    "authors": [
      "Artur Ekert",
      "Patrick Hayden",
      "Hitoshi Inamori"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/3-540-45338-5_10",
    "title": "Basic concepts in quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0011013"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e7bc38c2-866e-41d7-97bd-cdc8b5caacf7",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}