Answers are grounded in this paper and cite their sources.
We study how one classical message sent after a public basis reveal changes the probability that two separated holders of quantum side information both recover the same complete BB84 outcome string. The model permits arbitrary finite-dimensional prior entanglement and excludes quantum transmission after the split. Communication is charged using a worst-case integer alphabet-cost convention. For every n ≥ 1, the optimal one-message success probability with n−1 bits is exactly cos²(π/8). More generally, message-dependent projector-overlap bounds combine complementary basis pairs with all XOR shifts, recover the established zero-communication endpoint, and yield an integer bounded-error converse. For joint full-string failure below 1−cos²(π/8), the minimum one-message budget remains n bits. The exact perfect-recovery cost under finite-round classical interaction is included as a baseline consequence of established uncertainty and message-accounting tools. The general one-message interior frontier, including the exact (3,1) value, and a general interactive bounded-error extension remain open. No cryptographic security reduction, laboratory implementation or certified semidefinite-program improvement is claimed. This v1.0 preprint preserves the mathematical content of the October 9, 2026 revision and updates its public presentation. An earlier version received external human review recommending major revision; the revised manuscript has not yet been reassessed by that reviewer, and no journal acceptance is claimed. Generative-AI assistance is disclosed in the paper. The supplement provides manuscript source, consistency-check scripts, recorded outputs and reproduction instructions. Those checks do not replace the analytic proofs or constitute independent scientific validation. Copyright © 2026 Jonathan Matthew Chadbourne. The manuscript PDF, LaTeX source, documentation, and result files are licensed under Creative Commons Attribution 4.0 International (CC BY 4.0): https://creativecommons.org/licenses/by/4.0/. The files checks/step1/verify_bounds.py and checks/step2/verify_bounded_error.py in the supplement are licensed under the MIT License: https://opensource.org/license/MIT. Each license applies only to the files specified here.
No takes yet. Share an insight, caveat, or question.
Jonathan chadbourne (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: