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

Twin-field quantum key distribution based on particle swarm optimization algorithm

Chang Liu, Yue Li, Haoyang Wang, Kaiyi Shi, ZhongQi Sun, Jiaao Li, Yujia Zhang, Duo Ma, Haiqiang Ma

Published Feb 17, 2025• 5 citations
Publisher
DOI
10.1007/s11128-025-04681-1

Related papers

Machine learning with neural networks for parameter optimization in twin-field quantum key distribution

Jia-Le Kang, Minghui Zhang, Xiaopeng Liu +1 more

Quantum Information Processing•Aug 16, 2023•8 citations

Free-space twin-field quantum key distribution

Yuhuai Li, Ting Zeng, Min-Yan Wang +22 more

arXiv:2503.17744•Nature Photonics•May 19, 2026•2 citations

AI-Assisted Polarization Basis Alignment for Quantum Key Distribution System Receivers

Sara T. Mantey, Nuno A. Silva, Armando N. Pinto +1 more

In this work, we propose and experimentally validate a polarization basis alignment method based on a hybrid approach, using the Particle Swarm Optimization (PSO) and a gradient search algorithm. This method uses the Quantum Bit Error Ratio (QBER) as metric to be minimized. At first, the PSO runs one iteration to perform a coarse basis alignment, followed by the gradient search algorithm which performs a fine basis alignment, until the QBER is below the threshold. The polarization basis alignment method here proposed is implemented and tested at the receiver of a Quantum Key Distribution (QKD) system testbed. With this proposed hybrid basis alignment approach, a QBER below 1% can be achieved after, on average, nineteen QBER estimations, when using five particles for the PSO. These nineteen QBER estimations represent a 24% improvement regarding the method mostly used in the state of the art which.

International Conference on Transparent Optical Networks•Jul 2, 2023•0 citations

A Hybrid Quantum Key Distribution Algorithm Integrating BB84 and Twin-Field QKD for Enhanced Security and Efficiency

Yahia Hasan Jazyah

Quantum Key Distribution (QKD) represents a revolutionary advancement in secure communication. It leverages principles of quantum mechanics to establish cryptographic keys between parties with theoretically unbreakable security. Among the various QKD protocols, BB84 (Bennett and Brassard, 1984) and Twin-Field QKD are prominent due to their foundational simplicity and advanced key generation efficiency, respectively. The BB84 protocol, as the first QKD protocol, uses quantum bits (qubits) in different bases to securely generate shared keys, while Twin-Field QKD enhances the key generation rate by exploiting quantum interference between distant entangled states, making it more suitable for long-distance communication. This work explores the integration of BB84 and Twin-Field QKD into a hybrid algorithm, aiming at combining the robustness of BB84 with the high key generation rate and entropy of Twin-Field QKD. The hybrid algorithm alternates between the two protocols, leveraging their individual strengths to optimize key generation performance. Simulation results indicate that the hybrid algorithm can effectively balance the robustness and simplicity of BB84 with the high efficiency and entropy of Twin-Field QKD. Specifically, the hybrid algorithm demonstrated an error rate of 8.9%, a key generation rate of 50%, and an entropy of 0.999 bits, which outperforms the compared algorithms.

WSEAS TRANSACTIONS ON COMPUTER RESEARCH•Sep 24, 2026•0 citations

Tight finite-key security for twin-field quantum key distribution

Currás Lorenzo, G, Navarrete, A, Azuma, K +3 more

•Feb 5, 2021•14 citations

Highly efficient twin-field quantum key distribution with neural networks

Jing-Yang Liu, Qingqing Jiang, Hua-Jian Ding +9 more

Science China Information Sciences•Jul 13, 2023•20 citations
In this work, we propose and experimentally validate a polarization basis alignment method based on a hybrid approach, using the Particle Swarm Optimization (PSO) and a gradient search algorithm. This method uses the Quantum Bit Error Ratio (QBER) as metric to be minimized. At first, the PSO runs one iteration to perform a coarse basis alignment, followed by the gradient search algorithm which performs a fine basis alignment, until the QBER is below the threshold. The polarization basis alignment method here proposed is implemented and tested at the receiver of a Quantum Key Distribution (QKD) system testbed. With this proposed hybrid basis alignment approach, a QBER below 1% can be achieved after, on average, nineteen QBER estimations, when using five particles for the PSO. These nineteen QBER estimations represent a 24% improvement regarding the method mostly used in the state of the art which.
Quantum Key Distribution (QKD) represents a revolutionary advancement in secure communication. It leverages principles of quantum mechanics to establish cryptographic keys between parties with theoretically unbreakable security. Among the various QKD protocols, BB84 (Bennett and Brassard, 1984) and Twin-Field QKD are prominent due to their foundational simplicity and advanced key generation efficiency, respectively. The BB84 protocol, as the first QKD protocol, uses quantum bits (qubits) in different bases to securely generate shared keys, while Twin-Field QKD enhances the key generation rate by exploiting quantum interference between distant entangled states, making it more suitable for long-distance communication. This work explores the integration of BB84 and Twin-Field QKD into a hybrid algorithm, aiming at combining the robustness of BB84 with the high key generation rate and entropy of Twin-Field QKD. The hybrid algorithm alternates between the two protocols, leveraging their individual strengths to optimize key generation performance. Simulation results indicate that the hybrid algorithm can effectively balance the robustness and simplicity of BB84 with the high efficiency and entropy of Twin-Field QKD. Specifically, the hybrid algorithm demonstrated an error rate of 8.9%, a key generation rate of 50%, and an entropy of 0.999 bits, which outperforms the compared algorithms.