{
  "id": "0910.1024",
  "version": "v3",
  "published": "2009-10-06T16:01:23.000Z",
  "updated": "2010-03-02T16:32:42.000Z",
  "title": "Universal quantum computation using the discrete time quantum walk",
  "authors": [
    "Neil B. Lovett",
    "Sally Cooper",
    "Matthew Everitt",
    "Matthew Trevers",
    "Viv Kendon"
  ],
  "comment": "9 pages, 10 figures. Updated after referee comments - Section V expanded and minor changes to other parts of the text",
  "journal": "Phys. Rev. A. 81, 042330 (2010)",
  "doi": "10.1103/PhysRevA.81.042330",
  "categories": [
    "quant-ph"
  ],
  "abstract": "A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time quantum walk. We show the discrete time quantum walk is able to implement the same universal gate set and thus both discrete and continuous time quantum walks are computational primitives. Additionally we give a set of components on which the discrete time quantum walk provides perfect state transfer.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2010-03-02T16:32:42.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "03.67.Ac",
      "05.40.Fb"
    ],
    "keywords": [
      "discrete time quantum walk",
      "universal quantum computation",
      "continuous time quantum walks",
      "perfect state transfer",
      "universal gate set"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Physical Review A",
      "year": 2010,
      "month": "Apr",
      "volume": 81,
      "number": 4,
      "pages": "042330"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010PhRvA..81d2330L"
    }
  }
}