{
  "id": "1310.2984",
  "version": "v3",
  "published": "2013-10-10T23:21:37.000Z",
  "updated": "2014-07-22T19:44:54.000Z",
  "title": "Fault-Tolerant Quantum Computation with Constant Overhead",
  "authors": [
    "Daniel Gottesman"
  ],
  "comment": "32 pages. v2 has new title, discussion of hyperbolic codes, other minor edits. v3 has additional corrections and clarifications",
  "categories": [
    "quant-ph"
  ],
  "abstract": "What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2014-07-22T19:44:54.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "fault-tolerant quantum computation",
      "constant overhead",
      "quantum low-density parity check codes",
      "large fault-tolerant quantum circuit"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 32,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1310.2984G"
    }
  }
}