{
  "id": "1902.05634",
  "version": "v1",
  "published": "2019-02-14T22:44:58.000Z",
  "updated": "2019-02-14T22:44:58.000Z",
  "title": "A quantum compiler for qudits of prime dimension greater than 3",
  "authors": [
    "Luke E. Heyfron",
    "Earl Campbell"
  ],
  "categories": [
    "quant-ph"
  ],
  "abstract": "Prevailing proposals for the first generation of quantum computers make use of 2-level systems, or qubits, as the fundamental unit of quantum information. However, recent innovations in quantum error correction and magic state distillation protocols demonstrate that there are advantages of using d-level quantum systems, known as \\emph{qudits}, over the qubit analogues. When designing a quantum architecture, it is crucial to consider protocols for compilation, the optimal conversion of high-level instructions used by programmers into low-level instructions interpreted by the machine. In this work, we present a general purpose automated compiler for multiqudit exact synthesis based on previous work on qubits that uses an algebraic representation of quantum circuits called phase polynomials. We assume Clifford gates are low-cost and aim to minimise the number of M gates in a Clifford+M circuit, where M is the qudit analog for the qubit T or pi/8 phase gate. A surprising result that showcases our compiler's capabilities is that we found a unitary implementation of the CCZ or Toffoli gate that uses 4 M gates, which compares to 7 T gates for the qubit analogue.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-02-14T22:44:58.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "prime dimension greater",
      "quantum compiler",
      "magic state distillation protocols demonstrate",
      "qubit analogue",
      "d-level quantum systems"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}