arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.08714quant-ph

带有限密钥长度分析的改进型DIQKD协议

Improved DIQKD protocols with finite-size analysis

Ernest Y. -Z. Tan, Pavel Sekatski, Jean-Daniel Bancal, René Schwonnek, Renato Renner, Nicolas Sangouard, Charles C. -W. Lim

AI总结:

针对现有有限密钥长度DIQKD安全性证明无法覆盖改进型协议的问题,提出通用紧界证明框架与渐近密钥率计算方法,将去极化噪声容忍阈值提升至9.33%,还通过预共享种子改进随机密钥测量协议,大幅提高净密钥生成速率。

摘要:

有限长度密钥的安全性是设备无关量子密钥分发(DIQKD)落地的核心前提。目前已有多种有限密钥长度下的DIQKD安全性证明,但大多针对标准DIQKD协议,无法直接应用于近年提出的改进型协议——这类协议基于噪声预处理、随机密钥测量与修正CHSH不等式实现。本文提出了一种通用的有限密钥长度安全性证明框架,可同时覆盖上述三类改进方案,且采用了比过往分析更紧的有限密钥长度界。在此过程中,我们提出了一种计算方法,可对任意具有二元输入与二元输出的此类DIQKD协议,给出其渐近密钥率的紧下界。借助该方法,我们证明当去极化噪声值最高达9.33%时,仍可实现正的渐近密钥率,超过了此前已知的所有噪声阈值。此外,我们对随机密钥测量协议进行了改进:引入预共享种子及后续的“种子恢复”步骤,通过基本消除筛选因子,大幅提升了净密钥生成速率。本文部分结果也可用于提升设备无关随机性扩展的密钥率。

英文摘要:

The security of finite-length keys is essential for the implementation of device-independent quantum key distribution (DIQKD). Presently, there are several finite-size DIQKD security proofs, but they are mostly focused on standard DIQKD protocols and do not directly apply to the recent improved DIQKD protocols based on noisy preprocessing, random key measurements, and modified CHSH inequalities. Here, we provide a general finite-size security proof that can simultaneously encompass these approaches, using tighter finite-size bounds than previous analyses. In doing so, we develop a method to compute tight lower bounds on the asymptotic keyrate for any such DIQKD protocol with binary inputs and outputs. With this, we show that positive asymptotic keyrates are achievable up to depolarizing noise values of $9.33\%$, exceeding all previously known noise thresholds. We also develop a modification to random-key-measurement protocols, using a pre-shared seed followed by a "seed recovery" step, which yields substantially higher net key generation rates by essentially removing the sifting factor. Some of our results may also improve the keyrates of device-independent randomness expansion.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑