Limits of adaptive two-way linear postprocessing in six-state quantum key distribution
Abstract
Two-way classical communication improves the noise tolerance of quantum key distribution, but the limits of adaptive parity processing remain unclear. For the six-state protocol with equal three-basis error rate p∈[p*,1/2], where p*=(5−√5)/10≃27.64%, we construct a single compatible collective attack that defeats a broad class of linear postprocessing. Each public message may be a linear function of the sender's raw key, chosen adaptively from the public history. For every finite input length and every accepted transcript of positive probability, Eve's optimal probability of recovering any linear function of Alice's raw key is at least Bob's. Consequently, reliable agreement on a linear final key is incompatible with secrecy. The same conclusion holds for arbitrary publicly seeded privacy amplification after reliable recovery of a linear candidate. The proof conditions on the complete transcript, which restricts the two raw keys to affine subspaces. A local degradation of Eve's state, a known Rényi-entropy comparison, and a coset-probability inequality then give the recovery comparison. Both inequalities are proved in self-contained appendices. The result allows block splitting, regrouping, nonzero-syndrome selection, and adaptive linear reconciliation.
Related
- Rethinking free-space orbital angular momentum quantum key distribution: encoding selection and branch-cut-length-minimized adaptive optics
- Entanglement Distribution in Quantum Switch Networks: Memory Limits and Achievability
- Impact of Data Loss in Postprocessing on Training and Inference of Quantum Neural Networks
- Adaptive sensing beyond non-adaptive information limits: End-to-end co-design of geometry, policy, and inference
- Memory-Induced Limits on Entanglement Distribution
BibTeX
@misc{tsurumaru2026limits,
title = {{Limits of adaptive two-way linear postprocessing in six-state quantum key distribution}},
author = {Toyohiro Tsurumaru},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.21469},
eprint = {2610.21469},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.21469},
}
RIS
TY - UNPB
TI - Limits of adaptive two-way linear postprocessing in six-state quantum key distribution
AU - Toyohiro Tsurumaru
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2610.21469
UR - https://arxiv.org/abs/2610.21469
AB - Two-way classical communication improves the noise tolerance of quantum key distribution, but the limits of adaptive parity processing remain unclear. For the six-state protocol with equal three-basis error rate p∈[p_*,1/2], where p_*=(5−√5)/10≃27.64%, we construct a single compatible collective attack that defeats a broad class of linear postprocessing. Each public message may be a linear function of the sender's raw key, chosen adaptively from the public history. For every finite input length and every accepted transcript of positive probability, Eve's optimal probability of recovering any linear function of Alice's raw key is at least Bob's. Consequently, reliable agreement on a linear final key is incompatible with secrecy. The same conclusion holds for arbitrary publicly seeded privacy amplification after reliable recovery of a linear candidate. The proof conditions on the complete transcript, which restricts the two raw keys to affine subspaces. A local degradation of Eve's state, a known Rényi-entropy comparison, and a coset-probability inequality then give the recovery comparison. Both inequalities are proved in self-contained appendices. The result allows block splitting, regrouping, nonzero-syndrome selection, and adaptive linear reconciliation.
ER -