Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A quantum compiler for qudits of prime dimension greater than 3 (1902.05634v1)

Published 14 Feb 2019 in 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.

Summary

We haven't generated a summary for this paper yet.