2012/10/31 by Eric G. Cavalcanti, Michael J. W. Hall, Howard M. Wiseman · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Alice and Bob #Computer science #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum cryptography #Quantum entanglement #Quantum information #Quantum information science #Quantum mechanics #Quantum nonlocality #Randomness #Theoretical computer science #quant-ph
paper · pdf · doi:10.1103/physreva.87.032306
published as Phys. Rev. A 87, 032306 (2013) · 9 pages, 1 figure
openalex publication_date 2013/03/06 · arxiv created 2013/03/14 · arxiv updated 2015/03/12 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
Various protocols exist by which a referee can be convinced that two observers share an entangled resource. Such protocols typically specify the types of communication allowed, and the degrees of trust required, between the referee and each observer. Here it is shown that the need for any degree of trust of the observers by the referee can be completely removed via the referee using classical and quantum communication channels appropriately. In particular, trust-free verification of Bell nonlocality, Einstein-Podolsky-Rosen steering, and entanglement, respectively, requires two classical channels, one classical and one quantum channel, and two quantum channels. These channels correspond to suitable inputs of quantum randomness by the referee, which prevent the observers from mimicking entanglement using shared classical randomness. Our results generalize recent work by Buscemi [Phys. Rev. Lett. 108, 200401 (2012)], and offer a perspective on the operational significance of that work. They also offer the possibility of simpler experimental demonstrations of the basic idea of quantum-refereed nonlocality tests.