Quantum Physics
arXiv:2606.23726 (quant-ph)
[Submitted on 19 Jun 2026]
Abstract:We compare repetition-based ultra-low-rate information reconciliation with dedicated ultra-low-rate codes for CV-QKD. Repetition coding offers a favorable performance-complexity trade-off, incurring only a moderate error-rate penalty while reducing decoding complexity by $2\times$, making it attractive for implementation-constrained systems.
| Comments: | Accepted and to be presented at the Optica Advanced Photonics Congress: Signal Processing in Photonic Communications (SPPCom), pp. p. SpTh1F.3, Long Beach, CA, USA, Jul. 2026 |
| Subjects: | Quantum Physics (quant-ph); Information Theory (cs.IT) |
| Cite as: | arXiv:2606.23726 [quant-ph] |
| (or arXiv:2606.23726v1 [quant-ph] for this version) | |
| https://doi.org/10.48550/arXiv.2606.23726 arXiv-issued DOI via DataCite |
Submission history
From: Erdem Eray Cil [view email]
[v1]
Fri, 19 Jun 2026 08:53:21 UTC (161 KB)
Current browse context:
quant-ph
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
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.