Optimal Protocols and Tradeoffs in Quantum Key Distribution
Joseph M. Renes · AIP conference proceedings · 2004
Quantum key distribution protocols based on equiangular spherical codes are introduced and a security comparison made to random and unbiased‐bases schemes in two and three dimensions. Attention is limited to intercept/resend attacks for simplicity. In each case, a general tradeoff between eavesdropper resistance and key generation speed is observed, with the largest possible spherical code found to be the most robust, inviting the question of their optimality in general.