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

Pratical Random Number Generation Protocol for Active-Basis Choice Quantum Key Distribution

GUILHERME BARRETO XAVIER, T. Ferreira da Silva, G. Vilela de Faria, Guilherme P. Temporão, Jean Pierre von der Weid

Published Oct 2, 2008• 3 citations
OpenAlex

Related papers

Practical random number generation protocol for entanglement-based quantum key distribution

GUILHERME BARRETO XAVIER, Thiago Ferreira da Silva, G. Vilela de Faria +2 more

A simple protocol which takes advantage of the inherent random times of detections in single photon counting modules is presented for random active basis choices when using entanglement-based protocols for Quantum Key Distribution (QKD). It may also be applicable to the BB84 protocol in certain cases. The scheme presented uses the single photon detectors already present on a QKD setup, working on the same rate as the system is capable of detecting, and is, therefore, not limited by the output rates of quantum random number generators. This protocol only requires small hardware modifications making it an attractive solution. We perform a proof-of-principle experiment employing a spontaneous parametric down-conversion process in a $\chi^{(2)}$ non-linear crystal to demonstrate the feasibility of our scheme, and show that the generated sequence passes randomness tests.

arXiv:0810.0483•Quantum Information and Computation•Jul 1, 2009•1 citation

Finite-key security analysis of the decoy-state BB84 QKD with passive measurement

Akihiro Mizutani, Shun Kawakami, Go Kato

The decoy-state Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passiveand active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.

quant-pharXiv:2511.21253•Quantum Science and Technology•Nov 27, 2025•2 citations

New Probabilistic Quantum Key Distribution Protocol

Chun‐Wei Yang

International Journal of Theoretical Physics•Sep 3, 2018•9 citations

Quantum Key Distribution Protocols and Applications

Sheila Cobourne

•Jan 1, 2011•16 citations

Security of passive entanglement-based key distribution protocols

Shun Kawakami, Koichi Takasugi, Koji Azuma

Entanglement-based key distribution protocols, such as the Bennett-Brassard-Mermin 1992 (BBM92) protocol and quantum conference key agreement (QCKA), are promising applications of quantum networks. In practical implementations, passive measurement setups are widely adopted because of their simplicity. However, the security analysis of passive protocols with biased basis choice is highly nontrivial, since standard proof techniques for threshold detectors are generally not applicable in this setting. In this work, we establish the security of passive entanglement-based key distribution protocols in the asymptotic regime. Specifically, we prove the security of passive BBM92 with biased basis choice and extend the proof to passive QCKA with an arbitrary number of parties. In addition, we numerically show that the key generation rate of passive BBM92 is almost identical to that of the corresponding active protocol. Our results provide a theoretical foundation for practical passive implementations of entanglement-based key distribution protocols.

quant-pharXiv:2607.10659•Jul 14, 2026•0 citations

Quantum key distribution protocols with slow basis choice

Toshihiko Sasaki, Kiyoshi Tamaki, Masato Koashi

Many quantum key distribution (QKD) protocols require random choice of measurement basis for each pulse or each train of pulses. In some QKD protocols, such as the Round-Robin Differential Phase Shift (RRDPS) QKD protocol, this requirement is a bit challenging as randomly choosing hundreds of settings for every, say, 100 pulses may be too fast with current technologies. In this paper, we solve this issue by proving the security of QKD protocols with slow basis choice without compromising the secret key rate. We also show that the random choice of the bases for the state preparation can be made slow if the signals do not leak any information on the basis. Examples of QKD protocols that our technique can apply include the RRDPS protocol and BB84-type protocols, and our technique relaxes demands for the implementation of QKD systems.

arXiv:1604.04460•Apr 15, 2016•2 citations
A simple protocol which takes advantage of the inherent random times of detections in single photon counting modules is presented for random active basis choices when using entanglement-based protocols for Quantum Key Distribution (QKD). It may also be applicable to the BB84 protocol in certain cases. The scheme presented uses the single photon detectors already present on a QKD setup, working on the same rate as the system is capable of detecting, and is, therefore, not limited by the output rates of quantum random number generators. This protocol only requires small hardware modifications making it an attractive solution. We perform a proof-of-principle experiment employing a spontaneous parametric down-conversion process in a χ(2)\chi^{(2)}χ(2) non-linear crystal to demonstrate the feasibility of our scheme, and show that the generated sequence passes randomness tests.
The decoy-state Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passiveand active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.
Entanglement-based key distribution protocols, such as the Bennett-Brassard-Mermin 1992 (BBM92) protocol and quantum conference key agreement (QCKA), are promising applications of quantum networks. In practical implementations, passive measurement setups are widely adopted because of their simplicity. However, the security analysis of passive protocols with biased basis choice is highly nontrivial, since standard proof techniques for threshold detectors are generally not applicable in this setting. In this work, we establish the security of passive entanglement-based key distribution protocols in the asymptotic regime. Specifically, we prove the security of passive BBM92 with biased basis choice and extend the proof to passive QCKA with an arbitrary number of parties. In addition, we numerically show that the key generation rate of passive BBM92 is almost identical to that of the corresponding active protocol. Our results provide a theoretical foundation for practical passive implementations of entanglement-based key distribution protocols.
Many quantum key distribution (QKD) protocols require random choice of measurement basis for each pulse or each train of pulses. In some QKD protocols, such as the Round-Robin Differential Phase Shift (RRDPS) QKD protocol, this requirement is a bit challenging as randomly choosing hundreds of settings for every, say, 100 pulses may be too fast with current technologies. In this paper, we solve this issue by proving the security of QKD protocols with slow basis choice without compromising the secret key rate. We also show that the random choice of the bases for the state preparation can be made slow if the signals do not leak any information on the basis. Examples of QKD protocols that our technique can apply include the RRDPS protocol and BB84-type protocols, and our technique relaxes demands for the implementation of QKD systems.