Explicit SU(d)-covariant approximate quantum codes using permutation symmetry achieve Θ(1/N) worst-case error scaling for up to three-qudit erasures and extend to protected analog quantum simulation.
IfH ∼=L α∈IH (Vα ⊗M α), where IH is the set of irreducible representations ofGpresent inH, then u(H)G ∼= M α∈IH u (Mα),su(H) G ∼= M α∈IH su(M α) ! ⊕u(1) ⊕(|IH|−1)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Covariant Approximate Quantum Codes for Protected Analog Computation
Explicit SU(d)-covariant approximate quantum codes using permutation symmetry achieve Θ(1/N) worst-case error scaling for up to three-qudit erasures and extend to protected analog quantum simulation.