Multi-qutrit exact synthesis
Amolak Ratan Kalra, Manimugdha Saikia, Dinesh Valluri, Sam Winnick,, Jon Yard

TL;DR
This paper introduces an exact synthesis algorithm for multi-qutrit unitaries over specific algebraic rings using Clifford+T gates with minimal ancillas, extending previous results and providing new conversion techniques.
Contribution
It develops an exact synthesis algorithm for multi-qutrit unitaries over specialized rings with minimal ancillas, and introduces conversion and catalytic embedding methods.
Findings
Successfully synthesizes multi-qutrit unitaries with at most two ancillas.
Extends known results to larger algebraic rings for exact synthesis.
Provides algorithms for converting 3-level unitaries into multiply-controlled gates.
Abstract
We present an exact synthesis algorithm for qutrit unitaries in over the Clifford gate set with at most one ancilla. This extends the already known result of qutrit metaplectic gates being a subset of Clifford gate set with one ancilla. As an intermediary step, we construct an algorithm to convert 3-level unitaries into multiply-controlled gates, analogous to Gray codes converting 2-level unitaries into multiply-controlled gates. Finally, using catalytic embeddings, we present an algorithm to exactly synthesize unitaries over the Clifford gate set with at most 2 ancillas. This, in particular, gives an exact synthesis algorithm of single-qutrit Clifford over the multi-qutrit Clifford gate set with at most two ancillas.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
