



@inbook {1863,
	title = {Optimal robust self-testing by binary nonlocal XOR games},
	booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013},
	volume = {22},
	year = {2013},
	pages = {254{\textendash}262},
	publisher = {Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing},
	organization = {Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing},
	abstract = {<p><span style="color: rgb(102, 102, 102); font-family: \&quot;Nexus Sans\&quot;, sans-serif; font-size: 16px;">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.</span></p>},
	keywords = {nonlocal games, quantum cryptography, Random number generation, Self-testing},
	doi = {10.4230/LIPIcs.TQC.2013.254},
	author = {Carl Miller and Yaoyun Shi}
}
