Curator's Take
AI Commentary
This article delivers the first explicit primitive gate set for digitally simulating the 648‑element discrete subgroup of SU(3), a key building block for non‑Abelian lattice gauge theories such as QCD, and it supplies concrete qubit and qutrit–qubit decompositions for each operation. By providing detailed fault‑tolerant resource estimates—on the order of 10¹⁰ T gates for a pure‑qubit implementation and up to 10¹² R gates for a hybrid qutrit architecture—it benchmarks how far current error‑corrected hardware must progress before realistic shear‑viscosity calculations become feasible. The work therefore bridges recent algorithmic advances in quantum gauge simulations with the practical engineering challenges of scaling up fault‑tolerant quantum processors, highlighting both a clear pathway and the substantial overhead that remains.
— Mark Eatherly
Summary
We construct a primitive gate set for the digital quantum simulation of the $648$-element discrete subgroup of $SU(3)$, $\dsb$. The five algorithmic primitives are the inversion, group multiplication, trace, group Fourier transform, and kinetic-phase gates, for which we provide qubit and qutrit--qubit decompositions. For a fiducial shear-viscosity calculation on a $10^3$ spatial lattice with $50$ time steps and a total synthesis-error budget of $10^{-8}$, the estimated fault-tolerant costs are $2.3$--$6.8\times10^{10}$ $T$ gates in the qubit architecture and $1.3$--$5.9\times10^{12}$ $R$ gates in the qutrit--qubit architecture.