{
  "annotation_id": "738182be-491f-480b-9c51-f77ccba16202",
  "date_created": "2026-03-02T18:02:41.658000Z",
  "date_modified": "2026-03-02T18:02:41.658000Z",
  "file_hash": "4e27044fea7ea3b544c8ae9e5b25f66339a13a541d165a0bdf586d15d61d6b2a",
  "private": false,
  "record": {
    "abstract": "A Quantum Computer is a new type of computer which can solve problems such as\nfactoring and database search very efficiently. The usefulness of a quantum\ncomputer is limited by the effect of two different types of errors, decoherence\nand inaccuracies. In this paper we show the results of simulations of a quantum\ncomputer which consider both decoherence and inaccuracies. We simulate circuits\nwhich factor the numbers 15, 21, 35, and 57 as well as circuits which use\ndatabase search to solve the circuit satisfaction problem. Our simulations show\nthat the error rate per gate is on the order of 10^-6 for a trapped ion quantum\ncomputer whose noise is kept below pi/4096 per gate and with a decoherence rate\nof 10^-6. This is an important bound because previous studies have shown that a\nquantum computer can factor more efficiently than a classical computer if the\nerror rate is of order 10^-6.",
    "arxiv_id": "quant-ph/9804038",
    "authors": [
      "Kevin M. Obenland",
      "Alvin M. Despain"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Simulating the Effect of Decoherence and Inaccuracies on a Quantum   Computer",
    "url": "https://arxiv.org/abs/quant-ph/9804038"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "202484d5-c866-4807-aee5-0784a606bf8d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}