Quantum Matrix-Product Codes: CSS-T Characterization and Maximality

I. INTRODUCTION

• CSS-T codes admit a transversal physical T gate and provide an algebraic framework for magic-state-free or magic-state-efficient fault-tolerant schemes.Together with the Clifford group, the T gate generates a universal gate set.Source: §I · p. 1
• Matrix-product codes construct long linear codes from shorter constituent codes and can provide control over dimension and minimum distance.The construction generalizes schemes such as the (u | u + v) construction.Source: §I · p. 1
• The Schur square of a (u | u + v) matrix-product code has constituents described using the constituent codes’ Schur squares and mixed product.This explicit control supports analysis of CSS-T conditions, which reduce to orthogonality constraints involving the Schur square.Source: §I · p. 1
• The paper gives necessary and sufficient CSS-T conditions and characterizes maximality for matrix-product-code pairs from the (u | u + v)-construction.Source: §I · pp. 1–2
• For cyclic constituent codes, CSS-T and maximality conditions become explicit combinatorial criteria on their defining cyclotomic sets.These criteria govern when cyclic matrix-product-code pairs satisfy the CSS-T condition and when they are maximal.Source: §I · p. 2

• The dimension of a linear code is its dimension as a vector space over F2, and its minimum distance is defined using codeword Hamming weights.The supplied passage identifies wt(c) as the Hamming weight of c.Source: A. Linear codes and duality · p. 2
• The dual code of a linear code is introduced as a basic associated code.Source: A. Linear codes and duality · p. 2
• A binary code is even exactly when every codeword has even Hamming weight, equivalently when it is contained in ⟨1⟩⊥.Here 1 is the all-ones vector.Source: A. Linear codes and duality · p. 2

• The Schur product of two vectors is their componentwise product, and the operation extends to codes.Source: B. Schur (componentwise) product of… · p. 2
• The square of a code C is denoted C⋆2 and defined as C ⋆ C.Source: B. Schur (componentwise) product of… · p. 2
• For binary codes, c⋆c = c for every codeword c, so C ⊆ C⋆2.Source: B. Schur (componentwise) product of… · p. 2

• The classical CSS construction produces a quantum code from a pair of linear codes.Source: C. CSS and CSS-T pairs · p. 2
• A pair of binary codes is a CSS-T pair exactly when it satisfies the stated Schur-based characterization.The supplied theorem passage does not include the condition itself.Source: C. CSS and CSS-T pairs · p. 2
• For a CSS-T pair, the supplied parameter statement relates the minimum of δ(C1) and δ(C2⊥) to δ(C2⊥).The passage also introduces the parameters of the corresponding CSS-T code, but its expression is incomplete.Source: C. CSS and CSS-T pairs · p. 2
• For a CSS-T pair, C2 is self-orthogonal, and the Schur-based characterization is the main tool for deriving matrix-product CSS-T conditions.Source: C. CSS and CSS-T pairs · p. 2

D. Matrix-product codes

• A matrix-product code is formed by multiplying vectors from constituent codes by a matrix; the paper focuses on the binary (u | u+v) case.In this case, [C1, C2]A = {(c1, c1 + c2) : c1 ∈ C1, c2 ∈ C2}.Source: D. Matrix-product codes · p. 2
• For a full-rank matrix, the code dimension is the sum of constituent-code dimensions; for nested constituents, its minimum distance follows a formula based on the first i rows of M.The supplied passage identifies d_i as the minimum distance of the code generated by the first i rows of M.Source: D. Matrix-product codes · p. 2
• The section's results translate CSS-T conditions for matrix-product codes into Schur-product conditions on their constituent codes.Source: D. Matrix-product codes · p. 2
• An example constructs a CSS-T pair by taking C1 = C2 from a matrix-product code built using D1 = ⟨(1, 1)⟩ and D2 = ⟨(0, 0)⟩.The example verifies C2 ⊆ C1 ∩ (C1⋆2)⊥.Source: D. Matrix-product codes · p. 3

III. CSS-T conditions for matrix-product codes

• For linear codes with D2 ⊆ D1, assuming C2 ⊆ C1, the pair (C1, C2) is CSS-T iff D1⋆2 ⊆ (D′2)⊥ and D1⋆D2 ⊆ (D′1)⊥.Source: §III · p. 3
• The proof applies the matrix-product Schur-square identity and uses D2 ⊆ D1 to reduce (D1 + D2)⋆D2 to D1⋆D2.Source: §III · p. 3

A. Maximality in the CSS-T poset

• The CSS-T poset orders pairs componentwise, and its subposet M consists of pairs whose two codes are matrix-product codes.Source: A. Maximality in the CSS-T poset · p. 3
• For nested constituent pairs, equality of [E1, E2]A and [E′1, E′2](A−1)T holds exactly when E1 = E′2 and E2 = E′1.Source: A. Maximality in the CSS-T poset · p. 3
• Maximality in the matrix-product subposet is characterized by four equalities between constituent-code duals and Schur products.The stated equalities are D⊥1 = D1⋆D′2 + D2⋆D′1 + D2⋆D′2, D⊥2 = D1⋆D′1, D′⊥1 = D1⋆D2, and D′⊥2 = D⋆2.Source: A. Maximality in the CSS-T poset · p. 4
• Proposition 10 gives iff conditions for extending constituent codes while retaining the CSS-T property, using Schur products and orthogonality to the relevant duals.Source: A. Maximality in the CSS-T poset · p. 4

IV. CYCLIC CODES AS CONSTITUENT CODES

• A cyclic code is represented as C(I) using a cyclotomic defining set I, invariant under multiplication by 2.The section applies this representation to characterize matrix-product codes with cyclic constituents.Source: §IV · p. 4
• For cyclic codes, sums of codes correspond to unions of defining sets, while Schur products correspond to sums of defining sets.The dual of C(I) is described as C(−J), where J is the complement of I.Source: §IV · p. 4
• Theorem 13 states a necessary-and-sufficient cyclotomic-set criterion for a pair of matrix-product codes with cyclic constituents to be CSS-T.The theorem assumes the stated inclusions among I1, I2, I′1, and I′2.Source: §IV · p. 4
• By (3), the stated condition is equivalent to I1 + I1 ⊆ −J′2, with n ∉ I1 + I2 + I′1 also specified.Source: §IV · pp. 4–5

1. Finally, using the standard relation

• Theorem 13 and Corollary 4.4 of [9] yield a CSS-T code with parameters [[30, 1, ≥3]].The example uses n = 15.Source: §1 · p. 5
• The maximality criterion for cyclic pairs is expressed through equalities and unions involving sums of defining sets and their complements.The supplied conditions include (I1 + I′2) ∪ (I2 + I′1) ∪ (I2 + I′2) = −J1 and I1 + I1 = −J′2.Source: §1 · p. 5
• The maximality test is translated into cyclotomic-set conditions using the correspondence between sums of cyclic codes and unions of defining sets.Equality of cyclic codes corresponds to equality of their defining sets.Source: §1 · p. 5

V. CONCLUSIONS AND FUTURE WORK

• The paper obtains necessary-and-sufficient CSS-T conditions and characterizes maximality for pairs of matrix-product codes from the (u | u + v)-construction.The work analyzes the CSS-T conditions for these pairs.Source: §V · p. 5
• For cyclic constituent codes, the CSS-T and maximality conditions are translated into explicit criteria on cyclotomic sets.Source: §V · p. 5
• The paper identifies extending the analysis to weighted Reed–Muller constituents and systematically studying parameters as future work.The parameter study concerns both cyclic and weighted Reed–Muller settings.Source: §V · p. 5