Back to News
quantum-computing

Spatial overhead reduction for 2D hypergraph product codes

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers Aarav Pabla, Yu-Xin Wang, and Yifan Hong propose a method to reduce physical qubit requirements in 2D hypergraph product codes while preserving fault-tolerant properties like code dimension and minimum distance. Their technique achieves significant qubit savings, demonstrated by examples like shrinking a [610,64,6] code to [441,64,6] and a [1225,49,11] code to [931,49,11], cutting spatial overhead by up to 28%. Memory simulations under depolarizing noise show reduced codes maintain subthreshold performance comparable to unreduced versions, offering practical efficiency gains without sacrificing error correction capability. The approach preserves key operational features, including distance-maintaining syndrome measurement schedules and compatibility with homomorphic measurement gadgets, fold-transversal gates, and automorphisms. This work extends qubit savings beyond memory to logical computation, potentially accelerating fault-tolerant quantum computing by lowering hardware demands without compromising functionality.
Spatial overhead reduction for 2D hypergraph product codes

Summarize this article with:

Quantum Physics arXiv:2605.11318 (quant-ph) [Submitted on 11 May 2026] Title:Spatial overhead reduction for 2D hypergraph product codes Authors:Aarav Pabla, Yu-Xin Wang, Yifan Hong View a PDF of the paper titled Spatial overhead reduction for 2D hypergraph product codes, by Aarav Pabla and 2 other authors View PDF HTML (experimental) Abstract:The hypergraph product creates a quantum stabilizer code from two input classical linear codes; a paradigmatic example being the surface code as a hypergraph product of two classical repetition codes. Many properties of the hypergraph product code can be inherited from those of the classical codes such as the code dimension, minimum distance and certain fault-tolerant gadgets. We investigate ways to reduce the number of physical qubits in hypergraph product codes while maintaining some of their useful properties for fault tolerance. We show that the code dimension, canonical logical basis, and minimum distances of the hypergraph product code are preserved through this reduction. We also provide distance-preserving syndrome measurement schedules as well as examples of reduced hypergraph product codes with parameter improvements such as $[\![610,64,6]\!] \rightarrow [\![441,64,6]\!]$ and $[\![1225,49,11]\!] \rightarrow [\![931,49,11]\!]$. In memory simulations with circuit-level depolarizing noise, we observe that the reduced codes can have similar subthreshold performance as their unreduced versions, but using fewer physical qubits. Finally, we show how overhead reduction can be compatible with homomorphic measurement gadgets, fold-transversal gates and automorphisms, which extends the savings to logical computation. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2605.11318 [quant-ph] (or arXiv:2605.11318v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2605.11318 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Aarav Pabla [view email] [v1] Mon, 11 May 2026 23:11:40 UTC (2,760 KB) Full-text links: Access Paper: View a PDF of the paper titled Spatial overhead reduction for 2D hypergraph product codes, by Aarav Pabla and 2 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-05 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