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

arXiv:0802.4270

Propagation Rules of Subsystem Codes

Salah A. Aly

Published Feb 28, 2008• 1 citation
arXivHTMLPDF

Abstract

We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an $[[n,k,r,d]]_q$ subsystem code, we drive new subsystem codes with parameters $[[n+1,k,r,\geq d]]_q$, $[[n-1,k+1,r,\geq d-1]]_q$, $[[n,k-1,r+1,d]]_q$. The interested readers shall consult our companion papers for upper and lower bounds on subsystem codes parameters, and introduction, trading dimensions, families, and references on subsystem codes [1][2][3] and references therein.

DOI
10.48550/arxiv.0802.4270

Related papers

CONSTRUCTIONS OF OPTIMAL SUBSYSTEM CODES

Jianfa Qian, Lina Zhang

New families of subsystem codes are constructed. Furthermore, these new families of subsystem codes are optimal. Finally, new families of asymmetric subsystem codes which derived from cyclic codes are presented.

Modern Physics Letters B•Sep 11, 2012•12 citations

Subsystem Codes

Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli

We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the question whether or not there exist [[n,n-2d+2,r>0,d]]q subsystem codes. Finally, we compare stabilizer and subsystem codes with respect to the required number of syndrome qudits.

arXiv:quant-ph/0610153•Oct 18, 2006•42 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 drived from negacyclic codes

Jian‐Zhang Chen, Jianping Li, Jie Lin +1 more

In this paper, we utilize negacyclic codes to construct a family of optimal subsystem codes with parameters [[q2+1,(q-1)2, 4, q-1]]q> where q = 1(mod4), q = pτ, τ ≥ 1 and p is an odd prime. These constructed quantum subsystem codes are different from those codes available in the literature.

International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)•Dec 1, 2014•2 citations

New quantum codes from CSS codes

Markus Grassl

Abstract We present a new propagation rule for CSS codes. Starting with a CSS code $$[\![n,k,d]\!]_q$$ [ [ n , k , d ] ] q , we construct a CSS code with parameters $$[\![n-2,k,d-1]\!]_q$$ [ [ n - 2 , k , d - 1 ] ] q . In general, one would only obtain a code with parameters $$[\![n-2,k,d-2]\!]_q$$ [ [ n - 2 , k , d - 2 ] ] q . The construction applies to asymmetric quantum codes from the CSS construction as well.

arXiv:2208.05353•Quantum Information Processing•Jan 23, 2023•18 citations

Three New Classes of Subsystem Codes

Li Hui, Xiusheng Liu, Peng Hu

In this paper, we construct three classes of Clifford subsystem maximum distance separable (MDS) codes based on Reed-Solomon codes and extended generalized Reed-Solomon codes over finite fields [see formula in PDF] for specific code lengths. Moreover, our Clifford subsystem MDS codes are new because their parameters differ from the previously known ones.

Wuhan University Journal of Natural Sciences•Feb 1, 2024•0 citations
We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an [[n,k,r,d]]q[[n,k,r,d]]_q[[n,k,r,d]]q​ subsystem code, we drive new subsystem codes with parameters [[n+1,k,r,≥d]]q[[n+1,k,r,\geq d]]_q[[n+1,k,r,≥d]]q​, [[n−1,k+1,r,≥d−1]]q[[n-1,k+1,r,\geq d-1]]_q[[n−1,k+1,r,≥d−1]]q​, [[n,k−1,r+1,d]]q[[n,k-1,r+1,d]]_q[[n,k−1,r+1,d]]q​. The interested readers shall consult our companion papers for upper and lower bounds on subsystem codes parameters, and introduction, trading dimensions, families, and references on subsystem codes [1][2][3] and references therein.
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the question whether or not there exist [[n,n-2d+2,r>0,d]]q subsystem codes. Finally, we compare stabilizer and subsystem codes with respect to the required number of syndrome qudits.
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.
Abstract We present a new propagation rule for CSS codes. Starting with a CSS code [ ⁣[n,k,d] ⁣]q[\![n,k,d]\!]_q[[n,k,d]]q​ [ [ n , k , d ] ] q , we construct a CSS code with parameters [ ⁣[n−2,k,d−1] ⁣]q[\![n-2,k,d-1]\!]_q[[n−2,k,d−1]]q​ [ [ n - 2 , k , d - 1 ] ] q . In general, one would only obtain a code with parameters [ ⁣[n−2,k,d−2] ⁣]q[\![n-2,k,d-2]\!]_q[[n−2,k,d−2]]q​ [ [ n - 2 , k , d - 2 ] ] q . The construction applies to asymmetric quantum codes from the CSS construction as well.