Explicit construction of low-overhead gadgets for gates on quantum LDPC codes

Quantum Physics arXiv:2511.15989 (quant-ph) [Submitted on 20 Nov 2025] Title:Explicit construction of low-overhead gadgets for gates on quantum LDPC codes Authors:Paul Webster, Samuel C. Smith, Lawrence Z. Cohen View a PDF of the paper titled Explicit construction of low-overhead gadgets for gates on quantum LDPC codes, by Paul Webster and Samuel C. Smith and Lawrence Z. Cohen View PDF HTML (experimental) Abstract:Quantum low-density parity check (QLDPC) codes can significantly reduce the overhead of quantum computing, provided the methods for performing logical operations do not require substantial space and time resources. A popular method for performing logical operations is by measuring logical Pauli operators. We present a simple, explicit construction for fixed gadgets that can measure arbitrary logical Pauli operators on QLDPC codes when dynamically connected to the code block. We apply this construction to a family of generalised bicycle codes with distances relevant to utility-scale quantum computation ($10\leq d \leq 24$) and show that it reduces the space overhead by at least an order of magnitude compared to corresponding surface code architectures, without increasing the time overhead. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2511.15989 [quant-ph] (or arXiv:2511.15989v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.15989 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Lawrence Cohen [view email] [v1] Thu, 20 Nov 2025 02:41:31 UTC (29 KB) Full-text links: Access Paper: View a PDF of the paper titled Explicit construction of low-overhead gadgets for gates on quantum LDPC codes, by Paul Webster and Samuel C. Smith and Lawrence Z. CohenView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-11 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?) Links to Code Toggle Papers with Code (What is Papers with Code?) 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?)