Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits
| Authors |
|
|---|---|
| Publication date | 12-08-2024 |
| Journal | Electronic Proceedings in Theoretical Computer Science |
| Event | 21st International Conference on Quantum Physics and Logic, QPL 2024 |
| Volume | Issue number | 406 |
| Pages (from-to) | 44-62 |
| Organisations |
|
| Abstract |
It is known that the matrices that can be exactly represented by a multiqubit circuit over the Toffoli+Hadamard, Clifford+T, or, more generally, Clifford-cyclotomic gate set are precisely the unitary matrices with entries in the ring Z[1/2,ζk], where k is a positive integer that depends on the gate set and ζk is a primitive 2k-th root of unity. In the present paper, we establish an analogous correspondence for qutrits. We define the multiqutrit Clifford-cyclotomic gate set of degree 3k by extending the classical qutrit gates X, CX, and CCX with the Hadamard gate H and the Tk gate Tk = diag(1,ωk,ωk2), where ωk is a primitive 3k-th root of unity. This gate set is equivalent to the qutrit Toffoli+Hadamard gate set when k = 1, and to the qutrit Clifford+Tk gate set when k > 1. We then prove that a 3n ×3n unitary matrix U can be represented by an n-qutrit circuit over the Clifford-cyclotomic gate set of degree 3k if and only if the entries of U lie in the ring Z[1/3,ωk]. |
| Document type | Article |
| Note | In: Proceedings of the 21st International Conference on Quantum Physics and Logic Buenos Aires, Argentina, July 15-19, 2024. Edited by: Alejandro Díaz-Caro and Vladimir Zamdzhiev. |
| Language | English |
| Published at | https://doi.org/10.4204/EPTCS.406.2 |
| Published at | https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?QPL2024.2 |
| Other links | https://cgi.cse.unsw.edu.au/~eptcs/content.cgi?QPL2024 https://www.scopus.com/pages/publications/85202062113 |
| Downloads |
Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits
(Final published version)
|
| Permalink to this page | |
