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

Improved one-way rates for BB84 and 6-State Protocols

Kern, Oliver, Joseph M. Renes

Published Sep 1, 2008• 0 citations
OpenAlex

Related papers

A Note on Four-State BB84 Protocol.

Arpita Maitra, Goutam Paul

•Jan 1, 2011•0 citations

Improved one-way rates for BB84 and 6-state protocols

O. Kern, Joseph M. Renes

We study the advantages to be gained in quantum key distribution (QKD) protocols by combining the techniques of local randomization, or noisy preprocessing, and structured (nonrandom) block codes. Extending the results of [Smith, Renes, and Smolin, {\em Physical Review Letters}, 100:170502] pertaining to BB84, we improve the best-known lower bound on the error rate for the 6-state protocol from 14.11% for local randomization alone to at least 14.59%. Additionally, we also study the effects of iterating the combined preprocessing scheme and find further improvements to the BB84 protocol already at small block lengths.

arXiv:0712.1494•Quantum Information and Computation•Sep 1, 2008•15 citations

Performance of two quantum-key-distribution protocols

Chi‐Hang Fred Fung, Kiyoshi Tamaki, Hoi‐Kwong Lo

We compare the performance of Bennett-Brassard 1984 (BB84) and Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocols, the latter of which was proposed by V. Scarani et al. [Phys. Rev. Lett. 92, 057901 (2004)]. Specifically, in this paper, we investigate the SARG04 protocol with two-way classical communications and the SARG04 protocol with decoy states. In the first part of the paper, we show that the SARG04 scheme with two-way communications can tolerate a higher bit error rate (19.4% for a one-photon source and 6.56% for a two-photon source) than the SARG04 one with one-way communications (10.95% for a one-photon source and 2.71% for a two-photon source). Also, the upper bounds on the bit error rate for the SARG04 protocol with two-way communications are computed in a closed form by considering an individual attack based on a general measurement. In the second part of the paper, we propose employing the idea of decoy states in the SARG04 scheme to obtain unconditional security even when realistic devices are used. We compare the performance of the SARG04 protocol with decoy states and the BB84 one with decoy states. We find that the optimal mean-photon number for the SARG04 scheme is higher than that of the BB84 one when the bit error rate is small. Also, we observe that the SARG04 protocol does not achieve a longer secure distance and a higher key generation rate than the BB84 one, assuming a typical experimental parameter set.

arXiv:quant-ph/0510025•Physical Review A•Jan 25, 2006•112 citations

Key rate Available from Incompatible Mesurements in the BB84 Protocol and the Uncertainty Principle

Ryutaroh Matsumoto, Shun Watanabe

IEICE Technical Report; IEICE Tech. Rep.•Jan 10, 2008•0 citations

Better codes for BB84 with one-way post-processing

Smith, G, Joseph M. Renes, John A. Smolin

We study achievable secret key rates for the Bennett-Brassard-84 (BB84) quantum key distribution protocol with one way classical post-processing. Specifically, we characterize the performance of a family of error correcting codes when used in the information reconciliation phase of BB84. When combined with noisy processing, these codes allow secure key to be established for quantum bit error rates up to 0.129. This improvement over the previous best noise threshold of 0.124 illustrates, in contrast to the classical scenario, a marked advantage of structured codes over random codes when used for quantum key distribution. Our results are intimately connected to degenerate quantum codes, which we briefly discuss.

•Jul 3, 2006•2 citations

A proposal of authentication method for BB84 protocol

Ohta Fumio, Hisayoshi SATO, Takaragi Kazuo

IEICE Technical Report; IEICE Tech. Rep.•Mar 10, 2006•0 citations
We study the advantages to be gained in quantum key distribution (QKD) protocols by combining the techniques of local randomization, or noisy preprocessing, and structured (nonrandom) block codes. Extending the results of [Smith, Renes, and Smolin, {\em Physical Review Letters}, 100:170502] pertaining to BB84, we improve the best-known lower bound on the error rate for the 6-state protocol from 14.11% for local randomization alone to at least 14.59%. Additionally, we also study the effects of iterating the combined preprocessing scheme and find further improvements to the BB84 protocol already at small block lengths.
We compare the performance of Bennett-Brassard 1984 (BB84) and Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocols, the latter of which was proposed by V. Scarani et al. [Phys. Rev. Lett. 92, 057901 (2004)]. Specifically, in this paper, we investigate the SARG04 protocol with two-way classical communications and the SARG04 protocol with decoy states. In the first part of the paper, we show that the SARG04 scheme with two-way communications can tolerate a higher bit error rate (19.4% for a one-photon source and 6.56% for a two-photon source) than the SARG04 one with one-way communications (10.95% for a one-photon source and 2.71% for a two-photon source). Also, the upper bounds on the bit error rate for the SARG04 protocol with two-way communications are computed in a closed form by considering an individual attack based on a general measurement. In the second part of the paper, we propose employing the idea of decoy states in the SARG04 scheme to obtain unconditional security even when realistic devices are used. We compare the performance of the SARG04 protocol with decoy states and the BB84 one with decoy states. We find that the optimal mean-photon number for the SARG04 scheme is higher than that of the BB84 one when the bit error rate is small. Also, we observe that the SARG04 protocol does not achieve a longer secure distance and a higher key generation rate than the BB84 one, assuming a typical experimental parameter set.
We study achievable secret key rates for the Bennett-Brassard-84 (BB84) quantum key distribution protocol with one way classical post-processing. Specifically, we characterize the performance of a family of error correcting codes when used in the information reconciliation phase of BB84. When combined with noisy processing, these codes allow secure key to be established for quantum bit error rates up to 0.129. This improvement over the previous best noise threshold of 0.124 illustrates, in contrast to the classical scenario, a marked advantage of structured codes over random codes when used for quantum key distribution. Our results are intimately connected to degenerate quantum codes, which we briefly discuss.