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:2302.01527 · Quantum Information Processing

Quantum data-syndrome codes: Subsystem and impure code constructions

Andrew Nemec

Published Nov 13, 2023• 8 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-04166-z

Related papers

Some constructions of quantum subsystem codes

Guohui Wang, Yucheng Chen, Chunming Tang +1 more

Quantum Information Processing•Jan 29, 2026•0 citations

$\mathbb{F}_{q}$-Linear Qudit Data Syndrome Codes

Goli Nagamani, Pradeep Kiran Sarvepalli

Quantum codes which can correct both errors in the data as well as in the syndromes are called quantum data syndrome codes. An important framework for constructing quantum data syndrome codes is due to Ashikhmin et al. Their approach can be used to construct a quantum data syndrome code for any stabilizer code. While some constructions are known there are not many families of quantum data syndrome codes known. Furthermore, there has not been much work in the construction of qudit data syndrome codes. In this paper, we extend the framework of Ashikhmin et al. to the qudit setting focusing on$\mathbb{F}_{q}$-linear codes. Then we propose a systematic construction for CSS type data syndrome codes. We then construct a few families of data syndrome codes based on cyclic codes including the ReedSolomon codes, and BCH codes.

National Conference on Communications•Feb 26, 2026•0 citations

On subsystem codes beating the quantum Hamming or Singleton bound

Andreas Klappenecker, Pradeep Kiran Sarvepalli

Subsystem codes are a generalization of noiseless subsystems, decoherence-free subspaces and stabilizer codes. We generalize the quantum Singleton bound to q -linear subsystem codes. It follows that no subsystem code over a prime field can beat the quantum Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the quantum Hamming bound. A number of open problems concern the comparison in the performance of stabilizer and subsystem codes. One of the open problems suggested by Poulin's work asks whether a subsystem code can use fewer syndrome measurements than an optimal q -linear maximum distance separable stabilizer code while encoding the same number of qudits and having the same distance. We prove that linear subsystem codes cannot offer such an improvement under complete decoding.

arXiv:quant-ph/0703213•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Aug 21, 2007•27 citations

Quantum Code Constructions

Giuliano G. La Guardia

Quantum science and technology•Jan 1, 2020•0 citations

Topological subsystem bivariate bicycle codes with four-qubit check operators

Zijian Liang, Yu-An Chen

High-rate bivariate bicycle (BB) codes are promising low-overhead quantum memories, but their stabilizer checks typically have weight $6$ or higher, making syndrome extraction challenging. We introduce subsystem bivariate bicycle (SBB) codes, a translation-invariant CSS subsystem construction that realizes BB-code logical structure using local weight-$4$ gauge measurements. Their stabilizer syndromes are inferred by multiplying the corresponding gauge outcomes. We further show that nonlocal stabilizers in translation-invariant CSS subsystem codes can be detected using a determinantal-ideal criterion based on the gauge-operator commutation matrix. When this criterion excludes nonlocal stabilizers, a finite-depth Clifford circuit decouples gauge qubits and identifies the protected subsystem with a corresponding BB stabilizer code. An SBB code is topological, meaning that it has no nontrivial local logical operators, if and only if the corresponding BB code is topological. A finite search yields low-overhead examples including $[[27,6,3]]$, $[[75,10,5]]$, and $[[108,12,6]]$; the latter encodes six times more logical qubits than a subsystem surface code at the same block length and distance. These results show how gauge degrees of freedom can make high-rate BB logical structure compatible with local weight-$4$ syndrome extraction.

quant-pharXiv:2605.04151•May 7, 2026•3 citations

Quantum Error-Correction Codes

Mahn‐Soo Choi

Springer eBooks•Jan 1, 2022•0 citations
Fq\mathbb{F}_{q}Fq​-Linear Qudit Data Syndrome Codes
Quantum codes which can correct both errors in the data as well as in the syndromes are called quantum data syndrome codes. An important framework for constructing quantum data syndrome codes is due to Ashikhmin et al. Their approach can be used to construct a quantum data syndrome code for any stabilizer code. While some constructions are known there are not many families of quantum data syndrome codes known. Furthermore, there has not been much work in the construction of qudit data syndrome codes. In this paper, we extend the framework of Ashikhmin et al. to the qudit setting focusing onFq\mathbb{F}_{q}Fq​-linear codes. Then we propose a systematic construction for CSS type data syndrome codes. We then construct a few families of data syndrome codes based on cyclic codes including the ReedSolomon codes, and BCH codes.
Subsystem codes are a generalization of noiseless subsystems, decoherence-free subspaces and stabilizer codes. We generalize the quantum Singleton bound to q -linear subsystem codes. It follows that no subsystem code over a prime field can beat the quantum Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the quantum Hamming bound. A number of open problems concern the comparison in the performance of stabilizer and subsystem codes. One of the open problems suggested by Poulin's work asks whether a subsystem code can use fewer syndrome measurements than an optimal q -linear maximum distance separable stabilizer code while encoding the same number of qudits and having the same distance. We prove that linear subsystem codes cannot offer such an improvement under complete decoding.
High-rate bivariate bicycle (BB) codes are promising low-overhead quantum memories, but their stabilizer checks typically have weight 666 or higher, making syndrome extraction challenging. We introduce subsystem bivariate bicycle (SBB) codes, a translation-invariant CSS subsystem construction that realizes BB-code logical structure using local weight-444 gauge measurements. Their stabilizer syndromes are inferred by multiplying the corresponding gauge outcomes. We further show that nonlocal stabilizers in translation-invariant CSS subsystem codes can be detected using a determinantal-ideal criterion based on the gauge-operator commutation matrix. When this criterion excludes nonlocal stabilizers, a finite-depth Clifford circuit decouples gauge qubits and identifies the protected subsystem with a corresponding BB stabilizer code. An SBB code is topological, meaning that it has no nontrivial local logical operators, if and only if the corresponding BB code is topological. A finite search yields low-overhead examples including [[27,6,3]][[27,6,3]][[27,6,3]], [[75,10,5]][[75,10,5]][[75,10,5]], and [[108,12,6]][[108,12,6]][[108,12,6]]; the latter encodes six times more logical qubits than a subsystem surface code at the same block length and distance. These results show how gauge degrees of freedom can make high-rate BB logical structure compatible with local weight-444 syndrome extraction.