2000/06/02 by R. Laiho, Laiho, R., S. N. Molotkov +3
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0006010
13 pages, 1 figure
arxiv created 2000/06/02 · openalex publication_date 2000/06/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Relativistic quantum field theory imposes additional fundamental restrictions on the distinguishability of quantum states. Because of the unavoidable delocalization of the quantum field states in the Minkowski space-time, the reliable (with unit probability) distinguishability of orthogonal states formally requires infinite time. For the cryptographic protocols which are finite in time the latter means that the effective ``noise'' is present even in the ideal communication channel because of the non-localizability of the quantum field states.