Covariant block quantum code [1]
Description
A block code on \(n\) subsystems that admits a group \(G\) of transversal gates. The group has to be finite for finite-dimensional codes due to the Eastin-Knill theorem. Continuous-\(G\) covariant codes, necessarily infinite-dimensional, are relevant to error correction of quantum reference frames [1] and error-corrected parameter estimation.
Denoting the code’s encoding map as \(U\), covariance is equivalent to \begin{align}
Almost always, the physical representation is defined to be the transversal one (with respect to some tensor-product decomposition), but can reduce to any representation when the code is a subspace of a larger space that is not expressed as a tensor product (\(n=1\)). More generally, a code is sometimes said to be time-covariant if it admits a continuous-parameter \(U(1)\) family of gates, not necessarily transversal [2].
Protection
Finite-dimensional codes correcting a single-subsystem erasure and admitting a continuous-parameter family of transversal gates (assuming \(n>1\)) cannot exist in finite dimensions due to the Eastin-Knill theorem. As a result, there is generally a tradeoff between covariance and error correction.
Exact error-correcting \(G\)-covariant codes can exist in infinite dimensions, but their codewords are non-normalizable, meaning that approximate constructions have to be considered that are only approximately error correcting. On the other hand, there exist exact error-correcting codes in finite dimensions that are approximately covariant [3,4]. Various bounds quantify the covariance-performance tradeoff [3–10]. In particular, an approximate Eastin-Knill theorem implies that an \(SU(d_{L})\)-covariant code satisfies \(\epsilon_{\mathrm{worst}}\gtrsim [2n \max_{i}\ln d_{i}]^{-1}\), so for fixed \(n\) the local subsystem dimensions must grow exponentially in \(1/\epsilon_{\mathrm{worst}}\) to support a universal transversal gate set [5; Thm. 4].
Transversal and Permutation-Based Gates
\(G\)-covariant codes defined on a tensor product space consisting of \(n\) subsystems are equivalent to codes with a transversal gate set realizing \(G\).Cousins
- Approximate quantum error-correcting code (AQECC)— Normalizable constructions of infinite-dimensional \(G\)-covariant codes for continuous \(G\) are approximately error-correcting.
- Quantum Reed-Muller (RM) code— Quantum RM codes are approximately covariant and nearly saturate certain covariance-performance bounds [3].
- Eigenstate thermalization hypothesis (ETH) code— ETH codes consisting of Dicke states are approximately \(U(1)\)-covariant and nearly saturate certain covariance-performance bounds [3,5].
- Random quantum code— Random \(U(1)\)-covariant [11] and \(U(d)\)-covariant [5,12] approximate QECCs exist.
- Group GKP code— Group-GKP codes corresponding to the \(G^{k_1} \subseteq G^{k_2} \subset G^{n}\) group construction admit \(X\)-type logical group-multiplication gates, and are thus covariant with respect to the induced \(G^{k_2}\)-action [13].
- \([[3,1,2]]_{\mathbb{Z}}\) Three-rotor code— The three-rotor code is \(U(1)\)-covariant.
- \([[5,1,3]]_{\mathbb{Z}}\) Five-rotor code— The five-rotor code is \(U(1)\)-covariant.
- Perfect-tensor code— An \(SU(2)\)-invariant three-qudit perfect tensor exists [14], but invariant perfect tensors do not exist on four parties [14–16].
- Metrological code— Any time-covariant QECC, i.e., a code admitting a continuous-parameter \(U(1)\) family of gates, is automatically a metrological code.
- Valence-bond-solid (VBS) code— Two classes of (approximate) VBS codes have \(SU(q)\) transversal gates, i.e., are \(SU(q)\)-covariant [17; Tab. III].
Primary Hierarchy
References
- [1]
P. Hayden, S. Nezami, S. Popescu, and G. Salton, “Error Correction of Quantum Reference Frame Information”, PRX Quantum 2, (2021) arXiv:1709.04471 DOI
- [2]
P. Faist, M. P. Woods, V. V. Albert, J. M. Renes, J. Eisert, and J. Preskill, “Time-Energy Uncertainty Relation for Noisy Quantum Metrology”, PRX Quantum 4, (2023) arXiv:2207.13707 DOI
- [3]
Z.-W. Liu and S. Zhou, “Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies”, (2023) arXiv:2111.06360
- [4]
Z.-W. Liu and S. Zhou, “Approximate symmetries and quantum error correction”, npj Quantum Information 9, (2023) arXiv:2111.06355 DOI
- [5]
P. Faist, S. Nezami, V. V. Albert, G. Salton, F. Pastawski, P. Hayden, and J. Preskill, “Continuous Symmetries and Approximate Quantum Error Correction”, Physical Review X 10, (2020) arXiv:1902.07714 DOI
- [6]
S. Zhou, Z.-W. Liu, and L. Jiang, “New perspectives on covariant quantum error correction”, Quantum 5, 521 (2021) arXiv:2005.11918 DOI
- [7]
A. Kubica and R. Demkowicz-Dobrzański, “Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem”, Physical Review Letters 126, (2021) arXiv:2004.11893 DOI
- [8]
P. Gupta, A. Morello, and B. C. Sanders, “Universal transversal gates”, (2024) arXiv:2410.07045
- [9]
R. Alexander, “A new approximate Eastin-Knill theorem”, (2025) arXiv:2505.00427
- [10]
J. Yi, R. Liu, and Z. Li, “Lovász Meets Lieb-Schultz-Mattis: Complexity in Approximate Quantum Error Correction”, (2025) arXiv:2510.04453
- [11]
L. Kong and Z.-W. Liu, “Charge-conserving unitaries typically generate optimal covariant quantum error-correcting codes”, (2021) arXiv:2102.11835
- [12]
L. Kong and Z.-W. Liu, “Near-Optimal Covariant Quantum Error-Correcting Codes from Random Unitaries with Symmetries”, PRX Quantum 3, (2022) arXiv:2112.01498 DOI
- [13]
V. V. Albert, J. P. Covey, and J. Preskill, “Robust Encoding of a Qubit in a Molecule”, Physical Review X 10, (2020) arXiv:1911.00099 DOI
- [14]
Y. Li, M. Han, M. Grassl, and B. Zeng, “Invariant perfect tensors”, New Journal of Physics 19, 063029 (2017) arXiv:1612.04504 DOI
- [15]
A. Higuchi and A. Sudbery, “How entangled can two couples get?”, Physics Letters A 273, 213 (2000) arXiv:quant-ph/0005013 DOI
- [16]
R. Mansuroglu and H. Sahlmann, “No invariant perfect qubit codes”, Journal of High Energy Physics 2023, (2023) arXiv:2210.02483 DOI
- [17]
D.-S. Wang, Y.-J. Wang, N. Cao, B. Zeng, and R. Laflamme, “Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes”, New Journal of Physics 24, 023019 (2022) arXiv:2105.14777 DOI
Page edit log
- Victor V. Albert (2026-06-08) — most recent
- Victor V. Albert (2022-07-30)
- Jack Davis (2022-04-02)
Cite as:
“Covariant block quantum code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/covariant, arXiv:2606.11484