Back to News
quantum-computing

Decoder Performance in Hybrid CV-Discrete Surface-Code Threshold Estimation Using LiDMaS+

arXiv Quantum Physics
Loading...
4 min read
0 likes
⚡ Quantum Brief
Researchers compared decoder performance in hybrid quantum error correction, finding minimum-weight perfect matching (MWPM) consistently outperforms Union-Find under both Pauli and hybrid continuous-variable/discrete noise models at code distance d=5. Using the LiDMaS+ platform, neural-guided MWPM nearly matched standard MWPM in hybrid regimes (mean logical error rates of 0.1158 vs. 0.1195), while Union-Find lagged significantly (0.1657). The study reveals decoder choice critically impacts fault-tolerance thresholds, with MWPM achieving a stable Pauli threshold of pc≈0.053—32% lower logical error rates than Union-Find. Hybrid noise tests showed distance-dependent error reversals, but all decoders converged to a boundary threshold of σc=0.05, suggesting estimator design influences threshold inference as much as decoder type. Neural-guided decoders exhibited elevated failure rates (up to 13.35%) at high noise (d=7, σ=0.60), highlighting the need to report robustness metrics alongside threshold data.
Decoder Performance in Hybrid CV-Discrete Surface-Code Threshold Estimation Using LiDMaS+

Summarize this article with:

Quantum Physics arXiv:2603.06730 (quant-ph) [Submitted on 6 Mar 2026] Title:Decoder Performance in Hybrid CV-Discrete Surface-Code Threshold Estimation Using LiDMaS+ Authors:Dennis Delali Kwesi Wayo, Chinonso Onah, Vladimir Milchakov, Leonardo Goliatt, Sven Groppe View a PDF of the paper titled Decoder Performance in Hybrid CV-Discrete Surface-Code Threshold Estimation Using LiDMaS+, by Dennis Delali Kwesi Wayo and 4 other authors View PDF HTML (experimental) Abstract:Threshold estimation is central to fault-tolerant quantum computing, but the reported threshold depends not only on the code and noise model, but also on the decoder used to interpret syndrome data. We study this dependence for surface-code threshold estimation under both a standard Pauli noise model and a hybrid continuous-variable/discrete model motivated by GKP-style digitization. Using LiDMaS+ as a common experimental platform, we compare minimum-weight perfect matching (MWPM) and Union-Find under matched sweep grids, matched distances, and deterministic seeding, and we additionally evaluate trained neural-guided MWPM in the hybrid regime. In the Pauli baseline at distance $d=5$, MWPM consistently outperforms Union-Find, reducing the mean sampled logical error rate from $0.384$ to $0.260$, and producing a stable threshold summary with crossing median $p_c \approx 0.053$. In the hybrid fixed-distance run, Union-Find is substantially worse than MWPM (mean LER $0.1657$ versus $0.1195$), while trained neural-guided MWPM tracks MWPM closely (mean LER $0.1158$). Across hybrid multi-distance sweeps, the distance-dependent reversal in logical-error ordering remains visible, but the grid-based crossing estimator still returns boundary-valued $\sigma_c=0.05$ for all decoders. Neural-guided runs also show elevated decoder-failure diagnostics at high noise ($\max$ decoder-failure rate $0.1335$ at $d=7,\sigma=0.60$), indicating that learned guidance quality and decoder robustness must be reported alongside threshold curves. These results show that decoder choice and estimator design both materially affect threshold inference. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.06730 [quant-ph] (or arXiv:2603.06730v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.06730 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Dennis Wayo [view email] [v1] Fri, 6 Mar 2026 03:33:00 UTC (369 KB) Full-text links: Access Paper: View a PDF of the paper titled Decoder Performance in Hybrid CV-Discrete Surface-Code Threshold Estimation Using LiDMaS+, by Dennis Delali Kwesi Wayo and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 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?)

Read Original

Tags

quantum-computing

Source Information

Source: arXiv Quantum Physics