Pith. sign in

REVIEW

100Mbps Reconciliation for Quantum Key Distribution Using a Single Graphics Processing Unit

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.07979 v1 pith:LD6SIL2Y submitted 2020-01-22 quant-ph cs.CR

classification quant-phcs.CR
keywords reconciliationalgorithmmbpsdistributionefficiencygraphicshighmulti-matrix
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Pith tools