Back to News
quantum-computing

Topological subsystem bivariate bicycle codes with four-qubit check operators

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers Zijian Liang and Yu-An Chen introduced subsystem bivariate bicycle (SBB) codes, a novel quantum error-correcting framework that reduces stabilizer check weights from 6+ to 4-qubit operations, simplifying syndrome extraction. The team leveraged gauge qubits and translation-invariant CSS subsystem codes to replicate bivariate bicycle (BB) code logic while maintaining low overhead, with syndromes derived from multiplying gauge measurement outcomes. A determinantal-ideal criterion detects nonlocal stabilizers via gauge-operator commutation matrices, enabling finite-depth Clifford circuits to decouple gauge qubits and recover BB stabilizer codes when nonlocal stabilizers are absent. Topological properties are preserved: SBB codes remain topological if their corresponding BB codes are, ensuring no nontrivial local logical operators exist, enhancing fault-tolerance prospects. Notable low-overhead examples include [[27,6,3]], [[75,10,5]], and [[108,12,6]] codes, with the latter encoding six times more logical qubits than comparable subsystem surface codes at equal block length and distance.
Topological subsystem bivariate bicycle codes with four-qubit check operators

Summarize this article with:

Quantum Physics arXiv:2605.04151 (quant-ph) [Submitted on 5 May 2026] Title:Topological subsystem bivariate bicycle codes with four-qubit check operators Authors:Zijian Liang, Yu-An Chen View a PDF of the paper titled Topological subsystem bivariate bicycle codes with four-qubit check operators, by Zijian Liang and Yu-An Chen View PDF HTML (experimental) Abstract: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. Comments: Subjects: Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el); Mathematical Physics (math-ph); Quantum Algebra (math.QA) Cite as: arXiv:2605.04151 [quant-ph] (or arXiv:2605.04151v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2605.04151 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Zijian Liang [view email] [v1] Tue, 5 May 2026 18:00:05 UTC (502 KB) Full-text links: Access Paper: View a PDF of the paper titled Topological subsystem bivariate bicycle codes with four-qubit check operators, by Zijian Liang and Yu-An ChenView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-05 Change to browse by: cond-mat cond-mat.str-el math math-ph math.MP math.QA References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-hardware
quantum-error-correction

Source Information

Source: arXiv Quantum Physics