{
  "id": "1802.06176",
  "version": "v1",
  "published": "2018-02-17T02:56:35.000Z",
  "updated": "2018-02-17T02:56:35.000Z",
  "title": "Classical simulation of a topological quantum computer",
  "authors": [
    "Bernard Field",
    "Tapio Simula"
  ],
  "comment": "46 pages, 50 figures",
  "categories": [
    "quant-ph",
    "cond-mat.quant-gas"
  ],
  "abstract": "Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-02-17T02:56:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "classical simulation",
      "jones polynomial",
      "perform quantum computation",
      "exotic exchange statistics",
      "perform specific operations"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 46,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}