Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search
Summarize this article with:
Quantum Physics arXiv:2606.11468 (quant-ph) [Submitted on 9 Jun 2026] Title:Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search Authors:Aditya Sodhani (1), Pavan Kumar (2), Shayan Srinivasa Garani (2), Keshab K. Parhi (1) ((1) University of Minnesota, Minneapolis, USA, (2) Indian Institute of Science, Bengaluru, India) View a PDF of the paper titled Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search, by Aditya Sodhani (1) and 8 other authors View PDF HTML (experimental) Abstract:Entanglement-assisted (EA) quantum QC-LDPC codes offer strong error-correction capabilities with structured parity-check matrices, but their practical use depends on efficient encoder circuits and the availability of pre-shared Bell pairs (ebits). In all encoder implementations based on the stabilizer formalism, the dominant contribution to this complexity comes from the use of controlled gates. In this paper, we adopt the Sharma-Kumar-Garani (SKG) encoder construction. We formulate the encoder optimization as a search over GF(2) row operations that decompose the binary matrix derived from its CNOT sub-sequence. We solve this problem using a beam search algorithm guided by a Hamming-distance heuristic. For the tested EA quantum QC-LDPC code families, the proposed method achieves CNOT-count reductions of 7.3-34.0% relative to the SKG baseline encoder. The optimized circuits also yield lower CNOT counts than Patel-Markov-Hayes synthesis on all tested instances and are verified by stabilizer-tableau simulation. These results show that substantial encoder simplification is possible for structured EA QC-LDPC codes. Subjects: Quantum Physics (quant-ph); Information Theory (cs.IT) Cite as: arXiv:2606.11468 [quant-ph] (or arXiv:2606.11468v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.11468 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Keshab Parhi [view email] [v1] Tue, 9 Jun 2026 21:57:07 UTC (1,658 KB) Full-text links: Access Paper: View a PDF of the paper titled Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search, by Aditya Sodhani (1) and 8 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-06 Change to browse by: cs cs.IT math math.IT 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?)