Synthesis of Single Qutrit Circuits from Clifford+R

Abstract

We present two deterministic algorithms to approximate single-qutrit gates. These algorithms utilize the Clifford + $\mathbf{R}$ group to find the best approximation of diagonal rotations. The first algorithm exhaustively searches over the group; while the second algorithm searches only for Householder reflections. The exhaustive search algorithm yields an average $\mathbf{R}$ count of $2.193(11)+8.621(7){\log }_{10}(1/\epsilon )$, albeit with a time complexity of $\mathcal{O}({\epsilon }^{-4.4})$. The Householder search algorithm results in a larger average $\mathbf{R}$ count of $3.20(13)+10.77(3){\log }_{10}(1/\epsilon )$ at a reduced time complexity of $\mathcal{O}({\epsilon }^{-0.42})$, greatly extending the reach in $\epsilon$. These costs correspond asymptotically to 35% and 69% more non-Clifford gates compared to synthesizing the same unitary with two qubits. Such initial results are encouraging for using the $\mathbf{R}$ gate as the non-transversal gate for qutrit-based computation.

12 pages, 2 figures

References in corpus (38)

• Restrictions on Transversal Encoded Quantum Gate Sets
• A universal qudit quantum processor with trapped ions
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Hardware efficient quantum simulation of non-abelian gauge theories with qudits on Rydberg platforms
• Efficient synthesis of universal Repeat-Until-Success circuits
• High-Fidelity Qutrit Entangling Gates for Superconducting Circuits
• Qudit versions of the qubit "pi-over-eight" gate
• Universal qudit gate synthesis for transmons
• Experimental Realization of Two Qutrits Gate with Tunable Coupling in Superconducting Circuits
• Fermion-qudit quantum processors for simulating lattice gauge theories with matter
• Exponential quantum speedup in simulating coupled classical oscillators
• Proof-of-concept Quantum Simulator based on Molecular Spin Qudits
• Efficient realization of quantum algorithms with qudits
• Variational quantum simulation of U(1) lattice gauge theories with qudit systems
• Systematic study of High $E_J/E_C$ transmon qudits up to $d=12$
• Digital quantum simulation of a (1+1)D SU(2) lattice gauge theory with ion qudits
• A Family of Quantum Codes with Exotic Transversal Gates
• Emulating two qubits with a four-level transmon qudit for variational quantum algorithms
• Qu8its for Quantum Simulations of Lattice Quantum Chromodynamics
• Primitive Quantum Gates for an SU(3) Discrete Subgroup: $\Sigma (36\times 3)$
• Noisy Qudit vs Multiple Qubits : Conditions on Gate Efficiency for Enhancing Fidelity
• Exploring Ququart Computation on a Transmon using Optimal Control
• Generalized Toffoli gate decomposition using ququints: Towards realizing Grover's algorithm with qudits
• Simulating neutrino oscillations on a superconducting qutrit
• Qutrit Toric Code and Parafermions in Trapped Ions
• Multi-frequency control and measurement of a spin-7/2 system encoded in a transmon qudit
• Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation
• Scalable improvement of the generalized Toffoli gate realization using trapped-ion-based qutrits
• Quantum Codes from Twisted Unitary $t$-groups
• Near-optimal quantum circuit construction via Cartan decomposition
• Simulating Vibrational Dynamics on Bosonic Quantum Devices
• Collective Neutrino Oscillations in Three Flavors on Qubit and Qutrit Processors
• Realization of a fast triple-magic all-optical qutrit in strontium-88
• Randomised benchmarking for universal qudit gates
• Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits
• High-dimensional counterdiabatic quantum computing
• Synthesis and Arithmetic of Single Qutrit Circuits
• Unified Architecture for Quantum Lookup Tables