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

Modern Physics Letters B

CONSTRUCTIONS OF OPTIMAL SUBSYSTEM CODES

Jianfa Qian, Lina Zhang

Published Sep 11, 2012• 12 citations
Publisher

Abstract

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.
DOI
10.1142/s0217984912501734

Related papers

Constructions of new families of nonbinary asymmetric quantum BCH codes and subsystem BCH codes

Leng Riguang, Zhi Ma

Science China Physics Mechanics and Astronomy•Feb 13, 2012•20 citations

Some constructions of optimal subsystem codes derived from GRS codes

Guohui Wang, Chunming Tang

Quantum Information Processing•Aug 12, 2022•9 citations

New constructions of optimal subsystem codes

Guohui Wang, Chunming Tang

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

Propagation Rules of Subsystem Codes

Salah A. Aly

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.

arXiv:0802.4270•Feb 28, 2008•1 citation

CONSTRUCTIONS OF SUBSYSTEM CODES OVER FINITE FIELDS

Salah A. Aly, Andreas Klappenecker

Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. They generalize all major quantum error protection schemes, and therefore are especially versatile. This paper introduces numerous constructions of subsystem codes. It is shown how one can derive subsystem codes from classical cyclic codes. Methods to trade the dimensions of subsystem and co-subsystem are introduced that maintain or improve the minimum distance. As a consequence, many optimal subsystem codes are obtained. Furthermore, it is shown how given subsystem codes can be extended, shortened, or combined to yield new subsystem codes. These subsystem code constructions are used to derive tables of upper and lower bounds on the subsystem code parameters.

arXiv:0811.1570•International Journal of Quantum Information•Aug 1, 2009•17 citations

Nonbinary quantum cyclic and subsystem codes over asymmetrically-decohered quantum channels

Salah A. Aly, Alexei Ashikhmin

Quantum computers theoretically are able to solve certain problems more quickly than any deterministic or probabilistic computers. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, one has to mitigate the resulting noise and decoherence effects to avoid computational errors in order to successfully build quantum computers. In this paper, we construct asymmetric quantum codes to protect quantum information over asymmetric quantum channels, Pr Z ≥ Pr X. Two generic methods are presented to derive asymmetric quantum cyclic codes using the generator polynomials and defining sets of classical cyclic codes. Consequently, the methods allow us to construct several families of quantum BCH, RS, and RM codes over asymmetric quantum channels. Finally, the methods are used to construct families of asymmetric subsystem codes.

arXiv:1002.2966•IEEE Information Theory Workshop (ITW)•Jan 1, 2010•19 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.
Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. They generalize all major quantum error protection schemes, and therefore are especially versatile. This paper introduces numerous constructions of subsystem codes. It is shown how one can derive subsystem codes from classical cyclic codes. Methods to trade the dimensions of subsystem and co-subsystem are introduced that maintain or improve the minimum distance. As a consequence, many optimal subsystem codes are obtained. Furthermore, it is shown how given subsystem codes can be extended, shortened, or combined to yield new subsystem codes. These subsystem code constructions are used to derive tables of upper and lower bounds on the subsystem code parameters.
Quantum computers theoretically are able to solve certain problems more quickly than any deterministic or probabilistic computers. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, one has to mitigate the resulting noise and decoherence effects to avoid computational errors in order to successfully build quantum computers. In this paper, we construct asymmetric quantum codes to protect quantum information over asymmetric quantum channels, Pr Z ≥ Pr X. Two generic methods are presented to derive asymmetric quantum cyclic codes using the generator polynomials and defining sets of classical cyclic codes. Consequently, the methods allow us to construct several families of quantum BCH, RS, and RM codes over asymmetric quantum channels. Finally, the methods are used to construct families of asymmetric subsystem codes.