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.
- Computational Power of Correlations. Physical Review Letters, 102(5):050502, February 2009.
- Device-Independent Security of Quantum Cryptography against Collective Attacks. Physical Review Letters, 98(23):230501, June 2007.
- Tomothy Spiller Adrian Kent, William Munro and Raymond Beausoleil. Tagging systems. us patent nr 2006/0022832. 2006.
- Leon Alaoglu. Weak topologies of normed linear spaces. Annals of Mathematics, 41(1):252–267, 1940.
- Quantum cryptography: public key distribution and coin tossing. Proc. IEEE Int. Conf. on Computers, Systems, and Signal Process (Bangalore) (Piscataway, NJ: IEEE), 1984.
- Quantum cryptography without Bell’s theorem. Phys. Rev. Lett., 68:557–559, Feb 1992.
- Rigidity for monogamy-of-entanglement games. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
- Position-based quantum cryptography: Impossibility and constructions. SIAM Journal on Computing, 43(1):150–178, jan 2014.
- Nonlocality and communication complexity. Reviews of Modern Physics, 82(1):665–698, March 2010.
- J. S. Bell. On the einstein podolsky rosen paradox. Physics Physique Fizika, 1:195–200, Nov 1964.
- Simplified instantaneous non-local quantum computation with applications to position-based cryptography. New Journal of Physics, 13(9):093036, sep 2011.
- Position based cryptography. In Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, volume 5677 of Lecture Notes in Computer Science, pages 391–407. Springer, 2009.
- Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23, 1969.
- Consequences and limits of nonlocal strategies, 2004.
- Practical position-based quantum cryptography. Physical Review A, 92(5), nov 2015.
- Code-routing: a new attack on position-verification. arXiv preprint arXiv:2202.07812, 2022.
- Non-local computation of quantum circuits with small light cones. arXiv preprint arXiv:2203.10106, 2022.
- Kfir Dolev. Constraining the doability of relativistic quantum tasks. arXiv preprint arXiv:1909.05403, 2019.
- Llorenç Escolà -Farrà s. https://github.com/llorensescola/LossyAndConstrainedGames.
- Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers. Physical Review Letters, 131(14), October 2023.
- Bounds on instantaneous nonlocal quantum computation. IEEE Transactions on Information Theory, 66(5):2951–2963, 2019.
- Extended non-local games and monogamy-of-entanglement games. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 472(2189):20160003, may 2016.
- Adrian Kent. Unconditionally secure bit commitment by transmitting measurement outcomes. Physical Review Letters, 109(13), September 2012.
- Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints. Physical Review A, 84(1), Jul 2011.
- Secure bit commitment from relativistic constraints. IEEE Transactions on Information Theory, 59(7):4687–4699, July 2013.
- Is quantum bit commitment really possible? Phys. Rev. Lett., 78:3410–3413, Apr 1997.
- Insecurity of position-based quantum-cryptography protocols against entanglement attacks. Physical Review A, 83(1), jan 2011.
- Semidefinite programming and integer programming. In K. Aardal, G.L. Nemhauser, and R. Weismantel, editors, Discrete Optimization, volume 12 of Handbooks in Operations Research and Management Science, pages 393–514. Elsevier, 2005.
- Robert A. Malaney. Location-dependent communications using quantum entanglement. Phys. Rev. A, 81:042319, Apr 2010.
- Dominic Mayers. Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett., 78:3414–3417, Apr 1997.
- Self Testing Quantum Apparatus. Quantum Info. Comput., 4(4):273–286, July 2004.
- Bounding the set of quantum correlations. Phys. Rev. Lett., 98:010401, Jan 2007.
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. New Journal of Physics, 10(7):073013, Jul 2008.
- Random numbers certified by Bell’s theorem. Nature, 464(7291):1021–1024, April 2010.
- Practical and unconditionally secure spacetime-constrained oblivious transfer. Physical Review A, 98(3), September 2018.
- A tight lower bound for the bb84-states quantum-position-verification protocol, 2015.
- Vincent Russo. Extended nonlocal games, 2017.
- Self-testing of quantum systems: a review. arXiv:1904.10042 [quant-ph], April 2019. arXiv: 1904.10042.
- Florian Speelman. Instantaneous non-local computation of low T-depth quantum circuits. In 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016.
- A monogamy-of-entanglement game with applications to device-independent quantum cryptography. New Journal of Physics, 15(10):103002, Oct 2013.
- Stephanie Wehner. Tsirelson bounds for generalized clauser-horne-shimony-holt inequalities. Physical Review A, 73(2), feb 2006.
- A single quantum cannot be cloned. Nature, 299:802–803, 1982.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.