Description
A qubit CSS code for which transversal Hadamard is a logical operation. Equivalently, a qubit CSS code constructed from a Euclidean self-orthogonal code.
Specializing the CSS construction to the case when \(C_Z=[n,k]\) is dual-containing (equivalently, \(C_Z^{\perp}\) is self-orthogonal) and \(C_X=C_Z\) yields an \([[n,2k-n]]\) self-dual qubit CSS code. Its \(X\)-type and \(Z\)-type stabilizers are identically supported, and transversal Hadamard preserves the stabilizer group. Such codes are also called weakly self-dual, symmetric [1], self-orthogonal, or homogeneous [2] qubit CSS codes.
Self-dual CSS codes split into normal and hyperbolic classes depending on whether transversal Hadamard acts as logical Hadamards or as pairwise logical swaps in a suitable logical basis [3; Sec. III]. Hyperbolic codes necessarily encode an even number of logical qubits and have even blocklength and distance [3; Sec. III].
Rate
Asymptotically good self-dual CSS codes that realize the logical transversal Clifford group via transversal physical gates exist [4; Thm. 10].Magic
Normal and hyperbolic self-dual CSS codes yield magic-state distillation protocols with asymptotically constant space overhead and yield parameter \(\gamma \to 1^{+}\) [5][3; Thms. 4.1 and 4.2].Transversal and Permutation-Based Gates
Self-dual CSS codes admit a transversal Hadamard gate. There are criteria for when such codes realize logical gates from tensor products of \(S\) and \(S^{\dagger}\) gates [6].Let \(C_Z\) be a doubly even self-dual \([n,n/2,d]\) code punctured on \(t<\min\{n/2,d\}\) coordinates, so that \(C_Z^{\perp}\) is the code shortened on the same coordinates. The self-dual CSS code with \(C_X=C_Z\) encodes \(t\) logical qubits. Transversal \(S\), transversal \(H\), and transversal \(CZ\) across two blocks realize the logical transversal \(S^{\dagger}\), \(H\), and \(CZ\) gates, respectively [4; Thm. 10]. The symplectic representations of uniform transversal Clifford gates on \(\ell\) codeblocks form \(Sp(2\ell,2)\) for self-dual CSS codes [7].A self-dual weakly doubly even \([[n,1,d]]\) CSS code admits a partitioned transversal physical \(S\) gate that realizes \(\overline{S}^m\), where \(m=|M^+|-|M^-| \pmod 4\). For odd \(m\), this gate together with transversal Hadamard and CNOT yields the full logical Clifford group transversally [8][9; Lemma I.4]. Transversal single-qubit Clifford gates on an indecomposable self-dual CSS code with \(k\geq 1\) realize exactly the logical group \(S_3\) modulo logical Pauli operators, independently of \(n\), \(k\), and \(d\) [10].Among indecomposable CSS codes, only self-dual codes with \(k=1\) generate the full logical Clifford group across several blocks using single-qubit Clifford gates, qubit permutations, and transversal interblock CX gates [10; Thm. 7]. Direct sums of such single-logical-qubit codes can also generate the full group [10; Rem. 11].Fault Tolerance
Any self-dual CSS code of odd distance with stabilizer generators of weight at most six admits flag fault-tolerant syndrome extraction [11].Triorthogonal codes realizing logical \(T\) gates using only physical \(T\) gates can be paired up with self-dual CSS codes. Such a pair yields a transversal CNOT gate and universal fault-tolerant gates using Steane error correction [1].Cousins
- Dual linear code— Self-dual CSS codes arise from dual-containing (equivalently, self-orthogonal a.k.a. weakly self-dual) binary linear codes.
- Self-dual linear code— Puncturing a doubly even self-dual binary code on \(t\) coordinates, with \(t\) less than its distance and dimension, yields a dual-containing code. Its self-dual CSS code encodes \(t\) logical qubits and realizes the logical transversal Clifford group via transversal physical gates [4; Thm. 10]. Asymptotically good doubly even self-dual codes yield asymptotically good such CSS codes [4; Thm. 10].
- Qubit stabilizer code— Any \([[n,k,d]]\) qubit stabilizer code maps to a \([[4n,2k,2d]]\) self-dual CSS code under concatenated symplectic doubling [12; Corr. 2][13; Corr. 1]. Equivalently, one first concatenates each qubit with the tetron code to obtain an intermediate \([[2n,k,2d]]_{f}\) Majorana stabilizer code, and then assigns one qubit to each Majorana mode [13; Lemma 2].
- Tetron code— Any \([[n,k,d]]\) qubit stabilizer code maps to a \([[4n,2k,2d]]\) self-dual CSS code under concatenated symplectic doubling [12; Corr. 2][13; Corr. 1]. Equivalently, one first concatenates each qubit with the tetron code to obtain an intermediate \([[2n,k,2d]]_{f}\) Majorana stabilizer code, and then assigns one qubit to each Majorana mode [13; Lemma 2].
- \([[4,2,2]]\) Four-qubit code— Any \([[n,k,d]]\) qubit stabilizer code maps to a \([[4n,2k,2d]]\) self-dual CSS code under concatenated symplectic doubling [12; Corr. 2][13; Corr. 1]. Equivalently, one first concatenates each qubit with the tetron code to obtain an intermediate \([[2n,k,2d]]_{f}\) Majorana stabilizer code, and then assigns one qubit to each Majorana mode [13; Lemma 2].
- Quantum Reed-Muller (RM) code— The \([[2^m,{m \choose r}, 2^{\min(r,m-r)}]]\) quantum RM family contains a self-dual sub-family for \(m=2r\), which admits logical Clifford group gates via permutations, transversal gates, and fold-transversal gates [14,15].
- Quantum divisible code— A self-dual weakly doubly even \([[n,1,d]]\) CSS code admits a partitioned transversal physical \(S\) gate that realizes \(\overline{S}^m\), where \(m=|M^+|-|M^-| \pmod 4\). For odd \(m\), this gate together with transversal Hadamard and CNOT yields the full logical Clifford group transversally [8][9; Lemma I.4].
- Generalized quantum divisible code— Any self-dual CSS code of odd distance \(d\geq 5\) yields a level-three generalized quantum divisible code when level-lifted [16; Thm. V.6].
- Triorthogonal code— Triorthogonal codes realizing logical \(T\) gates using only physical \(T\) gates can be paired up with self-dual CSS codes. Such a pair yields a transversal CNOT gate and universal fault-tolerant gates using Steane error correction [1].
- Majorana stabilizer code— An odd-length self-dual CSS code can be converted into a complex-fermion code. The conversion replaces qubit \(Z\)-type and \(X\)-type operators with \(\gamma\)-type and \(\tilde{\gamma}\)-type Majorana operators, respectively [17].
- \([[8,2,3]]\) Hermitian code— Applying concatenated symplectic doubling to the \([[8,2,3]]\) Hermitian code yields a \([[32,4,6]]\) self-dual CSS code [12; Corr. 2].
- Bivariate bicycle (BB) code— BB codes with \(B=\overline{A}\), where the bar denotes the antipode map \(x^iy^j\mapsto x^{-i}y^{-j}\), have \(H_X=H_Z\) and are self-dual CSS codes [18]. Weight-six ones, \(A=1+x^ay^b+x^cy^d\), have \(k_{\max}=4|ad-bc|\) and reduce to \(|ad-bc|\) decoupled copies of the 6.6.6 color code [18; Thm. 1 and Exam. 2]. Weight-eight ones are doubly even, and \(A=1+x+y+y^{-1}\) yields the \([[16,4,4]]\) and \([[64,8,8]]\) codes [18; Table I].
- Color code— Color codes often have self-dual \(X\)- and \(Z\)-type bulk stabilizer structure, but boundary choices can prevent the full code from being self-dual. Thus, only color-code geometries for which transversal Hadamard is a logical operation are self-dual CSS codes.
Primary Hierarchy
References
- [1]
D. Jiao, M. Bayanifar, A. Ashikhmin, and O. Tirkkonen, “Low Overhead Universal Quantum Computation with Triorthogonal Codes”, (2025) arXiv:2510.05708
- [2]
Y.-J. Wang, Z.-Y. Xiao, Y. Zhang, X.-Y. Xiong, and S. Shi, “Construction of Multiple-Rate Quantum LDPC Codes Sharing One Scalable Stabilizer Circuit”, IEEE Transactions on Communications 71, 1071 (2023) DOI
- [3]
J. Haah, M. B. Hastings, D. Poulin, and D. Wecker, “Magic state distillation with low space overhead and optimal asymptotic input count”, Quantum 1, 31 (2017) arXiv:1703.07847 DOI
- [4]
K. S. M. Reddy and N. Kashyap, “Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly”, (2026) arXiv:2601.08568
- [5]
Quantum Information and Computation 18, (2018) arXiv:1709.02789 DOI
- [6]
T. Tansuwannont, Y. Takada, and K. Fujii, “Clifford gates with logical transversality for self-dual CSS codes”, (2025) arXiv:2503.19790
- [7]
S. Dasu and S. Burton, “A Classification of Transversal Clifford Gates for Qubit Stabilizer Codes”, (2025) arXiv:2507.10519
- [8]
S. Bravyi and A. Cross, “Doubled Color Codes”, (2015) arXiv:1509.03239
- [9]
S. P. Jain and V. V. Albert, “Transversal Clifford and T -Gate Codes of Short Length and High Distance”, IEEE Journal on Selected Areas in Information Theory 6, 127 (2025) arXiv:2408.12752 DOI
- [10]
J. M. Koh, S. Majidy, A. Chakraborty, A. Gong, S. J. S. Tan, and N. Y. Yao, “Achieving the limits of automorphism gates”, (2026) arXiv:2609.19250
- [11]
C. Chamberland and M. E. Beverland, “Flag fault-tolerant error correction with arbitrary distance codes”, Quantum 2, 53 (2018) arXiv:1708.02246 DOI
- [12]
B. W. Reichardt, D. Aasen, and R. Chao, “Fire and ice: Partially fault-tolerant quantum computing with selective state filtering”, (2026) arXiv:2605.15344
- [13]
S. Bravyi, B. M. Terhal, and B. Leemhuis, “Majorana fermion codes”, New Journal of Physics 12, 083039 (2010) arXiv:1004.3791 DOI
- [14]
A. Gong and J. M. Renes, “Computation with quantum Reed-Muller codes and their mapping onto 2D atom arrays”, (2024) arXiv:2410.23263
- [15]
T. Tansuwannont, T. Chan, and R. Takagi, “Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates”, (2026) arXiv:2602.09788
- [16]
J. Haah, “Towers of generalized divisible quantum codes”, Physical Review A 97, (2018) arXiv:1709.08658 DOI
- [17]
A. Schuckert, E. Crane, A. V. Gorshkov, M. Hafezi, and M. J. Gullans, “Fault-tolerant fermionic quantum computing”, (2025) arXiv:2411.08955
- [18]
Z. Liang and Y.-A. Chen, “Self-dual bivariate bicycle codes with transversal Clifford gates”, (2026) arXiv:2510.05211
- [19]
S. Burton, E. Durso-Sabina, and N. C. Brown, “Genons, Double Covers and Fault-tolerant Clifford Gates”, (2024) arXiv:2406.09951
- [20]
A. Holmes, “Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes”, (2026) arXiv:2606.13521
- [21]
W. Yang, C. Duckering, and A. Dua, “Designer Codes from GALA: Compact, Self-Dual, and Rate-1/2 QEC on Reconfigurable Atom Arrays”, (2026) arXiv:2608.07431
- [22]
D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-Graph Codes for Quantum Error Correction”, IEEE Transactions on Information Theory 50, 2315 (2004) arXiv:quant-ph/0304161 DOI
- [23]
J. Preskill, Lecture notes on Quantum Computation (1997–2020) URL
Page edit log
- Victor V. Albert (2026-10-26) — most recent
- Victor V. Albert (2026-09-26)
- Victor V. Albert (2026-09-20)
- Victor V. Albert (2026-09-06)
- Victor V. Albert (2026-08-25)
- Victor V. Albert (2026-06-08)
- Victor V. Albert (2026-05-18)
Cite as:
“Self-dual CSS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/self_dual_css, arXiv:2606.11484