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

Quantum Information Processing

Parameter optimization in decoy-state phase-matching quantum key distribution

Lu Wang, Qin Dong, Rongzhen Jiao

Published Oct 14, 2023• 5 citations
Publisher
DOI
10.1007/s11128-023-04130-x

Related papers

Analysis of three-intensity decoy-state phase-matching quantum key distribution

Ziang Song, Guoqi Huang, Qin Dong +1 more

The European Physical Journal D•Nov 1, 2021•2 citations

Phase-Matched Passive-Decoy-State Quantum Key Distribution Based on Heralded Single Photon Source

虞味 Yu Wei, 周媛媛 Zhou Yuanyuan

Acta Optica Sinica•Jan 1, 2021•1 citation

Parameter optimization in biased decoy-state quantum key distribution with both source errors and statistical fluctuations

Jian-Rong Zhu, Jian Li, Chun-Mei Zhang +1 more

Quantum Information Processing•Aug 17, 2017•9 citations

Parameters Optimization of Decoy-State Phase-Matching Quantum Key Distribution Based on the Nature-Inspired Algorithms

Chang 畅 Liu 刘, Yue 悦 Li 李, Haoyang Wang +4 more

Abstract Phase-matching quantum-key distribution (PM-QKD) has achieved significant results in various practical applications. However, real-time communication requires dynamic adjustment and optimization of key parameters during communication. In this letter, we predict the PM-QKD parameters using nature-inspired algorithms (NIAs). The results are obtained from an exhaustive traversal algorithm (ETA), which serves as a benchmark. We mainly study the parameter optimization effects of the two NIAs: ant colony optimization (ACO) and the genetic algorithm (GA). The configuration of the inherent parameters of these algorithms in the decoy-state PM-QKD is also discussed. The simulation results indicate that the parameters obtained by the ACO exhibit superior convergence and stability, whereas the GA results are relatively scattered. Nevertheless, more than 97% of the key rates predicted by both algorithms are highly consistent with the optimal key rate. Moreover, the relative error of the key rates remained below 10%. Furthermore, NIAs maintain power consumption below 8 W and require three orders of magnitude less computing time than ETA.

Chinese Physics Letters•Dec 9, 2024•3 citations

Phase-Matching Quantum Key Distribution with Discrete Phase Randomization

Xiaoxu Zhang, Yang Wang, Mu-Sheng Jiang +4 more

The twin-field quantum key distribution (TF-QKD) protocol and its variations have been proposed to overcome the linear Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound. One variation called phase-matching QKD (PM-QKD) protocol employs discrete phase randomization and the phase post-compensation technique to improve the key rate quadratically. However, the discrete phase randomization opens a loophole to threaten the actual security. In this paper, we first introduce the unambiguous state discrimination (USD) measurement and the photon-number-splitting (PNS) attack against PM-QKD with imperfect phase randomization. Then, we prove the rigorous security of decoy state PM-QKD with discrete phase randomization. Simulation results show that, considering the intrinsic bit error rate and sifting factor, there is an optimal discrete phase randomization value to guarantee security and performance. Furthermore, as the number of discrete phase randomization increases, the key rate of adopting vacuum and one decoy state approaches infinite decoy states, the key rate between discrete phase randomization and continuous phase randomization is almost the same.

Entropy•Apr 23, 2021•5 citations

Estimation of decoy state parameters for practical quantum key distribution

Sellami Ali

•Jan 1, 2010•1 citation
Abstract Phase-matching quantum-key distribution (PM-QKD) has achieved significant results in various practical applications. However, real-time communication requires dynamic adjustment and optimization of key parameters during communication. In this letter, we predict the PM-QKD parameters using nature-inspired algorithms (NIAs). The results are obtained from an exhaustive traversal algorithm (ETA), which serves as a benchmark. We mainly study the parameter optimization effects of the two NIAs: ant colony optimization (ACO) and the genetic algorithm (GA). The configuration of the inherent parameters of these algorithms in the decoy-state PM-QKD is also discussed. The simulation results indicate that the parameters obtained by the ACO exhibit superior convergence and stability, whereas the GA results are relatively scattered. Nevertheless, more than 97% of the key rates predicted by both algorithms are highly consistent with the optimal key rate. Moreover, the relative error of the key rates remained below 10%. Furthermore, NIAs maintain power consumption below 8 W and require three orders of magnitude less computing time than ETA.
The twin-field quantum key distribution (TF-QKD) protocol and its variations have been proposed to overcome the linear Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound. One variation called phase-matching QKD (PM-QKD) protocol employs discrete phase randomization and the phase post-compensation technique to improve the key rate quadratically. However, the discrete phase randomization opens a loophole to threaten the actual security. In this paper, we first introduce the unambiguous state discrimination (USD) measurement and the photon-number-splitting (PNS) attack against PM-QKD with imperfect phase randomization. Then, we prove the rigorous security of decoy state PM-QKD with discrete phase randomization. Simulation results show that, considering the intrinsic bit error rate and sifting factor, there is an optimal discrete phase randomization value to guarantee security and performance. Furthermore, as the number of discrete phase randomization increases, the key rate of adopting vacuum and one decoy state approaches infinite decoy states, the key rate between discrete phase randomization and continuous phase randomization is almost the same.