Forced Gap Post-Selection for Quantum LDPC Codes and their Operations
Summarize this article with:
Quantum Physics arXiv:2605.20346 (quant-ph) [Submitted on 19 May 2026] Title:Forced Gap Post-Selection for Quantum LDPC Codes and their Operations Authors:Adam Wills, Theodore J. Yoder, Isaac Chuang View a PDF of the paper titled Forced Gap Post-Selection for Quantum LDPC Codes and their Operations, by Adam Wills and 2 other authors View PDF Abstract:We develop a simple and general post-selection strategy for high-rate quantum codes that is transferrable across decoders. After an initial baseline run, the decoder is re-run once per logical observable, and forced in these latter runs to provide a solution where the given observable has the complementary outcome. Shots are rejected that find logically complementary solutions with similar likelihoods compared to the baseline. Using the Relay-BP decoder, we benchmark the strategy on the $72$-qubit and $144$-qubit bivariate bicycle codes, as well as surgery gadgets for the latter. In comparison to previous post-selection strategies, our results offer an improved logical error rate by over a factor of $4$ on the same circuit and physical error rate, and at the same rate of post-selection. Our strategies are also lightweight, relying only on FPGA-friendly belief propagation, whereas the previous best used repeated rounds of a high-latency BP-OSD decoder. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2605.20346 [quant-ph] (or arXiv:2605.20346v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2605.20346 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Adam Wills [view email] [v1] Tue, 19 May 2026 18:03:20 UTC (441 KB) Full-text links: Access Paper: View a PDF of the paper titled Forced Gap Post-Selection for Quantum LDPC Codes and their Operations, by Adam Wills and 2 other authorsView PDFTeX 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?)