arXiv subjects

Sebastian Osorio Perez

Publications and source records attributed to Sebastian Osorio Perez.

3 recordsLinked to original sources

arXiv2026

Primitive Quantum Gates for an $SU(3)$ Discrete Subgroup: $Σ(216\times3)$

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.

hep-lat↗

arXiv2025

Primitive Quantum Gates for an $SU(3)$ Discrete Subgroup: $Σ(72\times3)$

We construct a primitive gate set for the digital quantum simulation of a discrete subgroup of $SU(3)$: the 216-element $Σ(72\times3)$. The necessary primitives are the inversion gate, the group multiplication gate, the trace gate, and the group Fourier transform, for which we provide qubit decompositions. The resulting fault-tolerant T gate costs for a fiducial calculation of shear viscosity would require about $10^{12}$ T gates which compares favorably to other modern estimates.

hep-lat↗

arXiv2024

Primitive Quantum Gates for an SU(3) Discrete Subgroup: $Σ(36\times3)$

We construct the primitive gate set for the digital quantum simulation of the 108-element $Σ(36\times3)$ group. This is the first time a nonabelian crystal-like subgroup of $SU(3)$ has been constructed for quantum simulation. The gauge link registers and necessary primitives -- the inversion gate, the group multiplication gate, the trace gate, and the $Σ(36\times3)$ Fourier transform -- are presented for both an eight-qubit encoding and a heterogeneous three-qutrit plus two-qubit register. For the latter, a specialized compiler was developed for decomposing arbitrary unitaries onto this architecture.

hep-lat↗