Efficient Information Reconciliation for Energy-Time Entanglement Quantum Key Distribution
Siyi Yang, Murat Can Sarihan, Kai-Chi Chang, Chee Wei Wong, Lara, Dolecek

TL;DR
This paper introduces a novel graph coding scheme tailored for energy-time entangled photon channels in quantum key distribution, improving error correction by leveraging specific channel properties.
Contribution
It develops a balanced modulation and a joint local-global graph coding scheme optimized for energy-time entangled photon channels in QKD.
Findings
Channel statistics for energy-time entangled photon QKD are characterized.
The proposed coding scheme shows promising error correction performance.
The approach utilizes channel properties for improved reconciliation efficiency.
Abstract
Graph based codes such as low density parity check (LDPC) codes have been shown promising for the information reconciliation phase in quantum key distribution (QKD). However, existing graph coding schemes have not fully utilized the properties of the QKD channel. In this work, we first investigate the channel statistics for discrete variable (DV) QKD based on energy-time entangled photons. We then establish a so-called balanced modulation scheme that is promising for this channel. Based on the modulation, we propose a joint local-global graph coding scheme that is expected to achieve good error-correction performance.
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
TopicsQuantum Computing Algorithms and Architecture · Error Correcting Code Techniques · Quantum Information and Cryptography
