100Mbps Reconciliation for Quantum Key Distribution Using a Single Graphics Processing Unit
Yu Guo, Chaohui Gao, Dong Jiang, Lijun Chen

TL;DR
This paper presents a GPU-accelerated error reconciliation algorithm for quantum key distribution, achieving record-high throughput of over 102 Mbps, significantly enhancing post-processing efficiency.
Contribution
The paper introduces an optimized GPU implementation of a multi-matrix LDPC-based reconciliation algorithm, achieving the highest throughput reported for GPU platforms.
Findings
Reconciliation throughput reaches up to 102.084 Mbps.
GPU implementation significantly outperforms previous methods.
Achieves high efficiency in quantum key distribution post-processing.
Abstract
An efficient error reconciliation scheme is important for post-processing of quantum key distribution (QKD). Recently, a multi-matrix low-density parity-check codes based reconciliation algorithm which can provide remarkable perspectives for high efficiency information reconciliation was proposed. This paper concerns the improvement of reconciliation performance. Multi-matrix algorithm is implemented and optimized on the graphics processing unit (GPU) to obtain high reconciliation throughput. Experimental results indicate that GPU-based algorithm can highly improve reconciliation throughput to an average 85.67 Mbps and a maximum 102.084 Mbps with typical code rate and efficiency. This is the best performance of reconciliation on GPU platform to our knowledge.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Quantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata
