Optimal Robust Self-Testing by Binary Nonlocal XOR Games

Authors Carl A. Miller, Yaoyun Shi

Thumbnail PDF


  • Filesize: 400 kB
  • 9 pages

Document Identifiers

Author Details

Carl A. Miller
Yaoyun Shi

Cite AsGet BibTex

Carl A. Miller and Yaoyun Shi. Optimal Robust Self-Testing by Binary Nonlocal XOR Games. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 254-262, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


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.
  • self-testing
  • quantum cryptography
  • random number generation
  • nonlocal games


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail