{
  "id": "0907.5449",
  "version": "v3",
  "published": "2009-07-31T00:25:37.000Z",
  "updated": "2013-04-27T17:11:17.000Z",
  "title": "Contextuality in Measurement-based Quantum Computation",
  "authors": [
    "Robert Raussendorf"
  ],
  "comment": "Version 3: probabilistic version of Theorem 1 added",
  "doi": "10.1103/PhysRevA.88.022322",
  "categories": [
    "quant-ph"
  ],
  "abstract": "We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a super-polynomial speedup over the best known classical algorithm, namely the quantum algorithm that solves the Discrete Log problem.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2013-04-27T17:11:17.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "measurement-based quantum computation",
      "contextuality",
      "discrete log problem",
      "non-linear boolean function",
      "high probability"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Phys. Rev. A"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0907.5449R"
    }
  }
}