Show Paper arXiv Publisher

Quick Navigation

Overview Topics Abstract Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Error Correction Fault Tolerance Quantum Machine Learning Qldpc Advanced Quantum Codes Quantum Compilation Routing Architecture

Iteration-Dependent Scaled Min-Sum Decoding for Low-Complexity Key Reconciliation in CV-QKD

arXiv
Authors: Erdem Eray Cil, Laurent Schmalen

Year

2023

Paper ID

53313

Status

Preprint

Abstract Read

~2 min

Abstract Words

26

Citations

N/A

Abstract

We introduce an iteration-dependent scaled min-sum decoding for low-rate LDPC codes in CV-QKD, achieving near-sum product algorithm performance with reduced complexity, and facilitating CV-QKD hardware implementation.

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

[1] DOI https://doi.org/arXiv:2312.12118 [2] arXiv https://arxiv.org/abs/2312.12118 [3] Publisher https://arxiv.org/abs/2312.12118

Local Citation Graph (Related-Paper Links)

Current Paper #53313 #56298 Tackling Sampling Noise in Phys... #56297 A comprehensive survey on quant... #56285 Quantum Approximate Bayesian Op... #56282 Full-Stack Quantum Software in ...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.