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 correlations or entanglement is a basic ingredient for many applications of quantum information theory.One important application using quantum entanglement exploits the correlation nature of entangled photon states is quantum key distribution, which is proven unbreakable in principle and provides the highest possible security that is impossible in classical information theory. However, generating entangled photon pairs is not a simple task -- only approximately one out of a million pump photons decay into a signal and idler photon pair. This low rate of entangled photon pairs is further reduced by the overhead required in order for the rectification of the inevitable errors due to channel imperfections or caused by potential eavesdroppers. As a consequence, quantum key distribution suffers from a low bit rate, which is in the order of hundreds to thousands bits per second or below. On the other hand, the classical public key distribution does not impose a tight limit on the transmission rate. However, it is subject to the risks of eavesdroppers sitting in the middle of the insecure channel. In this paper, we propose a hybrid key distribution method which uses public key distribution method to generate a raw key, and then uses entanglement assisted communication to modify the raw key by inserting a number of quantum bits in the raw key. Building upon the foundation of the unconditional security of quantum key distribution, we use the privacy amplification to make the affection of inserted bits expand to a whole key. Our quantum entanglement assisted key distribution scheme greatly improves the efficiency of key distribution while without compromising the level of security achievable by quantum cryptography.
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.
We present a protocol for large-alphabet quantum key distribution (QKD) using energy-time entangled biphotons. Binned, high-resolution timing measurements are used to generate a large-alphabet key with over 10 bits of information per photon pair, albeit with large noise. QKD with 5% bit error rate is demonstrated with 4 bits of information per photon pair, where the security of the quantum channel is determined by the visibility of Franson interference fringes. The protocol is easily generalizable to even larger alphabets, and utilizes energy-time entanglement which is robust to transmission over large distances in fiber.
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 ( a ) which is parameterized by a positive integer a . The ( a ) protocol is a generalization of the MLC scheme and utilizes NB-LDPC codes from a Galois field of size 2a 2 a . We show that by using a small value of a , the ( a ) protocol significantly improves the key rate without much increase in complexity. To further improve the key rates of the ( a ) protocol, we propose (i) a joint rate and degree distribution optimization (JRDO) algorithm to design the NB-LDPC codes for the protocol and (ii) an interleaved decoding and communication (IDC) scheme to decode the different layers of the ( 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 ( 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.
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.