01399nas a2200193 4500008004100000245006100041210006000102260007900162300001400241490000700255520072700262653001900989653002501008653002901033653001701062100001701079700001601096856009301112 2013 eng d00aOptimal robust self-testing by binary nonlocal XOR games0 aOptimal robust selftesting by binary nonlocal XOR games bSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing a254–2620 v223 a
Self-testing a quantum apparatus means verifying the existence of a certain quantum state as well as the effect of the associated measuring devices based only on the statistics of the measurement outcomes. Robust (i.e., error-tolerant) self-testing quantum apparatuses are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted devices. We devise a general scheme for proving optimal robust self-testing properties for tests based on nonlocal binary XOR games. We offer some simplified proofs of known results on self-testing, and also prove some new results.
10anonlocal games10aquantum cryptography10aRandom number generation10aSelf-testing1 aMiller, Carl1 aShi, Yaoyun uhttps://quics.umd.edu/publications/optimal-robust-self-testing-binary-nonlocal-xor-games