Synthesis and Arithmetic of Single Qutrit Circuits
arXiv:2311.08696 · doi:10.22331/q-2025-02-26-1647
Abstract
In this paper we study single qutrit circuits consisting of words over the Clifford cyclotomic gate set, where , is a primitive -th root of unity and are integers. We characterize classes of qutrit unit vectors with entries in based on the possibility of reducing their smallest denominator exponent (sde) with respect to by acting an appropriate gate in Clifford. We do this by studying the notion of `derivatives mod ' of an arbitrary element of and using it to study the smallest denominator exponent of where is the qutrit Hadamard gate and . In addition, we reduce the problem of finding all unit vectors of a given sde to that of finding integral solutions of a positive definite quadratic form along with some additional constraints. As a consequence we prove that the Clifford gates naturally arise as gates with sde and in the group of unitaries with entries in . We illustrate the general applicability of these methods to obtain an exact synthesis algorithm for Clifford and recover the previous exact synthesis algorithm in \cite{kmm}. The framework developed to formulate qutrit gate synthesis for Clifford extends to qudits of arbitrary prime power.
19 pages, 1 figure, typos corrected, Accepted in Quantum
References in corpus (10)
- Molecular Spin Qudits for Quantum Algorithms
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Qudit versions of the qubit "pi-over-eight" gate
- Diagonal gates in the Clifford hierarchy
- Control and Readout of a 13-level Trapped Ion Qudit
- Efficient two-qutrit gates in superconducting circuits using parametric coupling
- Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits
- Low Overhead Qutrit Magic State Distillation
- Arithmeticity, thinness and efficiency of qutrit Clifford+T gates
- Multi-qutrit exact synthesis