← 研踪 PaperTrailarXiv:2605.03631 · v4
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
首次提交 2026-05-05 19:00
版本更新 2026-11-09 18:18
雷达观测 2026-11-10 15:22
摘要
Quantum error correcting codes are essential to achieve fault-tolerant quantum computation. This work introduces two constructions of high-rate, dual-containing (DC) Calderbank--Shor--Steane low-density parity-check (LDPC) codes based on quasi-dyadic matrices. We characterize the automorphism group of such codes, investigate their minimum distance behavior, and provide several theoretical results on their cycle properties. Monte Carlo simulations under depolarizing and phenomenological noise show better finite-length logical error rates than the considered DC benchmark codes and competitive performance against several state-of-the-art quantum LDPC code families. Finally, we employ an automorphism-ensemble belief propagation decoder to improve their decoding performance.
作者备注：16 pages, Journal paper
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v4 · 2026-11-09 18:18 · 最新观测版本
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
Quantum error correcting codes are essential to achieve fault-tolerant quantum computation. This work introduces two constructions of high-rate, dual-containing (DC) Calderbank--Shor--Steane low-density parity-check (LDPC) codes based on quasi-dyadic matrices. We characterize the automorphism group of such codes, investigate their minimum distance behavior, and provide several theoretical results on their cycle properties. Monte Carlo simulations under depolarizing and phenomenological noise show better finite-length logical error rates than the considered DC benchmark codes and competitive performance against several state-of-the-art quantum LDPC code families. Finally, we employ an automorphism-ensemble belief propagation decoder to improve their decoding performance.
查看此版本解读 →查看此版本原文 ↗