{
  "id": "0809.5063",
  "version": "v2",
  "published": "2008-09-30T16:08:01.000Z",
  "updated": "2008-12-17T18:29:57.000Z",
  "title": "The Fibonacci scheme for fault-tolerant quantum computation",
  "authors": [
    "Panos Aliferis",
    "John Preskill"
  ],
  "comment": "24 pages, 10 figures; supersedes arXiv:0709.3603. (v2): Additional discussion about the overhead cost",
  "journal": "Phys. Rev. A 79, 012332 (2009)",
  "doi": "10.1103/PhysRevA.79.012332",
  "categories": [
    "quant-ph"
  ],
  "abstract": "We rigorously analyze Knill's Fibonacci scheme for fault-tolerant quantum computation, which is based on the recursive preparation of Bell states protected by a concatenated error-detecting code. We prove lower bounds on the threshold fault rate of .67\\times 10^{-3} for adversarial local stochastic noise, and 1.25\\times 10^{-3} for independent depolarizing noise. In contrast to other schemes with comparable proved accuracy thresholds, the Fibonacci scheme has a significantly reduced overhead cost because it uses postselection far more sparingly.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2008-12-17T18:29:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "03.67.Lx",
      "03.67.Pp"
    ],
    "keywords": [
      "fault-tolerant quantum computation",
      "rigorously analyze knills fibonacci scheme",
      "adversarial local stochastic noise",
      "threshold fault rate",
      "significantly reduced overhead cost"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Physical Review A",
      "year": 2009,
      "month": "Jan",
      "volume": 79,
      "number": 1,
      "pages": "012332"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 24,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009PhRvA..79a2332A"
    }
  }
}