A Quantum Key Distribution (QKD) protocol describes how two remote parties can establish a secret key by communicating over a quantum and a public classical channel that both can be accessed by an eavesdropper. QKD protocols using energy-time entangled photon pairs are of growing practical interest because of their potential to provide a higher secure key rate over long distances by carrying multiple bits per entangled photon pair. We consider a system where information can be extracted by measuring random times of a sequence of entangled photon arrivals. Our goal is to maximize the utility of each such pair. We propose a discrete time model for the photon arrival process, and establish a theoretical bound on the number of raw bits that can be generated under this model. We first analyse a well known simple binning encoding scheme, and show that it generates significantly lower information rate than what is theoretically possible. We then propose three adaptive schemes that increase the number of raw bits generated per photon, and compute and compare the information rates they offer. Moreover, the effect of public channel communication on the secret key rates of the proposed schemes is investigated.
A Quantum Key Distribution (QKD) protocol describes how two remote parties can establish a secret key by communicating over a quantum and a public classical channel that both can be accessed by an eavesdropper. QKD protocols using energy-time entangled photon pairs are of growing practical interest because of their potential to provide a higher secure key rate over long distances by carrying multiple bits per entangled photon pair. We consider a system where information can be extracted by measuring random times of a sequence of entangled photon arrivals. Our goal is to maximize the utility of each such pair. We propose a discrete time model for the photon arrival process, and establish a theoretical bound on the number of raw bits that can be generated under this model. We first analyse a well known simple binning encoding scheme, and show that it generates significantly lower information rate than what is theoretically possible. We then propose three adaptive schemes that increase the number of raw bits generated per photon, and compute and compare the information rates they offer. Moreover, the effect of public channel communication on the secret key rates of the proposed schemes is investigated.
In time entanglement-based quantum key distribution (TE-QKD), Alice and Bob extract the raw key bits from the arrival times of entangled photon pairs. Each entangled pair can contribute to multiple key bits depending on how precisely Alice and Bob can measure the photon arrival times. Thus, TE-QKD can potentially increase the secret key rate compared to typical QKD implementations, which extract up to a bit per photon. Because of entanglement, the times of photon arrivals at Alice’s and Bob’s detectors and, thus, their raw keys should be identical. However, practical photon detectors suffer from time jitter errors. These errors cause discrepancies between Alice’s and Bob’s raw keys. Therefore, Alice must send information to Bob through the public channel to reconcile their raw keys. The amount of data sent for reconciliation represents a loss, rendering secret keys shorter than the raw keys. We compute the secret key rates possible in systems with detector jitter errors and show that they are much higher than those achievable in polarization entanglement-based QKD. We then construct codes for information reconciliation to approach these rates. We demonstrate that short and moderate-length standard error-correcting codes represent excellent information reconciliation choices, making TE-QKD a promising technology.
Quantum Key distribution (QKD) enables two parties, Alice and Bob, to share a sequence of random bit whose secrecy is guaranteed by the fondations of quantum physics. The natural counterpart of this genuine inviolability lies in moderate key generation rates and achievable distances, due to severe exper- imental constraints, such as photon generation probabilities, detector's inefficiencies, detector's dark counts, and losses in fiber distribution channels. As well as improving these exper- imental resources since the last couple of years, several strate- gies are developed for increasing this bit rate. One promising way consists in exploiting the spectral correlations of time- energy entangled photons, enabling higher information con- tent per paired photon. Our idea is to combine the maturity of QKD schemes with high performance standard telecom com- ponents to propose a practical scheme allowing the distribu- tion of secret bits over 200 km at unprecedented rates.
Abstract In Quantum Key Distribution (QKD), two users extract a shared secret key using a quantum communication channel in the presence of an eavesdropper. Among QKD protocols, the ones based on Energy-Time (ET) entanglement of photons have been studied extensively due to their ability to generate high key rates from the arrival times of entangled photons. For the information reconciliation (IR) stage of ET-QKD protocols (where the users communicate using a classical channel in order to reconcile differences in their data), a scheme called multi-level coding (MLC) was proposed by Zhou et al. in prior work. The MLC scheme splits the raw key symbols into bit layers and utilizes binary Low-Density Parity-Check (LDPC) codes to encode each layer. Although binary LDPC codes are able to offer low complexity decoding for IR, they have poor error-correcting performance compared to their non-binary counterparts, thus leading to low key rates. Additionally, existing LDPC codes do not fully utilize the properties of the QKD channel to optimize the key rates. In this paper, we mitigate the above issues by proposing a flexible protocol for IR in ET-QKD systems called Non-Binary Multi-Level Coding NB-MLC(a) which is parameterized by a positive integer a. The NB-MLC(a) protocol is a generalization of the MLC scheme and utilizes NB-LDPC codes from a Galois field of size 2^a. We show that by using a small value of a, the NB-MLC(a) protocol significantly improves the key rate without much increase in complexity. To further improve the key rates of the NB-MLC(a) protocol, we propose i) a joint rate and degree distribution optimization (JRDO) algorithm to design the NB-LDPC codes for the protocol; ii) an interleaved decoding and communication (IDC) scheme to decode the different layers of the NB-MLC(a) protocol. The JRDO algorithm is designed to use the QKD channel information and we show that it results in a higher key rate than codes used in prior work. Additionally, the IDC scheme improves the key rate compared to the decoding and communication methods utilized previously in literature. Overall, the NB-MLC(a) protocol that uses JRDO LDPC codes and the IDC scheme results in a significant 40 − 60% improvement in key rates compared to prior work for ET-QKD systems.
An energy-time entanglement-based dispersive optics quantum key distribution (DO-QKD) is demonstrated experimentally over optical fibers of 20 km. In the experiment, the telecom band energy-time entangled photon pairs are generated through spontaneous four-wave mixing in a silicon waveguide. The arrival time of photons is registered for key generation and security test. High-dimensional encoding in the arrival time of photons is used to increase the information per coincidence of photon pairs. The bin sifting process is optimized by a three-level structure, which significantly reduces the raw quantum bit error rate (QBER) due to timing jitters of detectors and electronics. A raw key generation rate of 151 kbps with a QBER of 4.95% is achieved, in a time bin encoding format with 4 bits per coincidence. This experiment shows that the entanglement-based DO-QKD can be implemented in an efficient and convenient way, which has great potential for quantum secure communication networks in the future.
Conventional quantum key distribution (QKD) typically uses binary encoding based on photon polarization or time-bin degrees of freedom and achieves a key capacity of at most one bit per photon. Under photon-starved conditions the rate of detection events is much lower than the photon generation rate, because of losses in long distance propagation and the relatively long recovery times of available single-photon detectors. Multi-bit encoding in the photon arrival times can be beneficial in such photon-starved situations. Recent security proofs indicate high-dimensional encoding in the photon arrival times is robust and can be implemented to yield high secure throughput. In this work we demonstrate entanglement-based QKD with high-dimensional encoding whose security against collective Gaussian attacks is provided by a high-visibility Franson interferometer. We achieve unprecedented key capacity and throughput for an entanglement-based QKD system because of four principal factors: Franson interferometry that does not degrade with loss; error correction coding that can tolerate high error rates; optimized time–energy entanglement generation; and highly efficient WSi superconducting nanowire single-photon detectors. The secure key capacity yields as much as 8.7 bits per coincidence. When optimized for throughput we observe a secure key rate of 2.7 Mbit s −1 after 20 km fiber transmission with a key capacity of 6.9 bits per photon coincidence. Our results demonstrate a viable approach to high-rate QKD using practical photonic entanglement and single-photon detection technologies.
We introduce noise-adaptive quantum key distribution (QKD) protocols, in which the honest parties optimize the encoding (state preparation) and decoding (measurement basis) operations according to the noise models affecting the honest subsystems induced by an eavesdropper. This extends conventional QKD schemes that employ fixed encoding and decoding strategies independent of the noise characteristics of the communication channel. We investigate three representative protocols: entanglement-based secure dense coding (SDC), the entanglement-free Lucamarini and Mancini (LM05), and a two-way prepare-and-measure Bennett Brassard (BB84) protocols. Using entropic uncertainty relations, we derive the corresponding secret key rates for both adaptive and conventional non-adaptive scenarios under collective attacks. For independent but identical noise acting on the forward and backward transmission channels, as well as for correlated and non-Markovian environments, we identify classes of channels for which adaptive schemes yield enhanced secret key rates for the considered protocols. In contrast, we also determine Pauli channels, including depolarizing and bit flip channels, for which adaptive strategies provide no benefit. We further show that these optimal sets are generally non-unique and can differ substantially from the unitaries that maximize dense-coding capacity in the absence of security constraints. Our results establish noise-adaptive encoding and decoding as a powerful framework for improving secure communication over realistic noisy quantum channels.