2003/10/31 by Dagomir Kaszlikowski, Ajay Gopinathan, Yeong-Cherng Liang +4 · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physreva.70.032306
published as Physical Review A, vol. 70, art. 032306 (5 pages) (2004) · 4 pages, 4 figures. No substantial changes. Updated version as published in PRA
arxiv created 2004/09/06 · openalex publication_date 2004/09/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We find that the generally accepted security criteria are flawed for a whole class of protocols for quantum cryptography. This is so because a standard assumption of the security analysis, namely that the so-called square-root measurement is optimal for eavesdropping purposes, is not true in general. There are rather large parameter regimes in which the optimal measurement extracts substantially more information than the square-root measurement.