Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography

Abstract

Extended non-local games are a generalization of monogamy-of-entanglement games, played by two quantum parties and a quantum referee that performs a measurement on their local quantum system. Along the lines of the NPA hierarchy, the optimal winning probability of those games can be upper bounded by a hierarchy of semidefinite programs (SDPs) converging to the optimal value. Here, we show that if one extends such games by considering constraints and loss, motivated by experimental errors and loss through quantum communication, the convergence of the SDPs to the optimal value still holds. We give applications of this result, and we compute SDPs that show tighter security of protocols for relativistic bit commitment, quantum key distribution, and quantum position verification.

References in corpus (25)

• Device-independent security of quantum cryptography against collective attacks
• Random Numbers Certified by Bell's Theorem
• Unconditionally secure quantum bit commitment is impossible
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Non-locality and Communication Complexity
• Is Quantum Bit Commitment Really Possible?
• Bounding the set of quantum correlations
• Self-testing of quantum systems: a review
• Computational power of correlations
• Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities
• Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
• A Monogamy-of-Entanglement Game With Applications to Device-Independent Quantum Cryptography
• Simplified instantaneous non-local quantum computation with applications to position-based cryptography
• Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
• Position-Based Quantum Cryptography: Impossibility and Constructions
• Location-Dependent Communications using Quantum Entanglement
• Insecurity of position-based quantum cryptography protocols against entanglement attacks
• Bounds on Quantum Correlations in Bell Inequality Experiments
• Secure bit commitment from relativistic constraints
• Practical Position-Based Quantum Cryptography
• Extended nonlocal games and monogamy-of-entanglement games
• Practical and unconditionally secure spacetime-constrained oblivious transfer
• Bounds on Instantaneous Nonlocal Quantum Computation
• Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers
• Code-routing: a new attack on position verification