Optimal robust self-testing by binary nonlocal XOR games

DOI10.4230/LIPICS.TQC.2013.254MaRDI QIDQ2958429zbMATH OpenFDO

Authors Carl A. Miller, Yaoyun Shi

Publication date 1 February 2017

Full work available at URL https://doi.org/10.4230/LIPICS.TQC.2013.254

zbMATH Keywords

random number generationquantum cryptographynonlocal gamesself-testing

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Self-testing of Quantum Circuits
• Robust self-testing of the singlet
• Self-testing in parallel
• Generalized self-testing and the security of the 6-state protocol
• Self-testing protocols based on the chained Bell inequalities

Cited in

(12)

• Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
• Parallel self-testing of the GHZ state with a proof by diagrams
• Self-testing of Quantum Circuits
• Self-testing in parallel
• Self-testing protocols based on the chained Bell inequalities
• Device-independent self-testing of unsharp measurements
• Robust self-testing of the singlet
• An operator-algebraic formulation of self-testing
• Quantum cryptography beyond quantum key distribution
• Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
• Self testing quantum apparatus
• Generalized self-testing and the security of the 6-state protocol

This page was built for publication: Optimal robust self-testing by binary nonlocal XOR games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958429)