{
  "annotation_id": "14a915a7-0eea-4bb2-ab7b-b2ddbb572c0d",
  "date_created": "2026-03-02T18:02:41.157000Z",
  "date_modified": "2026-03-02T18:02:41.157000Z",
  "file_hash": "012097bc70ac037b90d4d26f7238148099d8fe546f3ee6118c73c71bc45d4de1",
  "private": false,
  "record": {
    "abstract": "I assess the potential of quantum computation. Broad and important\napplications must be found to justify construction of a quantum computer; I\nreview some of the known quantum algorithms and consider the prospects for\nfinding new ones. Quantum computers are notoriously susceptible to making\nerrors; I discuss recently developed fault-tolerant procedures that enable a\nquantum computer with noisy gates to perform reliably. Quantum computing\nhardware is still in its infancy; I comment on the specifications that should\nbe met by future hardware. Over the past few years, work on quantum computation\nhas erected a new classification of computational complexity, has generated\nprofound insights into the nature of decoherence, and has stimulated the\nformulation of new techniques in high-precision experimental physics. A broad\ninterdisciplinary effort will be needed if quantum computers are to fulfill\ntheir destiny as the world\u0027s fastest computing devices. (This paper is an\nexpanded version of remarks that were prepared for a panel discussion at the\nITP Conference on Quantum Coherence and Decoherence, 17 December 1996.)",
    "arxiv_id": "quant-ph/9705032",
    "authors": [
      "John Preskill"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1098/rspa.1998.0171",
    "journal_ref": "Proc.Roy.Soc.Lond. A454 (1998) 469-486",
    "title": "Quantum Computing: Pro and Con",
    "url": "https://arxiv.org/abs/quant-ph/9705032"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2497bf2a-0e1d-4523-8546-11538af32695",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}