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 Jordan Conference on Applied Electrical Engineering and Computing Technologies

Permutated recovering unused quantum bits

Abdulla M. Abu-ayyash, Naim Ajlouni

Published Dec 1, 2011• 0 citations
Publisher

Abstract

Some quantum key distribution (QKD) technics - BB84, B92 [4], [5] for example - have a gain problem comparing the fnal key to the generated pulses of quantum particles. RUQB [1] technique improves the gain of BB84 by 5.5%, the improvement was achieved by fnding the relationship among the random bits that where initially generated, then exchanging this relationship to aid in recovery of some lost bits. This research permutate the sets that RUQB uses (hence P-RUQB) to have better gain, it was found that about 30% gain can be recovered by using about 8 permutations in ideal situation.

DOI
10.1109/aeect.2011.6132521

Related papers

Using Permutations to Enhance the Gain of RUQB Technique

Abdulla M. Abu-ayyash, Naim Ajlouni

Quantum key distribution (QKD) techniques usually suffer from a gain problem when comparing the final key to the generated pulses of quantum states. This research permutes the sets that RUQB (Abu-ayyash & Ajlouni, 2008) uses in order to increase the gain. The effect of both randomness and permutations are studied; While RUQB technique improves the gain of BB84 QKD by 5.5% it was also shown that the higher the randomness of the initial key the higher the gain that can be achieved, this work concluded that the use of around 7 permutations results in 30% gain recovery in an ideal situations.

International Journal of Information Technology and Web Engineering•Apr 1, 2012•1 citation

QKD: Recovering Unused Quantum Bits

Abdulla M. Abu-ayyash, Naim Ajlouni

Practical quantum key distribution gain is usually less than the theoretical limit, this is due to the imperfection of physical devices, quantum channels, and the lost qubits due to test carried out for for the identification of the presence of an eavesdropper and the consequence reduction of obtained knowledge. In this paper a technique is presented to recover some of the unused qubits which result in an increase in the gain of the QKD protocols, in this research it was found that for the BB84 the recovered qubits can be as much as 11% of the initial key bits. This technique is based on discovering the relationship between the initial key bits and the original random bits which will aid in the recovery process of the unused qubits ( unused qubits are the bits which are assumed to be lost at the start of the process due to the random process and for BB84 it is assumed to be around 50% of the generated key bits).

International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA)•Apr 1, 2008•5 citations

An improved proposal on the practical quantum key distribution with biased basis

Chen-Chen Mao, Jian Li, Jian-Rong Zhu +2 more

Quantum Information Processing•Sep 5, 2017•12 citations

Innovative Enhancements in Quantum Key Distribution Using Multi-Decoy States, Advanced Bit Recovery, and Adaptive Filtering with ML

Naim Ajlouni

Abstract Quantum Key Distribution (QKD) stands as a ground breaking approach to secure communication, exploiting the principles of quantum mechanics to achieve theoretically unbreakable encryption. Despite substantial progress, challenges in optimizing key rates and ensuring robustness, particularly in high-loss environments, persist. This research proposes an advanced QKD method that integrates multiple decoy states with optimized intensity levels and pulse probabilities, advanced bit recovery techniques, and adaptive machine learning (ML) filtering to enhance signal-to-noise ratio (SNR). The proposed framework leverages ML-driven adaptive filtering to dynamically reduce noise, thereby improving the accuracy of gain and error rate calculations for decoy states and enhancing the efficiency of bit recovery. The bit recovery process incorporates permutation-based enhancement techniques, optimizing the recovery of unused quantum bits (RUQB). The proposed method is thoroughly evaluated through comparative analysis against leading QKD protocols, including E91, BBM92, B92, Six-state, Decoy State, and DSP protocols. The results demonstrate significant improvements in secure key rates, the percentage of correctly recovered bits, and overall system robustness, especially in challenging conditions. This research contributes to the advancement of QKD by providing a more resilient and efficient approach, addressing key limitations of existing methods, and paving the way for enhanced secure quantum communication systems.

•Sep 4, 2024•0 citations

Finite-Key Analysis of BB84 and B92 QKD with Discrete Phase Randomization and Koashi Bound

Brenendra Putra Oktaviansyah, Totok Sutojo, Muhamad Akrom

Quantum Key Distribution (QKD) enables theoretically secure key exchange based on fundamental quantum principles such as the no-cloning theorem and Heisenberg’s uncertainty principle. However, practical implementations remain vulnerable to side-channel attacks caused by device imperfections, while many existing studies primarily analyze asymptotic security or isolated attack scenarios rather than realistic finite-key conditions. Unlike prior studies that focus on asymptotic or single-attack analyses, this work presents a comprehensive finite-key security evaluation of BB84 and B92 protocols under hybrid side-channel attacks using Discrete Phase Randomization (DPR) as a lightweight mitigation strategy and the Koashi bound for improved phase-error estimation in B92. Numerical simulations are performed using realistic system parameters with a finite-key size of 100 billion pulses across ten representative attack scenarios. The results show that applying DPR (M = 32) significantly suppresses phase-sensitive attack-induced errors, reducing the quantum bit error rate (QBER) from 11–50% to approximately 1.5–3.02%, thereby restoring practical secure key generation. B92 with the Koashi bound achieves secure transmission distance improvements from 181.6 km to 190.8 km without attacks and reaches 187.0 km under hybrid attacks with DPR, slightly exceeding BB84 in certain conditions. Peak secret key rates reach 0.1363 bit/pulse for BB84 and 0.0741 bit/pulse for B92. These findings demonstrate that non-orthogonal protocols can remain competitive under realistic finite-key constraints using practical mitigation techniques, although literature based induced QBER assumptions remain a limitation.

SinkrOn•Apr 2, 2026•0 citations

Quantum random number generators, extraction of provably random bit sequences from Markov chain trajectories

Igor M. Arbekov, S. N. Molotkov

Квантовые генераторы случайных чисел, экстракция доказуемо случайных битовых последовательностей РёР· траекторий цепи Маркова, Арбеков Р

Uspekhi Fizicheskih Nauk•Feb 1, 2024•3 citations
Some quantum key distribution (QKD) technics - BB84, B92 [4], [5] for example - have a gain problem comparing the fnal key to the generated pulses of quantum particles. RUQB [1] technique improves the gain of BB84 by 5.5%, the improvement was achieved by fnding the relationship among the random bits that where initially generated, then exchanging this relationship to aid in recovery of some lost bits. This research permutate the sets that RUQB uses (hence P-RUQB) to have better gain, it was found that about 30% gain can be recovered by using about 8 permutations in ideal situation.
Quantum key distribution (QKD) techniques usually suffer from a gain problem when comparing the final key to the generated pulses of quantum states. This research permutes the sets that RUQB (Abu-ayyash & Ajlouni, 2008) uses in order to increase the gain. The effect of both randomness and permutations are studied; While RUQB technique improves the gain of BB84 QKD by 5.5% it was also shown that the higher the randomness of the initial key the higher the gain that can be achieved, this work concluded that the use of around 7 permutations results in 30% gain recovery in an ideal situations.
Practical quantum key distribution gain is usually less than the theoretical limit, this is due to the imperfection of physical devices, quantum channels, and the lost qubits due to test carried out for for the identification of the presence of an eavesdropper and the consequence reduction of obtained knowledge. In this paper a technique is presented to recover some of the unused qubits which result in an increase in the gain of the QKD protocols, in this research it was found that for the BB84 the recovered qubits can be as much as 11% of the initial key bits. This technique is based on discovering the relationship between the initial key bits and the original random bits which will aid in the recovery process of the unused qubits ( unused qubits are the bits which are assumed to be lost at the start of the process due to the random process and for BB84 it is assumed to be around 50% of the generated key bits).
Abstract Quantum Key Distribution (QKD) stands as a ground breaking approach to secure communication, exploiting the principles of quantum mechanics to achieve theoretically unbreakable encryption. Despite substantial progress, challenges in optimizing key rates and ensuring robustness, particularly in high-loss environments, persist. This research proposes an advanced QKD method that integrates multiple decoy states with optimized intensity levels and pulse probabilities, advanced bit recovery techniques, and adaptive machine learning (ML) filtering to enhance signal-to-noise ratio (SNR). The proposed framework leverages ML-driven adaptive filtering to dynamically reduce noise, thereby improving the accuracy of gain and error rate calculations for decoy states and enhancing the efficiency of bit recovery. The bit recovery process incorporates permutation-based enhancement techniques, optimizing the recovery of unused quantum bits (RUQB). The proposed method is thoroughly evaluated through comparative analysis against leading QKD protocols, including E91, BBM92, B92, Six-state, Decoy State, and DSP protocols. The results demonstrate significant improvements in secure key rates, the percentage of correctly recovered bits, and overall system robustness, especially in challenging conditions. This research contributes to the advancement of QKD by providing a more resilient and efficient approach, addressing key limitations of existing methods, and paving the way for enhanced secure quantum communication systems.
Quantum Key Distribution (QKD) enables theoretically secure key exchange based on fundamental quantum principles such as the no-cloning theorem and Heisenberg’s uncertainty principle. However, practical implementations remain vulnerable to side-channel attacks caused by device imperfections, while many existing studies primarily analyze asymptotic security or isolated attack scenarios rather than realistic finite-key conditions. Unlike prior studies that focus on asymptotic or single-attack analyses, this work presents a comprehensive finite-key security evaluation of BB84 and B92 protocols under hybrid side-channel attacks using Discrete Phase Randomization (DPR) as a lightweight mitigation strategy and the Koashi bound for improved phase-error estimation in B92. Numerical simulations are performed using realistic system parameters with a finite-key size of 100 billion pulses across ten representative attack scenarios. The results show that applying DPR (M = 32) significantly suppresses phase-sensitive attack-induced errors, reducing the quantum bit error rate (QBER) from 11–50% to approximately 1.5–3.02%, thereby restoring practical secure key generation. B92 with the Koashi bound achieves secure transmission distance improvements from 181.6 km to 190.8 km without attacks and reaches 187.0 km under hybrid attacks with DPR, slightly exceeding BB84 in certain conditions. Peak secret key rates reach 0.1363 bit/pulse for BB84 and 0.0741 bit/pulse for B92. These findings demonstrate that non-orthogonal protocols can remain competitive under realistic finite-key constraints using practical mitigation techniques, although literature based induced QBER assumptions remain a limitation.
Квантовые генераторы случайных чисел, экстракция доказуемо случайных битовых последовательностей РёР· траекторий цепи Маркова, Арбеков Р