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

IEEE Region 10 Conference (TENCON)

Quantum Key Distribution Optimization: Reducing Communication Overhead in Post-Processing Steps

Ashutosh Bhatia, Sainath Bitragunta, Kamlesh Tiwari

Published Dec 1, 2024• 2 citations
Publisher
DOI
10.1109/tencon61640.2024.10903120

Related papers

Exploring Quantum Key Distribution: Protocol Efficiency and Implementation Challenges

M. Gayathri, Naman Kaushik, R. Thilagavathy +3 more

Intelligent systems reference library•Jan 1, 2025•1 citation

Enhanced Lightweight Quantum Key Distribution Protocol for Improved Efficiency and Security

Ashutosh Bhatia, Sainath Bitragunta, Kamlesh Tiwari

Quantum Key Distribution (QKD) provides secure communication by leveraging quantum mechanics, with the BB84 protocol being one of its most widely adopted implementations. However, the classical post-processing steps in BB84, such as sifting, error correction, and key verification, often result in significant communication overhead, limiting its efficiency and scalability. In this work, we propose three key optimizations for BB84: (1) PRNG-based predetermined key bit positioning, which eliminates redundant bit exchanges during sifting, (2) hash-based subsequence comparison, enabling lightweight and efficient key verification, and (3) adaptive basis reconciliation, which minimizes the communication costs associated with basis matching. The proposed optimizations achieve a 50% reduction in communication overhead for large key sizes compared to traditional QKD protocols, as demonstrated through rigorous performance analysis. While the focus of this work is on the BB84 protocol, these optimizations are also directly applicable to a broader class of Discrete-Variable QKD (DV-QKD) protocols, such as six-state, B92, and E91, which share a fundamentally similar post-processing structure. This generality highlights the modularity and adaptability of the proposed methods across diverse QKD implementations. The proposed optimizations enhance post-processing efficiency and scalability, enabling practical deployment in bandwidth-limited environments like IoT networks, secure financial systems, and defense communications, thereby supporting broader adoption of quantum communication systems.

IEEE Open Journal of the Communications Society•Jan 1, 2025•19 citations

Implementation of Quantum Key Distribution Protocols

Eleftherios Moschandreou

•Jan 1, 2019•0 citations

Reinforcement Learning-based Adaptive Error Correction for BB84 Quantum Key Distribution: A Q-Learning Approach to Post-Processing Optimization

Devishree Rohit Naidu, Sweta Jain, Ananya Anand +2 more

In Quantum Key Distribution (QKD) protocol BB84, a crucial step is post-processing. It is where the communicating parties correct errors caused either by channel noise or by an eavesdropper. Standard BB84 implementations usually relies on fixed choices of post-processing parameters. This often leads to extra classical communication and lowers the effective key generation rate. In this work, we propose an adaptive framework based on reinforcement learning that changes the error-correction block size dynamically during the classical reconciliation stage of BB84. We have tested this idea using Qiskit Aer simulations over 200 runs with key lengths ranging from 100 to 500 qubits. Here we observed approximately 30-50% reduction in communication overhead compared to the conventional fixed-block settings. Even though this introduces slightly higher error rates, it still improves the overall efficiency of key generation across all evaluated key sizes. This indicates that reinforcement learning can make QKD post-processing more efficient. This can open opportunities for quantum-secure communication systems.

International Conference on Connected Intelligence for Industrial Applications (CI2A)•Apr 3, 2026•0 citations

Quantum key distribution and its applications

Masahiro Takeoka

Elsevier eBooks•Jan 1, 2024•0 citations

Improved polar-code-based efficient post-processing algorithm for quantum key distribution

Junbin Fang, Zhengzhong Yi, Jin Li +5 more

Combined with one-time pad encryption scheme, quantum key distribution guarantees the unconditional security of communication in theory. However, error correction and privacy amplification in the post-processing phase of quantum key distribution result in high time delay, which limits the final secret key generation rate and the practicability of quantum key distribution systems. To alleviate this limitation, this paper proposes an efficient post-processing algorithm based on polar codes for quantum key distribution. In this algorithm, by analyzing the channel capacity of the main channel and the wiretap channel respectively under the Wyner's wiretap channel model, we design a codeword structure of polar codes, so that the error correction and privacy amplification could be completed synchronously in a single step. Through combining error correction and privacy amplification into one single step, this efficient post-processing algorithm reduces complexity of the system and lower the post-processing delay. Besides, the reliable and secure communicaiton conditions for this algorithm has been given in this paper. Simulation results show that this post-processing algorithm satisfies the reliable and secure communication conditions well.

arXiv:2112.10586•Scientific Reports•Jun 16, 2022•9 citations
Quantum Key Distribution (QKD) provides secure communication by leveraging quantum mechanics, with the BB84 protocol being one of its most widely adopted implementations. However, the classical post-processing steps in BB84, such as sifting, error correction, and key verification, often result in significant communication overhead, limiting its efficiency and scalability. In this work, we propose three key optimizations for BB84: (1) PRNG-based predetermined key bit positioning, which eliminates redundant bit exchanges during sifting, (2) hash-based subsequence comparison, enabling lightweight and efficient key verification, and (3) adaptive basis reconciliation, which minimizes the communication costs associated with basis matching. The proposed optimizations achieve a 50% reduction in communication overhead for large key sizes compared to traditional QKD protocols, as demonstrated through rigorous performance analysis. While the focus of this work is on the BB84 protocol, these optimizations are also directly applicable to a broader class of Discrete-Variable QKD (DV-QKD) protocols, such as six-state, B92, and E91, which share a fundamentally similar post-processing structure. This generality highlights the modularity and adaptability of the proposed methods across diverse QKD implementations. The proposed optimizations enhance post-processing efficiency and scalability, enabling practical deployment in bandwidth-limited environments like IoT networks, secure financial systems, and defense communications, thereby supporting broader adoption of quantum communication systems.
In Quantum Key Distribution (QKD) protocol BB84, a crucial step is post-processing. It is where the communicating parties correct errors caused either by channel noise or by an eavesdropper. Standard BB84 implementations usually relies on fixed choices of post-processing parameters. This often leads to extra classical communication and lowers the effective key generation rate. In this work, we propose an adaptive framework based on reinforcement learning that changes the error-correction block size dynamically during the classical reconciliation stage of BB84. We have tested this idea using Qiskit Aer simulations over 200 runs with key lengths ranging from 100 to 500 qubits. Here we observed approximately 30-50% reduction in communication overhead compared to the conventional fixed-block settings. Even though this introduces slightly higher error rates, it still improves the overall efficiency of key generation across all evaluated key sizes. This indicates that reinforcement learning can make QKD post-processing more efficient. This can open opportunities for quantum-secure communication systems.
Combined with one-time pad encryption scheme, quantum key distribution guarantees the unconditional security of communication in theory. However, error correction and privacy amplification in the post-processing phase of quantum key distribution result in high time delay, which limits the final secret key generation rate and the practicability of quantum key distribution systems. To alleviate this limitation, this paper proposes an efficient post-processing algorithm based on polar codes for quantum key distribution. In this algorithm, by analyzing the channel capacity of the main channel and the wiretap channel respectively under the Wyner's wiretap channel model, we design a codeword structure of polar codes, so that the error correction and privacy amplification could be completed synchronously in a single step. Through combining error correction and privacy amplification into one single step, this efficient post-processing algorithm reduces complexity of the system and lower the post-processing delay. Besides, the reliable and secure communicaiton conditions for this algorithm has been given in this paper. Simulation results show that this post-processing algorithm satisfies the reliable and secure communication conditions well.