Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2301.00486 · IEEE Transactions on Communications

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

Joseph J. Boutros, Emina Soljanin

Published Aug 4, 2023• 7 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tcomm.2023.3302135

Related papers

Increasing the Raw Key Rate in Energy-Time Entanglement Based Quantum Key Distribution

Esmaeil Karimi, Emina Soljanin, Philip Whiting

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.

arXiv:2001.09049•Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2020•7 citations

Modification of error reconciliation scheme for quantum cryptography

Konstantin Kuritsyn

Quantum cryptography is essentially the quantum key distribution (QKD). In the context of QKD, one from two partners (Alice) generates and sends a sequence of qubits through a private quantum channel to another partner (Bob) and Bob receives the sequence and measures the state of each qubit. After the quantum transmission stage, Alice and Bob have almost identical qubit sequences. The erros are due to physical imperfections in the channel and presence of an eavesdropper. The next stage in QKD is key reconciliation (i.e. finding and correcting discrepancies between Alice's string and that of Bob). This reconciliation can be done by public discussion. Let us suppose there is a secret quantum channel between Alice and Bob through which Alice transmits a n-bit string A=(A1, A2,...,An)ε{0,1}n. Then Bob receives a n-bit string B=(B1, B2,...,Bn)ε{0,1)n. The string B differs from A due to the presence of noise and eavesdropper in the channel. One can estimate the bit error probability in the channel. For example, Bob can choose a random subset from his string and send it to Alice in public. Then Alice compares the received string with her corresponding subset and calculates the total number of protocol steps. The cascade scheme uses the interaction over the public channel to correct the secret strings by dividing them into the blocks of a fixed length. The length is determined from the bit error probability. A simple interactive routine is applied in each of these blocks. An error found in some block results in some action with other blocks. It is important to optimize the error-finding routines in standalone blocks as well as to organize the effective constrution of blocks with the object of protocol benchmark, information leakage and number of interactions between partners.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 23, 2003•6 citations

Efficient information reconciliation in quantum key distribution systems using informed design of non-binary LDPC codes

Debarnab Mitra, Jayanth Shreekumar, Lev Tauz +3 more

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 $$2^a$$ 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.

Quantum Information Processing•Apr 3, 2024•5 citations

An enhancement of quantum key distribution protocol with noise problem

Feng‐Tse Lin

[[abstract]]An enhanced version of the quantum key distribution (QKD) protocol in quantum cryptography is proposed. We consider that realistic detectors and imperfect devices may introduce noise into the transmission thereby causing a high error rate. The proposed scheme is based on an error rate analysis and a random sampling procedure in statistics to produce a probabilistic bound on the error estimation. Confidence intervals are used to interpret the error estimate with a specified confidence level. Based on the information obtained, Alice and Bob judge what caused the errors and establish confidence levels for the error rate of the remaining untested bits. Hence, they can determine the maximum number of times reconciliation needs to be performed to remove all errors from what remains of a raw key to produce an error-free secret key. As a result, the tedious reconciliation process can be reduced and a neglectful probability of not detecting the existence of remaining errors can be avoided as well. The privacy amplification is then applied: (1) to extract a secret key from a partially secret key, and (2) to enlarge the length of the secret key into the final key. The proposed scheme can work when dealing with errors caused by random noise and eavesdropping.

•Jan 1, 2008•0 citations

Entanglement-based quantum key distribution in standard telecom channels for long-distance multi- user network implementation

Djeylan Aktas, Bruno Fedrici, Laurent Labonté +1 more

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.

•Jul 14, 2014•0 citations

QKD Based on Time-Entangled Photons and Its Key-Rate Promise

Lara Dolecek, Emina Soljanin

For secure practical systems, quantum key distribution (QKD) must provide high key rates over long distances. Time-entanglement-based QKD promises to increase the secret key rate and distribution distances compared to other QKD implementations. This article describes the major steps in QKD protocols, focusing on the nascent QKD technology based on high-dimensional time-bin entangled photons. We overview state-of-the-art from the information and coding theory perspective. In particular, we discuss the key rate loss due to single-photon detector imperfections. We hope the open questions posed and discussed in this paper will inspire information and coding theorists to contribute to and impact fledgling quantum applications and influence future quantum communication systems.

arXiv:2303.01973•IEEE BITS the Information Theory Magazine•Dec 1, 2022•3 citations
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.
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.
Quantum cryptography is essentially the quantum key distribution (QKD). In the context of QKD, one from two partners (Alice) generates and sends a sequence of qubits through a private quantum channel to another partner (Bob) and Bob receives the sequence and measures the state of each qubit. After the quantum transmission stage, Alice and Bob have almost identical qubit sequences. The erros are due to physical imperfections in the channel and presence of an eavesdropper. The next stage in QKD is key reconciliation (i.e. finding and correcting discrepancies between Alice's string and that of Bob). This reconciliation can be done by public discussion. Let us suppose there is a secret quantum channel between Alice and Bob through which Alice transmits a n-bit string A=(A1, A2,...,An)ε{0,1}n. Then Bob receives a n-bit string B=(B1, B2,...,Bn)ε{0,1)n. The string B differs from A due to the presence of noise and eavesdropper in the channel. One can estimate the bit error probability in the channel. For example, Bob can choose a random subset from his string and send it to Alice in public. Then Alice compares the received string with her corresponding subset and calculates the total number of protocol steps. The cascade scheme uses the interaction over the public channel to correct the secret strings by dividing them into the blocks of a fixed length. The length is determined from the bit error probability. A simple interactive routine is applied in each of these blocks. An error found in some block results in some action with other blocks. It is important to optimize the error-finding routines in standalone blocks as well as to organize the effective constrution of blocks with the object of protocol benchmark, information leakage and number of interactions between partners.
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 2a2^a2a 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.
[[abstract]]An enhanced version of the quantum key distribution (QKD) protocol in quantum cryptography is proposed. We consider that realistic detectors and imperfect devices may introduce noise into the transmission thereby causing a high error rate. The proposed scheme is based on an error rate analysis and a random sampling procedure in statistics to produce a probabilistic bound on the error estimation. Confidence intervals are used to interpret the error estimate with a specified confidence level. Based on the information obtained, Alice and Bob judge what caused the errors and establish confidence levels for the error rate of the remaining untested bits. Hence, they can determine the maximum number of times reconciliation needs to be performed to remove all errors from what remains of a raw key to produce an error-free secret key. As a result, the tedious reconciliation process can be reduced and a neglectful probability of not detecting the existence of remaining errors can be avoided as well. The privacy amplification is then applied: (1) to extract a secret key from a partially secret key, and (2) to enlarge the length of the secret key into the final key. The proposed scheme can work when dealing with errors caused by random noise and eavesdropping.
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.
For secure practical systems, quantum key distribution (QKD) must provide high key rates over long distances. Time-entanglement-based QKD promises to increase the secret key rate and distribution distances compared to other QKD implementations. This article describes the major steps in QKD protocols, focusing on the nascent QKD technology based on high-dimensional time-bin entangled photons. We overview state-of-the-art from the information and coding theory perspective. In particular, we discuss the key rate loss due to single-photon detector imperfections. We hope the open questions posed and discussed in this paper will inspire information and coding theorists to contribute to and impact fledgling quantum applications and influence future quantum communication systems.