2000 character limit reached
Quantum Conference Key Agreement with Classical Advantage Distillation
Published 31 Mar 2025 in quant-ph | (2503.24318v2)
Abstract: In this work, we prove security of a quantum conference key agreement (QCKA) protocol augmented with a classical advantage distillation (CAD) protocol. We derive a proof of security, in the finite key setting, that is able to bound the secure key rate for any general, coherent, attack. We evaluate the performance of the system, showing our result can improve the noise tolerance of the protocol in some, but not all, scenarios.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.