Primitive Quantum Gates for an $SU(3)$ Discrete Subgroup: $Σ(72\times3)$
- URL: http://arxiv.org/abs/2511.17437v1
- Date: Fri, 21 Nov 2025 17:35:23 GMT
- Title: Primitive Quantum Gates for an $SU(3)$ Discrete Subgroup: $Σ(72\times3)$
- Authors: Sebastian Osorio Perez, Edison M. Murairi, Erik J. Gustafson, Henry Lamm,
- Abstract summary: We construct a primitive gate set for the digital quantum simulation of a subgroup of 216-element $(72times3)$.<n>The resulting fault-tolerant T gate costs for a fiducial calculation of shear viscosity would require about $1012$ T gates.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Prefix Sums via Kronecker Products [47.600794349481966]
We show how to design quantum adders with $1.893log(n)+O(1)$ Toffoli depth, $O(n)$ Toffoli gates, and $O(n)$ additional qubits.<n>As an application, we show how to use these circuits to design quantum adders with $1.893log(n)+O(1)$ Toffoli depth, $O(n)$ Toffoli gates, and $O(n)$ additional qubits.
arXiv Detail & Related papers (2025-12-18T08:49:18Z) - Domain walls from SPT-sewing [43.87233488320917]
We propose a correspondence between 1d SPT phases with a non-invertible $Gtimes textRep(G)times G$ symmetry and invertible domain walls in the quantum double associated with the group $G$.
We also use our method to construct emphanchoring domain walls, which are novel exotic domain walls in the 3d toric code that transform point-like excitations to semi-loop-like excitations anchored on these domain walls.
arXiv Detail & Related papers (2024-11-18T19:00:16Z) - Block Encodings of Discrete Subgroups on Quantum Computer [23.493000556496376]
We introduce a block encoding method for mapping discrete subgroups to qubits on a quantum computer.
We detail the construction of primitive gates -- the inversion gate, the group multiplication gate, the trace gate, and the group Fourier gate.
The inversion gates for $mathbbBT$ and $mathbbBI$ are benchmarked on the $textttwang$ quantum computer with estimated fidelities of $40+5_-4%$ and $4+5_-3%$ respectively.
arXiv Detail & Related papers (2024-05-21T16:00:04Z) - Primitive Quantum Gates for an SU(3) Discrete Subgroup: $Σ(36\times3)$ [1.1545092788508224]
We construct the primitive gate set for the digital quantum simulation of the 108-element $Sigma(36times3)$ group.
This is the first time a nonabelian crystal-like subgroup of $SU(3)$ has been constructed for quantum simulation.
arXiv Detail & Related papers (2024-04-30T15:08:59Z) - Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure.
The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
arXiv Detail & Related papers (2024-04-25T17:08:34Z) - Primitive Quantum Gates for an $SU(2)$ Discrete Subgroup: Binary
Octahedral [0.0]
We construct a primitive gate set for the digital quantum simulation of the 48-element binary octahedral ($mathbbBO$) group.
This nonabelian discrete group better approximates $SU(2)$ lattice gauge theory than previous work on the binary tetrahedral group.
arXiv Detail & Related papers (2023-12-16T01:46:01Z) - Quantum control landscape for generation of $H$ and $T$ gates in an open
qubit with both coherent and environmental drive [57.70351255180495]
An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$)
Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
arXiv Detail & Related papers (2023-09-05T09:05:27Z) - Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates.
We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
arXiv Detail & Related papers (2023-08-16T17:54:56Z) - Primitive Quantum Gates for an SU(2) Discrete Subgroup: BT [0.0]
We construct a primitive gate set for the digital quantum simulation of the binary tetrahedral ($mathbbBT$) group on two quantum architectures.
This nonabelian discrete group serves as a crude approximation to $SU(2)$ lattice gauge theory while requiring five qubits or one quicosotetrit per gauge link.
We experimentally benchmark the inversion and trace gates on ibm nairobi, with estimated fidelities between $14-55%$, depending on the input state.
arXiv Detail & Related papers (2022-08-25T19:13:43Z) - Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system.
The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z) - Primitive Quantum Gates for Dihedral Gauge Theories [0.0]
We describe the simulation of dihedral gauge theories on digital quantum computers.
The nonabelian discrete gauge group $D_N$ serves as an approximation to $U(1)timesbbZ$ lattice gauge theory.
arXiv Detail & Related papers (2021-08-30T15:16:47Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Quantum double aspects of surface code models [77.34726150561087]
We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry.
We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
arXiv Detail & Related papers (2021-06-25T17:03:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.