QEDist: Practical Exact Distance Certification for Stabilizer Codes

Understand this faster with AI
Quantum Physics arXiv:2611.21709 (quant-ph) [Submitted on 16 Nov 2026] Title:QEDist: Practical Exact Distance Certification for Stabilizer Codes Authors:Jong Yeon Lee View a PDF of the paper titled QEDist: Practical Exact Distance Certification for Stabilizer Codes, by Jong Yeon Lee View PDF HTML (experimental) Abstract:We present QEDist, a method and software package that certifies the distance of qubit stabilizer codes. Building on tree-search methods, QEDist constructs candidate logical operators one qubit at a time, using sparse parity checks, stabilizer equivalence, and verified symmetries to reduce the work. For a cutoff $W$, a completed search either finds a nontrivial logical operator of weight at most $W$ or proves that none exists. Because satisfying one check can violate another, we use both satisfied and unsatisfied checks to lower-bound the weight needed to complete a logical operator, and prune branches whose bound exceeds the remaining budget, which substantially reduces net search time. We benchmark QEDist mainly on Calderbank-Shor-Steane (CSS) codes; the same formulation extends to non-CSS codes and to the fault distance of syndrome-extraction circuits. For lifted-product (LP) codes, we further exploit the product structure to replace part of the full-code search with a smaller search on a classical constituent. We establish exact distances for codes with up to several thousand qubits, including Abelian and non-Abelian LP codes whose distances were previously reported only as upper bounds. In several seconds of search on one laptop core, QEDist certifies exact distances up to 20 for many of these codes and fault distance 10 for the syndrome-extraction circuit of the $[[144,12,12]]$ code. With orders-of-magnitude speedups over the tested exact solvers, QEDist makes exact distance certification a practical tool for selecting and optimizing finite-length quantum codes. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2611.21709 [quant-ph] (or arXiv:2611.21709v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2611.21709 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Jong Yeon Lee [view email] [v1] Mon, 16 Nov 2026 18:57:20 UTC (209 KB) Full-text links: Access Paper: View a PDF of the paper titled QEDist: Practical Exact Distance Certification for Stabilizer Codes, by Jong Yeon LeeView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-11 References & Citations INSPIRE HEP SciXGoogle 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?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
