2012/07/07 by Carl A. Miller, Yaoyun Shi, Miller, Carl A. +1 · 2 citations
Computer Science · Physics and Astronomy · #Cryptography and Data Security #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.1207.1819
5 pages, plus 29 pages of supporting material. v4: fixed typo in abstract
openalex publication_date 2012/07/07 · arxiv created 2013/06/04 · arxiv updated 2013/06/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Self-testing a quantum device means verifying the existence of a certain quantum state as well as the effect of the associated measurements based only on the statistics of the measurement outcomes. Robust, i.e., error-tolerant, self-testing quantum devices are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted quantum devices. We give a criterion which determines whether a given binary XOR game is robust self-testing with the asymptotically optimal error parameter. As an application, we prove that the celebrated CHSH game is an optimally robust self-test. We also prove the same for a family of tests recently proposed by Acin et al. (PRL 108:100402, 2012) for random number generation, thus extending the benefit of the latter tests to allow imperfect or untrusted quantum devices.