Constructing all qutrit controlled Clifford+T gates in Clifford+T

Abstract

For a number of useful quantum circuits, qudit constructions have been found which reduce resource requirements compared to the best known or best possible qubit construction. However, many of the necessary qutrit gates in these constructions have never been explicitly and efficiently constructed in a fault-tolerant manner. We show how to exactly and unitarily construct any qutrit multiple-controlled Clifford+T unitary using just Clifford+T gates and without using ancillae. The T-count to do so is polynomial in the number of controls $k$, scaling as $O(k^{3.585})$. With our results we can construct ancilla-free Clifford+T implementations of multiple-controlled T gates as well as all versions of the qutrit multiple-controlled Toffoli, while the analogous results for qubits are impossible. As an application of our results, we provide a procedure to implement any ternary classical reversible function on $n$ trits as an ancilla-free qutrit unitary using $O(3^n{n}^{3.585})$ T gates.

arXiv comment14 pages

References in corpus (30)

• Elementary gates for quantum computation
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Qudits and high-dimensional quantum computing
• High-dimensional quantum communication: benefits, progress, and future challenges
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Efficient Toffoli Gates Using Qudits
• Quantum Information Scrambling in a Superconducting Qutrit Processor
• Quantum circuits of T-depth one
• On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Exact synthesis of multiqubit Clifford+T circuits
• Fault-Tolerant Quantum Computation with Higher-Dimensional Systems
• Lower bounds on the non-Clifford resources for quantum computations
• Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
• Qudit versions of the qubit "pi-over-eight" gate
• Universal Quantum Computation with Metaplectic Anyons
• Asymptotic Improvements to Quantum Circuits via Qutrits
• Implementation of a Walsh-Hadamard gate in a superconducting qutrit
• Scalable quantum computing with qudits on a graph
• Synthesis of Multivalued Quantum Logic Circuits by Elementary Gates
• Generalized Toffoli gates using qudit catalysis
• Synthesis of multi-qudit Hybrid and d-valued Quantum Logic Circuits by Decomposition
• Normal form for single-qutrit Clifford+T operators and synthesis of single-qutrit gates
• A polynomial time and space heuristic algorithm for T-count
• Canonical forms for single-qutrit Clifford+T operators
• Circuit QED: single-step realization of a multiqubit controlled phase gate with one microwave photonic qubit simultaneously controlling $n-1$ microwave photonic qubits
• Magic State Distillation with the Ternary Golay Code
• Efficient Topological Compilation for Weakly-Integral Anyon Model
• Optimal and asymptotically optimal NCT reversible circuits by the gate types