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.
Below we provide an example of how to do it forN= 3 qubits, where we use the method of Young symmetrizers proposed in [67]
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.