Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchComunicații cuantice

analiza aiqbench

This research identifies steep error-rate transitions in quantum quasi-cyclic LDPC codes decoded via joint belief propagation, marking the first observation of such threshold-like behavior for non-vanishing coding rates without using non-binary decoders. The study attributes these performance limits to specific subgraph structures known as trapping sets within the Tanner graph and suggests that avoiding them could significantly reduce error floors in future quantum communication systems.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Sharp Error-Rate Transitions in Quantum QC-LDPC Codes under Joint BP Decoding

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2507.11534v3 Announce Type: replace Abstract: In this study, we report that quantum quasi-cyclic low-density parity-check codes decoded via joint belief propagation (BP) exhibit steep error-rate curves, despite the presence of error floors. To the best of our knowledge, this is the first observation of such threshold-like behavior for quantum LDPC codes with non-vanishing coding rate, excluding those decoded with non-binary BP decoders. Moreover, we find that dominant error events contributing to the error floor typically involve only a small number of bits. These findings suggest that the error floor is caused by trapping sets--specific subgraph structures in the Tanner graph--and indicate that identifying and avoiding such structures may lead to further reduction of the error floor.

Abstract:In this study, we report that quantum quasi-cyclic low-density parity-check codes decoded via joint belief propagation (BP) exhibit steep error-rate curves, despite the presence of error floors. To the best of our knowledge, this is the first observation of such threshold-like behavior for quantum LDPC codes with non-vanishing coding rate, excluding those decoded with non-binary BP decoders. Moreover, we find that dominant error events contributing to the error floor typically involve only a small number of bits. These findings suggest that the error floor is caused by trapping sets--specific subgraph structures in the Tanner graph--and indicate that identifying and avoiding such structures may lead to further reduction of the error floor.

Quantum Physics (quant-ph); Information Theory (cs.IT)

arXiv:2507.11534 [quant-ph]

(or arXiv:2507.11534v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2507.11534 Focus to learn more arXiv-issued DOI via DataCite

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.

Text integral sub licența deschisă a publicației · 206 cuvinte

Subiecte conexe