Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

New subsystem codes from matrix-product codes

Jie Liu, Peng Hu, Xiusheng Liu

Published Jan 12, 2026• 0 citations
Publisher
DOI
10.1007/s11128-025-05046-4

Related papers

New optimal subsystem codes

Jianfa Qian, Lina Zhang

Discrete Mathematics•Jul 29, 2013•21 citations

New constructions of optimal subsystem codes

Guohui Wang, Chunming Tang

Computational and Applied Mathematics•Oct 12, 2022•0 citations

New quantum codes from evaluation and matrix-product codes

Carlos Galindo, Fernando Hernando, Diego Ruano

arXiv:1406.0650•Finite Fields and Their Applications•Aug 4, 2015•46 citations

New stabilizer codes from the construction of dual-containing matrix-product codes

Meng Cao, Jianlian Cui

Finite Fields and Their Applications•Jan 23, 2020•13 citations

GNarsil: Splitting Stabilizers into Gauges

Oskar Novak, Narayanan Rengaswamy

Quantum subsystem codes have been shown to improve error-correction performance, ease the implementation of logical operations on codes, and make stabilizer measurements easier by decomposing stabilizers into smaller-weight gauge operators. In this paper, we present two algorithms that produce new subsystem codes from a “seed” CSS code. They replace some stabilizers of a given CSS code with smaller-weight gauge operators that split the remaining stabilizers, while being compatible with the logical Pauli operators of the code. The algorithms recover the well-known Bacon-Shor code computationally as well as produce a new [9, 1, 2, 2] rotated surface subsystem code with weight-3 gauges and weight-4 stabilizers. We illustrate using a [100, 25, 3] subsystem hypergraph product (SHP) code that the algorithms can produce more efficient gauge operators than the closed-form expressions of the SHP construction. However, we observe that the stabilizers of the lifted product quantum LDPC codes are more challenging to split into small-weight gauge operators. Hence, we introduce the subsystem lifted product (SLP) code construction and develop a new [775, 124, 20] code from Tanner's classical quasi-cyclic LDPC code. The code has high-weight stabilizers but all gauge operators that split stabilizers have weight 5, except one. In contrast, the LP stabilizer code from Tanner's code has parameters [1054, 124, 20]. This serves as a novel example of new subsystem codes that outperform stabilizer versions of them. Finally, based on our experiments, we share some general insights about non-locality's effects on the performance of splitting stabilizers into small-weight gauges.

arXiv:2404.18302•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations

Subsystem code constructions

Salah A. Aly, Andreas Klappenecker

Subsystem codes are the most versatile class of quantum error-correcting codes known to date that combine the best features of all known passive and active error-control schemes. The subsystem code is a subspace of the quantum state space that is decomposed into a tensor product of two vector spaces: the subsystem and the co-subsystem. A generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. The existence of numerous families of MDS subsystem codes is established. Propagation rules are derived that allow one to obtain longer and shorter subsystem codes from given subsystem codes. Furthermore, propagation rules are derived that allow one to construct a new subsystem code by combining two given subsystem codes.

arXiv:0712.4321•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•27 citations
Quantum subsystem codes have been shown to improve error-correction performance, ease the implementation of logical operations on codes, and make stabilizer measurements easier by decomposing stabilizers into smaller-weight gauge operators. In this paper, we present two algorithms that produce new subsystem codes from a “seed” CSS code. They replace some stabilizers of a given CSS code with smaller-weight gauge operators that split the remaining stabilizers, while being compatible with the logical Pauli operators of the code. The algorithms recover the well-known Bacon-Shor code computationally as well as produce a new [9, 1, 2, 2] rotated surface subsystem code with weight-3 gauges and weight-4 stabilizers. We illustrate using a [100, 25, 3] subsystem hypergraph product (SHP) code that the algorithms can produce more efficient gauge operators than the closed-form expressions of the SHP construction. However, we observe that the stabilizers of the lifted product quantum LDPC codes are more challenging to split into small-weight gauge operators. Hence, we introduce the subsystem lifted product (SLP) code construction and develop a new [775, 124, 20] code from Tanner's classical quasi-cyclic LDPC code. The code has high-weight stabilizers but all gauge operators that split stabilizers have weight 5, except one. In contrast, the LP stabilizer code from Tanner's code has parameters [1054, 124, 20]. This serves as a novel example of new subsystem codes that outperform stabilizer versions of them. Finally, based on our experiments, we share some general insights about non-locality's effects on the performance of splitting stabilizers into small-weight gauges.
Subsystem codes are the most versatile class of quantum error-correcting codes known to date that combine the best features of all known passive and active error-control schemes. The subsystem code is a subspace of the quantum state space that is decomposed into a tensor product of two vector spaces: the subsystem and the co-subsystem. A generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. The existence of numerous families of MDS subsystem codes is established. Propagation rules are derived that allow one to obtain longer and shorter subsystem codes from given subsystem codes. Furthermore, propagation rules are derived that allow one to construct a new subsystem code by combining two given subsystem codes.