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

Bulletin of the American Physical Society

Good quantum subsystem codes in 2-dimensions

Theodore J. Yoder

Published Mar 7, 2019• 0 citations
OpenAlex

Related papers

Some constructions of quantum subsystem codes

Guohui Wang, Yucheng Chen, Chunming Tang +1 more

Quantum Information Processing•Jan 29, 2026•0 citations

Optimal quantum subsystem codes in two dimensions

Theodore J. Yoder

Given any two classical codes with parameters $[{n}_{1},k,{d}_{1}]$ and $[{n}_{2},k,{d}_{2}]$, we show how to construct a quantum subsystem code in two dimensions with parameters $[[N,K,D]]$ satisfying $N\ensuremath{\le}2{n}_{1}{n}_{2}, K=k$, and $D=min({d}_{1},{d}_{2})$. These quantum codes are in the class of generalized Bacon-Shor codes introduced by Bravyi [Phys. Rev. A 83, 012320 (2011)]. We note that constructions of good classical codes can be used to construct quantum codes that saturate Bravyi's bound $KD=O(N)$ on the code parameters of two-dimensional subsystem codes. One of these good constructions uses classical expander codes. This construction has the additional advantage of a linear time quantum decoder based on the classical Sipser-Spielman flip decoder. Finally, while the subsystem codes we create do not have asymptotic thresholds, we show how they can be gauge fixed to certain hypergraph product codes that do.

arXiv:1901.06319•Physical Review A•May 22, 2019•14 citations

Clifford subsystem codes

Andreas Klappenecker

Subsystem codes are a generalization of decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. The known constructions of subsystem codes from classical codes are limited to quantum systems that all have the same dimension, and this dimension must be a power of a prime. It is shown that one can remove these restrictions and obtain subsystem codes in quantum systems of arbitrary finite dimension from classical codes that are subgroups of an abelian group. The constructions are derived from Clifford codes over abstract error groups with abelian index groups.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•0 citations

Constructing quantum codes

Hao Chen

Frontiers of Computer Science in China•Jun 1, 2008•0 citations

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

QUANTUM CODES WITH IMPROVED MINIMUM DISTANCE

Emre Kolotoğlu, Mustafa Sarı

Bulletin of the Korean Mathematical Society•Jan 1, 2019•0 citations
Given any two classical codes with parameters [n1,k,d1][{n}_{1},k,{d}_{1}][n1​,k,d1​] and [n2,k,d2][{n}_{2},k,{d}_{2}][n2​,k,d2​], we show how to construct a quantum subsystem code in two dimensions with parameters [[N,K,D]][[N,K,D]][[N,K,D]] satisfying $N\ensuremath{\le}2{n}_{1}{n}_{2}, K=k$, and D=min(d1,d2)D=min({d}_{1},{d}_{2})D=min(d1​,d2​). These quantum codes are in the class of generalized Bacon-Shor codes introduced by Bravyi [Phys. Rev. A 83, 012320 (2011)]. We note that constructions of good classical codes can be used to construct quantum codes that saturate Bravyi's bound KD=O(N)KD=O(N)KD=O(N) on the code parameters of two-dimensional subsystem codes. One of these good constructions uses classical expander codes. This construction has the additional advantage of a linear time quantum decoder based on the classical Sipser-Spielman flip decoder. Finally, while the subsystem codes we create do not have asymptotic thresholds, we show how they can be gauge fixed to certain hypergraph product codes that do.
Subsystem codes are a generalization of decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. The known constructions of subsystem codes from classical codes are limited to quantum systems that all have the same dimension, and this dimension must be a power of a prime. It is shown that one can remove these restrictions and obtain subsystem codes in quantum systems of arbitrary finite dimension from classical codes that are subgroups of an abelian group. The constructions are derived from Clifford codes over abstract error groups with abelian index groups.
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.