Curator's Take
AI Commentary
This article sharpens the error tolerance of the BB84 monogamy‑of‑entanglement game, raising the certified noise threshold from roughly 3.7 % to a clean ≈14.64 %, which dramatically widens the practical operating window for protocols that rely on this game. By proving exponential decay under parallel repetition even when players use non‑identical answer strings, the work strengthens security reductions for quantum key distribution, position verification and unclonable encryption. The result dovetails with recent advances in device‑independent cryptography that seek tighter composability guarantees, making it a timely boost to both theory and real‑world implementations.
— Mark Eatherly
Summary
The BB84 monogamy-of-entanglement (MoE) game has numerous applications in quantum cryptography, including quantum key distribution, position verification, and unclonable encryption. In this short note, we improve the error threshold for parallel repetition with identical answer strings from the approximately $3.7\%$ certified by the original bound to the sharp threshold $(1-1/\sqrt2)/2\approx14.64\%$. When the players need not give identical answers, we also obtain exponential decay whenever the sum of their error tolerances is below this threshold. These bounds strengthen existing security reductions to the BB84 MoE game, improving security bounds and certified noise tolerances for cryptographic protocols.