Document Open Access Logo

A Quantum Cloning Game with Applications to Quantum Position Verification

Authors Léo Colisson Palais , Llorenç Escolà-Farràs , Florian Speelman

PDF

File

Thumbnail PDF
PDF
LIPIcs.TQC.2025.2.pdf
  • Filesize: 1.09 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Security and privacy → Cryptography
Keywords
  • Quantum position verification
  • cloning game
  • random oracle
  • parallel repetition

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We introduce a quantum cloning game in which k separate collaborative parties receive a classical input, determining which of them has to share a maximally entangled state with an additional party (referee). We provide the optimal winning probability of such a game for every number of parties k, and show that it decays exponentially when the game is played n times in parallel. These results have applications to quantum cryptography, in particular in the topic of quantum position verification, where we show security of the routing protocol (played in parallel), and a variant of it, in the random oracle model.

Cite As Get BibTex

Léo Colisson Palais, Llorenç Escolà-Farràs, and Florian Speelman. A Quantum Cloning Game with Applications to Quantum Position Verification. In 20th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 350, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.TQC.2025.2

Author Details

Léo Colisson Palais
  • Laboratoire Jean Kuntzmann, Université Grenoble Alpes, France
Llorenç Escolà-Farràs
  • TU Eindhoven, The Netherlands
Florian Speelman
  • QuSoft & Informatics Institute, University of Amsterdam, The Netherlands

Funding

  • Colisson Palais, Léo: European Union (ERC, ASC-Q, 101040624) and the Dutch Ministry of Economic Affairs and Climate Policy (EZK), as part of the Quantum Delta NL programme.
  • Escolà-Farràs, Llorenç: Dutch Ministry of Economic Affairs and Climate Policy (EZK), as part of the Quantum Delta NL programme.
  • Speelman, Florian: Dutch Ministry of Economic Affairs and Climate Policy (EZK), as part of the Quantum Delta NL programme.

References

  1. Antonio Acín, Nicolas Brunner, Nicolas Gisin, Serge Massar, Stefano Pironio, and Valerio Scarani. Device-Independent Security of Quantum Cryptography against Collective Attacks. Physical Review Letters, 98(23):230501, June 2007. URL: https://doi.org/10.1103/PhysRevLett.98.230501.
  2. Tomothy Spiller Adrian Kent, William Munro and Raymond Beausoleil. Tagging systems. us patent nr 2006/0022832, 2006. Google Scholar
  3. Rene Allerstorfer, Harry Buhrman, Alex May, Florian Speelman, and Philip Verduyn Lunel. Relating non-local quantum computation to information theoretic cryptography. Quantum, 8:1387, June 2024. URL: https://doi.org/10.22331/q-2024-06-27-1387.
  4. Rene Allerstorfer, Harry Buhrman, Florian Speelman, and Philip Verduyn Lunel. On the role of quantum communication and loss in attacks on quantum position verification, 2022. URL: https://arxiv.org/abs/2208.04341.
  5. Janet Anders and Dan E. Browne. Computational Power of Correlations. Physical Review Letters, 102(5):050502, February 2009. URL: https://doi.org/10.1103/PhysRevLett.102.050502.
  6. Vahid Asadi, Richard Cleve, Eric Culf, and Alex May. Linear gate bounds against natural functions for position-verification, 2024. URL: https://doi.org/10.22331/q-2025-01-21-1604.
  7. Vahid Asadi, Eric Culf, and Alex May. Rank lower bounds on non-local quantum computation. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1-11:18, 2025. URL: https://doi.org/10.4230/LIPIcs.ITCS.2025.11.
  8. Salman Beigi and Robert König. Simplified instantaneous non-local quantum computation with applications to position-based cryptography. New Journal of Physics, 13(9):093036, September 2011. URL: https://doi.org/10.1088/1367-2630/13/9/093036.
  9. J. S. Bell. On the einstein podolsky rosen paradox. Physics Physique Fizika, 1:195-200, November 1964. URL: https://doi.org/10.1103/PhysicsPhysiqueFizika.1.195.
  10. Charles H. Bennett and Gilles Brassard. Quantum cryptography: public key distribution and coin tossing. Proc. IEEE Int. Conf. on Computers, Systems, and Signal Process (Bangalore) (Piscataway, NJ: IEEE), 1984. Google Scholar
  11. Andreas Bluhm, Matthias Christandl, and Florian Speelman. A single-qubit position verification protocol that is secure against multi-qubit attacks. Nature Physics, pages 1-4, 2022. Google Scholar
  12. Nicolas Brunner, Daniel Cavalcanti, Stefano Pironio, Valerio Scarani, and Stephanie Wehner. Bell nonlocality. Rev. Mod. Phys., 86:419-478, April 2014. URL: https://doi.org/10.1103/RevModPhys.86.419.
  13. Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, and Christian Schaffner. Position-based quantum cryptography: Impossibility and constructions. SIAM Journal on Computing, 43(1):150-178, January 2014. URL: https://doi.org/10.1137/130913687.
  14. Harry Buhrman, Richard Cleve, Serge Massar, and Ronald de Wolf. Nonlocality and communication complexity. Reviews of Modern Physics, 82(1):665-698, March 2010. URL: https://doi.org/10.1103/RevModPhys.82.665.
  15. Harry Buhrman, Serge Fehr, Christian Schaffner, and Florian Speelman. The garden-hose model. In Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13. ACM Press, 2013. URL: https://doi.org/10.1145/2422436.2422455.
  16. Kaushik Chakraborty and Anthony Leverrier. Practical position-based quantum cryptography. Physical Review A, 92(5), November 2015. URL: https://doi.org/10.1103/physreva.92.052304.
  17. Nishanth Chandran, Vipul Goyal, Ryan Moriarty, and Rafail Ostrovsky. 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. URL: https://doi.org/10.1007/978-3-642-03356-8_23.
  18. John F. Clauser, Michael A. Horne, Abner Shimony, and Richard A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23, 1969. Google Scholar
  19. Valerie Coffman, Joydip Kundu, and William K. Wootters. Distributed entanglement. Physical Review A, 61(5), April 2000. URL: https://doi.org/10.1103/physreva.61.052306.
  20. Sam Cree and Alex May. Code-routing: a new attack on position-verification. Quantum, 7, 1079, 2022. URL: https://doi.org/10.22331/q-2023-08-09-1079.
  21. Kfir Dolev. Constraining the doability of relativistic quantum tasks. arXiv preprint, 2019. URL: https://arxiv.org/abs/1909.05403.
  22. Kfir Dolev and Sam Cree. Non-local computation of quantum circuits with small light cones. arXiv preprint, 2022. URL: https://arxiv.org/abs/2203.10106.
  23. W. Dür, G. Vidal, and J. I. Cirac. Three qubits can be entangled in two inequivalent ways. Phys. Rev. A, 62:062314, November 2000. URL: https://doi.org/10.1103/PhysRevA.62.062314.
  24. Fei Gao, Bin Liu, and QiaoYan Wen. Quantum position verification in bounded-attack-frequency model. SCIENCE CHINA Physics, Mechanics & Astronomy, 59(11):1-11, 2016. Google Scholar
  25. Alvin Gonzales and Eric Chitambar. Bounds on instantaneous nonlocal quantum computation. IEEE Transactions on Information Theory, 66(5):2951-2963, 2019. Google Scholar
  26. Daniel M. Greenberger, Michael A. Horne, and Anton Zeilinger. Going beyond bell’s theorem. In Menas Kafatos, editor, Bell’s Theorem, Quantum Theory and Conceptions of the Universe, pages 69-72. Springer Netherlands, Dordrecht, 1989. URL: https://doi.org/10.1007/978-94-017-0849-4_10.
  27. Nathaniel Johnston, Rajat Mittal, Vincent Russo, and John Watrous. 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. URL: https://doi.org/10.1098/rspa.2016.0003.
  28. Adrian Kent, William J. Munro, and Timothy P. Spiller. Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints. Physical Review A, 84(1), July 2011. URL: https://doi.org/10.1103/physreva.84.012326.
  29. Hoi-Kwan Lau and Hoi-Kwong Lo. Insecurity of position-based quantum-cryptography protocols against entanglement attacks. Physical Review A, 83(1), January 2011. URL: https://doi.org/10.1103/physreva.83.012322.
  30. Jiahui Liu, Qipeng Liu, and Luowen Qian. Beating Classical Impossibility of Position Verification. In Mark Braverman, editor, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), volume 215 of Leibniz International Proceedings in Informatics (LIPIcs), pages 100:1-100:11, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ITCS.2022.100.
  31. Robert A. Malaney. Location-dependent communications using quantum entanglement. Phys. Rev. A, 81:042319, April 2010. URL: https://doi.org/10.1103/PhysRevA.81.042319.
  32. Dominic Mayers and Andrew Yao. Self Testing Quantum Apparatus. Quantum Info. Comput., 4(4):273-286, July 2004. URL: http://dl.acm.org/citation.cfm?id=2011827.2011830.
  33. S. Pironio, A. Acín, S. Massar, A. Boyer de la Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe. Random numbers certified by Bell’s theorem. Nature, 464(7291):1021-1024, April 2010. URL: https://doi.org/10.1038/nature09008.
  34. Jérémy Ribeiro and Frédéric Grosshans. A tight lower bound for the bb84-states quantum-position-verification protocol, 2015. URL: https://doi.org/10.48550/arXiv.1504.07171.
  35. Christian Schaffner. Cryptography in the bounded-quantum-storage model, 2007. URL: https://arxiv.org/abs/0709.0289.
  36. 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 für Informatik, 2016. Google Scholar
  37. Ivan Šupić and Joseph Bowles. Self-testing of quantum systems: a review. arXiv:1904.10042 [quant-ph], April 2019. arXiv: 1904.10042. URL: https://arxiv.org/abs/1904.10042.
  38. Marco Tomamichel, Serge Fehr, Jedrzej Kaniewski, and Stephanie Wehner. A monogamy-of-entanglement game with applications to device-independent quantum cryptography. New Journal of Physics, 15(10):103002, October 2013. URL: https://doi.org/10.1088/1367-2630/15/10/103002.
  39. Dominique Unruh. Quantum position verification in the random oracle model. In Juan A. Garay and Rosario Gennaro, editors, Advances in Cryptology - CRYPTO 2014, pages 1-18, Berlin, Heidelberg, 2014. Springer Berlin Heidelberg. Google Scholar
  40. Dominique Unruh. Quantum Position Verification in the Random Oracle Model. In Juan A. Garay and Rosario Gennaro, editors, Advances in Cryptology - CRYPTO 2014, Lecture Notes in Computer Science, pages 1-18, Berlin, Heidelberg, 2014. Springer. URL: https://doi.org/10.1007/978-3-662-44381-1_1.
  41. William K. Wootters and Wojciech Zurek. A single quantum cannot be cloned. Nature, 299:802-803, 1982. Google Scholar
  42. Mark Zhandry. How to Record Quantum Queries, and Applications to Quantum Indifferentiability. In Alexandra Boldyreva and Daniele Micciancio, editors, Advances in Cryptology – CRYPTO 2019, Lecture Notes in Computer Science, pages 239-268. Springer International Publishing, 2019. URL: https://doi.org/10.1007/978-3-030-26951-7_9.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact