2010/03/04 by Robert Malaney, Robert A. Malaney · 2 citations
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Adversary #Channel (broadcasting) #Computer network #Computer science #Computer security #Distributed computing #Engineering #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum information science #Quantum mechanics #Range (aeronautics) #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.81.042319
published as Phys. Rev. A 81, 042319 (2010) · 11 pages, 1 figure
arxiv created 2010/03/04 · openalex publication_date 2010/04/23 · arxiv updated 2010/04/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The ability to unconditionally verify the location of a communication receiver would lead to a wide range of new security paradigms. However, it is known that unconditional location verification in classical communication systems is impossible. In this work we show how unconditional location verification can be achieved with the use of quantum communication channels. Our verification remains unconditional irrespective of the number of receivers, computational capacity, or any other physical resource held by an adversary. Quantum location verification represents an application of quantum entanglement that delivers a feat not possible in the classical-only channel. It gives us the ability to deliver real-time communications viable only at specified geographical coordinates.