Papers
Topics
Authors
Recent
2000 character limit reached

Time-Entanglement QKD: Secret Key Rates and Information Reconciliation Coding

Published 1 Jan 2023 in cs.IT, math.IT, and quant-ph | (2301.00486v1)

Abstract: In time entanglement-based quantum key distribution (QKD), Alice and Bob extract the raw key bits from the (identical) arrival times of entangled photon pairs by time-binning. Each of them individually discretizes time into bins and groups them into frames. They retain only the frames with a single occupied bin. Thus, Alice and Bob can use the position of the occupied bin within a frame to generate random key bits, as in PPM modulation. Because of entanglement, their occupied bins and their keys should be identical. However, practical photon detectors suffer from time jitter errors. These errors cause discrepancies between Alice's and Bob's keys. Alice sends information to Bob through the public channel to reconcile the keys. The amount of information determines the secret key rate. This paper computes the secret key rates possible with detector jitter errors and constructs codes for information reconciliation to approach these rates.

Citations (6)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.