{
  "annotation_id": "84a3ef00-e33b-438e-92fc-64a5004c2251",
  "date_created": "2026-03-02T18:02:41.716000Z",
  "date_modified": "2026-03-02T18:02:41.716000Z",
  "file_hash": "f6b4892b5ba951bdddea109c518149354c9f66074d8fe72354a147b1977ffa2a",
  "private": false,
  "record": {
    "abstract": "Quantum computers require quantum logic, something fundamentally different to\nclassical Boolean logic. This difference leads to a greater efficiency of\nquantum computation over its classical counter-part. In this review we explain\nthe basic principles of quantum computation, including the construction of\nbasic gates, and networks. We illustrate the power of quantum algorithms using\nthe simple problem of Deutsch, and explain, again in very simple terms, the\nwell known algorithm of Shor for factorisation of large numbers into primes. We\nthen describe physical implementations of quantum computers, focusing on one in\nparticular, the linear ion-trap realization. We explain that the main obstacle\nto building an actual quantum computer is the problem of decoherence, which we\nshow may be circumvented using the methods of quantum error correction.",
    "arxiv_id": "quant-ph/9802065",
    "authors": [
      "Vlatko Vedral",
      "Martin B. Plenio"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/S0079-6727(98)00004-4",
    "journal_ref": "Prog.Quant.Electron.22:1,1998",
    "title": "Basics of Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/9802065"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "97bc8de0-4bd5-4ccc-a4b9-28570eb536b4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}