Relating non-local quantum computation to information theoretic cryptography

Rene Allerstorfer; Harry Buhrman; Alex May; Florian Speelman; Philip Verduyn Lunel

doi:10.22331/q-2024-06-27-1387

Relating non-local quantum computation to information theoretic cryptography

Rene Allerstorfer², Harry Buhrman^2,3, Alex May¹, Florian Speelman^2,3, and Philip Verduyn Lunel²

¹Perimeter Institute for Theoretical Physics
²QuSoft, CWI Amsterdam
³University of Amsterdam

Published:	2024-06-27, volume 8, page 1387
Eprint:	arXiv:2306.16462v6
Doi:	https://doi.org/10.22331/q-2024-06-27-1387
Citation:	Quantum 8, 1387 (2024).

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.

Abstract

Non-local quantum computation (NLQC) is a cheating strategy for position-verification schemes, and has appeared in the context of the AdS/CFT correspondence. Here, we connect NLQC to the wider context of information theoretic cryptography by relating it to a number of other cryptographic primitives. We show one special case of NLQC, known as $f$-routing, is equivalent to the quantum analogue of the conditional disclosure of secrets (CDS) primitive, where by equivalent we mean that a protocol for one task gives a protocol for the other with only small overhead in resource costs. We further consider another special case of position-verification, which we call coherent function evaluation (CFE), and show CFE protocols induce similarly efficient protocols for the private simultaneous message passing (PSM) scenario. By relating position-verification to these cryptographic primitives, a number of results in the information theoretic cryptography literature give new implications for NLQC, and vice versa. These include the first sub-exponential upper bounds on the worst case cost of $f$-routing of $2^{O(\sqrt{n\log n})}$ entanglement, the first example of an efficient $f$-routing strategy for a problem believed to be outside $P/poly$, linear lower bounds on quantum resources for CDS in the quantum setting, linear lower bounds on communication cost of CFE, and efficient protocols for CDS in the quantum setting for functions that can be computed with quantum circuits of low $T$ depth.

Presentation at QIP2024

► BibTeX data

@article{Allerstorfer2024relatingnonlocal,
  doi = {10.22331/q-2024-06-27-1387},
  url = {https://doi.org/10.22331/q-2024-06-27-1387},
  title = {Relating non-local quantum computation to information theoretic cryptography},
  author = {Allerstorfer, Rene and Buhrman, Harry and May, Alex and Speelman, Florian and Verduyn Lunel, Philip},
  journal = {{Quantum}},
  issn = {2521-327X},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  volume = {8},
  pages = {1387},
  month = jun,
  year = {2024}
}

► References

[1] Nishanth Chandran, Vipul Goyal, Ryan Moriarty, and Rafail Ostrovsky. Position based cryptography. In Annual International Cryptology Conference, pages 391–407. Springer, 2009. https://doi.org/10.1007/978-3-642-03356-8_23.
https://doi.org/10.1007/978-3-642-03356-8_23

[2] 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): 012326, 2011. https://doi.org/10.1103/PhysRevA.84.012326.
https://doi.org/10.1103/PhysRevA.84.012326

[3] 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, 2014. https://doi.org/10.1137/130913687.
https://doi.org/10.1137/130913687

[4] Alex May. Quantum tasks in holography. Journal of High Energy Physics, 2019 (10): 1–39, 2019. https://doi.org/10.1007/JHEP10(2019)233.
https://doi.org/10.1007/JHEP10(2019)233

[5] Kfir Dolev and Sam Cree. Holography as a resource for non-local quantum computation. arXiv preprint arXiv:2210.13500, 2022. https://doi.org/10.48550/arXiv.2210.13500.
https://doi.org/10.48550/arXiv.2210.13500
arXiv:2210.13500

[6] Alex May and Michelle Xu. Non-local computation and the black hole interior. arXiv preprint arXiv:2304.11184, 2023. https://doi.org/10.48550/arXiv.2304.11184.
https://doi.org/10.48550/arXiv.2304.11184
arXiv:2304.11184

[7] Alex May, Geoff Penington, and Jonathan Sorce. Holographic scattering requires a connected entanglement wedge. Journal of High Energy Physics, 2020 (8): 1–34, 2020. https://doi.org/10.1007/JHEP08(2020)132.
https://doi.org/10.1007/JHEP08(2020)132

[8] Alex May, Jonathan Sorce, and Beni Yoshida. The connected wedge theorem and its consequences. Journal of High Energy Physics, 2022 (11): 1–65, 2022. https://doi.org/10.1007/JHEP11(2022)153.
https://doi.org/10.1007/JHEP11(2022)153

[9] Alex May. Complexity and entanglement in non-local computation and holography. Quantum, 6: 864, 2022. https://doi.org/10.22331/q-2022-11-28-864.
https://doi.org/10.22331/q-2022-11-28-864

[10] Marco Tomamichel, Serge Fehr, Jędrzej Kaniewski, and Stephanie Wehner. A monogamy-of-entanglement game with applications to device-independent quantum cryptography. New Journal of Physics, 15 (10): 103002, 2013. 10.1088/1367-2630/15/10/103002.
https://doi.org/10.1088/1367-2630/15/10/103002

[11] 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, 2011. 10.1088/1367-2630/13/9/093036.
https://doi.org/10.1088/1367-2630/13/9/093036

[12] Sam Cree and Alex May. Code-routing: a new attack on position-verification. arXiv preprint arXiv:2202.07812, 2022. https://doi.org/10.48550/arXiv.2202.07812.
https://doi.org/10.48550/arXiv.2202.07812
arXiv:2202.07812

[13] 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, pages 145–158, 2013. https://doi.org/10.1145/2422436.2422455.
https://doi.org/10.1145/2422436.2422455

[14] Florian Speelman. Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits. In Anne Broadbent, editor, 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016), volume 61 of Leibniz International Proceedings in Informatics (LIPIcs), pages 9:1–9:24, Dagstuhl, Germany, 2016. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. ISBN 978-3-95977-019-4. 10.4230/LIPIcs.TQC.2016.9. URL http://drops.dagstuhl.de/opus/volltexte/2016/6690.
https://doi.org/10.4230/LIPIcs.TQC.2016.9
http://drops.dagstuhl.de/opus/volltexte/2016/6690

[15] Yael Gertner, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. Protecting data privacy in private information retrieval schemes. Journal of Computer and System Sciences, 60 (3): 592–629, 2000. ISSN 0022-0000. https://doi.org/10.1006/jcss.1999.1689. URL https://www.sciencedirect.com/science/article/pii/S0022000099916896.
https://doi.org/10.1006/jcss.1999.1689
https://www.sciencedirect.com/science/article/pii/S0022000099916896

[16] Yuval Ishai and Eyal Kushilevitz. Private simultaneous messages protocols with applications. In Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pages 174–183. IEEE, 1997. https://doi.org/10.1109/ISTCS.1997.595170.
https://doi.org/10.1109/ISTCS.1997.595170

[17] Bill Aiello, Yuval Ishai, and Omer Reingold. Priced oblivious transfer: How to sell digital goods. In Advances in Cryptology—EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings 20, pages 119–135. Springer, 2001. https://doi.org/10.1007/3-540-44987-6_8.
https://doi.org/10.1007/3-540-44987-6_8

[18] Yuval Ishai, Eyal Kushilevitz, and Anat Paskin. Secure multiparty computation with minimal interaction. In Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings 30, pages 577–594. Springer, 2010. https://doi.org/10.1007/978-3-642-14623-7_31.
https://doi.org/10.1007/978-3-642-14623-7_31

[19] Benny Applebaum and Barak Arkis. On the power of amortization in secret sharing: d-uniform secret sharing and cds with constant information rate. ACM Transactions on Computation Theory (TOCT), 12 (4): 1–21, 2020. https://doi.org/10.1145/3417756.
https://doi.org/10.1145/3417756

[20] Amos Beimel, Eyal Kushilevitz, and Pnina Nissim. The complexity of multiparty PSM protocols and related models. In Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29-May 3, 2018 Proceedings, Part II 37, pages 287–318. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_10.
https://doi.org/10.1007/978-3-319-78375-8_10

[21] Mark M Wilde. Quantum information theory. Cambridge University Press, 2013. http://doi.org/10.1017/9781316809976.
https://doi.org/10.1017/9781316809976

[22] Andris Ambainis, Michele Mosca, Alain Tapp, and Ronald De Wolf. Private quantum channels. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pages 547–553. IEEE, 2000. 10.1109/SFCS.2000.892142.
https://doi.org/10.1109/SFCS.2000.892142

[23] Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi. Classical and quantum computation. Number 47. American Mathematical Soc., 2002. http://doi.org/10.1090/gsm/047.
https://doi.org/10.1090/gsm/047

[24] Benjamin Schumacher and Michael D Westmoreland. Entanglement and perfect quantum error correction. Journal of Mathematical Physics, 43 (9): 4279–4285, 2002a. https://doi.org/10.1063/1.1497183.
https://doi.org/10.1063/1.1497183

[25] Benjamin Schumacher and Michael D Westmoreland. Approximate quantum error correction. Quantum Information Processing, 1: 5–12, 2002b. https://doi.org/10.1023/A:1019653202562.
https://doi.org/10.1023/A:1019653202562

[26] Dennis Kretschmann, Dirk Schlingemann, and Reinhard F Werner. The information-disturbance tradeoff and the continuity of Stinespring's representation. IEEE transactions on information theory, 54 (4): 1708–1717, 2008a. 10.1109/TIT.2008.917696.
https://doi.org/10.1109/TIT.2008.917696

[27] Benny Applebaum, Barak Arkis, Pavel Raykov, and Prashant Nalini Vasudevan. Conditional disclosure of secrets: Amplification, closure, amortization, lower-bounds, and separations. In Annual International Cryptology Conference, pages 727–757. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_24.
https://doi.org/10.1007/978-3-319-63688-7_24

[28] Secure Multi-Party Computation, MM Prabhakaran, and A Sahai. Randomization techniques for secure computation. Secure Multi-Party Computation, 10: 222, 2013. 10.3233/978-1-61499-169-4-222.
https://doi.org/10.3233/978-1-61499-169-4-222

[29] Andreas Bluhm, Matthias Christandl, and Florian Speelman. A single-qubit position verification protocol that is secure against multi-qubit attacks. Nature Physics, 18 (6): 623–626, 2022. https://doi.org/10.1038/s41567-022-01577-0.
https://doi.org/10.1038/s41567-022-01577-0

[30] Marius Junge, Aleksander M Kubicki, Carlos Palazuelos, and David Pérez-García. Geometry of Banach spaces: a new route towards Position Based Cryptography. arXiv preprint arXiv:2103.16357, 2021. https://doi.org/10.1007/s00220-022-04407-9.
https://doi.org/10.1007/s00220-022-04407-9
arXiv:2103.16357

[31] Benny Applebaum and Pavel Raykov. From private simultaneous messages to zero-information Arthur–Merlin protocols and back. Journal of Cryptology, 30 (4): 961–988, 2017. https://doi.org/10.1007/s00145-016-9239-3.
https://doi.org/10.1007/s00145-016-9239-3

[32] Benny Applebaum, Amos Beimel, Oded Nir, and Naty Peter. Better secret sharing via robust conditional disclosure of secrets. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 280–293, 2020. http://doi.org/10.1145/3357713.3384293.
https://doi.org/10.1145/3357713.3384293

[33] Benny Applebaum and Prashant Nalini Vasudevan. Placing conditional disclosure of secrets in the communication complexity universe. Journal of Cryptology, 34: 1–45, 2021. http://doi.org/10.1007/s00145-021-09376-1.
https://doi.org/10.1007/s00145-021-09376-1

[34] The 10th BIU winter school on cryptography - information theoretic cryptography. URL https://www.youtube.com/@thebiuresearchcenteronappl8783/featured.
https://www.youtube.com/@thebiuresearchcenteronappl8783/featured

[35] Akinori Kawachi and Harumichi Nishimura. Communication complexity of private simultaneous quantum messages protocols. arXiv preprint arXiv:2105.07120, 2021. https://doi.org/10.48550/arXiv.2105.07120.
https://doi.org/10.48550/arXiv.2105.07120
arXiv:2105.07120

[36] Dennis Kretschmann, Dirk Schlingemann, and Reinhard F Werner. A continuity theorem for Stinespring's dilation. Journal of Functional Analysis, 255 (8): 1889–1904, 2008b. http://doi.org/10.1016/j.jfa.2008.07.023.
https://doi.org/10.1016/j.jfa.2008.07.023

[37] Thomas Koutsikos. Relating private simultaneous message passing to coherent function evaluation, unpublished. https://drive.google.com/file/d/1DAy6Z7sHNiue8jSr3ztkJHOpbgjlDODd/view.
https://drive.google.com/file/d/1DAy6Z7sHNiue8jSr3ztkJHOpbgjlDODd/view

[38] Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, and Christoph Meinel. Structure and importance of logspace-mod class. Mathematical systems theory, 25 (3): 223–237, 1992. http://doi.org/10.1007/BF01374526.
https://doi.org/10.1007/BF01374526

[39] Mauricio Karchmer and Avi Wigderson. On span programs. In [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, pages 102–111. IEEE, 1993. 10.1109/SCT.1993.336536.
https://doi.org/10.1109/SCT.1993.336536

[40] Amos Beimel and Anna Gál. On arithmetic branching programs. Journal of Computer and System Sciences, 59 (2): 195–220, 1999. http://doi.org/10.1006/jcss.1999.1648.
https://doi.org/10.1006/jcss.1999.1648

[41] Yuval Ishai and Hoeteck Wee. Partial garbling schemes and their applications. In Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I 41, pages 650–662. Springer, 2014. http://doi.org/10.1007/978-3-662-43948-7_54.
https://doi.org/10.1007/978-3-662-43948-7_54

[42] Pavel Pudlák and Jiri Sgall. Algebraic models of computation and interpolation for algebraic proof systems. Proof complexity and feasible arithmetics, 39: 279–296, 1996. http://doi.org/10.1090/dimacs/039/15.
https://doi.org/10.1090/dimacs/039/15

[43] Andreas Bluhm, Matthias Christandl, and Florian Speelman. Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks. arXiv preprint arXiv:2104.06301, 2021. https://doi.org/10.48550/arXiv.2104.06301.
https://doi.org/10.48550/arXiv.2104.06301
arXiv:2104.06301

[44] Amos Beimel and Yuval Ishai. On the power of nonlinear secret-sharing. SIAM Journal on Discrete Mathematics, 19 (1): 258–280, 2005. http://doi.org/10.1137/S0895480102412868.
https://doi.org/10.1137/S0895480102412868

[45] Shafi Goldwasser and Silvio Micali. Probabilistic encryption & how to play mental poker keeping secret all partial information. In Providing sound foundations for cryptography: on the work of Shafi Goldwasser and Silvio Micali, pages 173–201. 2019. http://doi.org/10.1145/3335741.3335749.
https://doi.org/10.1145/3335741.3335749

[46] Clifford Cocks. An identity based encryption scheme based on quadratic residues. Lecture Notes in Computer Science, 2260: 360–363, 2001. http://doi.org/10.1007/3-540-45325-3_32.
https://doi.org/10.1007/3-540-45325-3_32

[47] Lenore Blum, Manuel Blum, and Mike Shub. A simple unpredictable pseudo-random number generator. SIAM Journal on computing, 15 (2): 364–383, 1986. http://doi.org/10.1137/0215025.
https://doi.org/10.1137/0215025

[48] Burt Kaliski. Quadratic Residuosity Problem, pages 1003–1003. Springer US, Boston, MA, 2011. ISBN 978-1-4419-5906-5. 10.1007/978-1-4419-5906-5_429. URL https://doi.org/10.1007/978-1-4419-5906-5_429.
https://doi.org/10.1007/978-1-4419-5906-5_429

[49] Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, and Tal Malkin. On the complexity of decomposable randomized encodings, or: how friendly can a garbling-friendly prf be? In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ITCS.2020.86.
https://doi.org/10.4230/LIPIcs.ITCS.2020.86

[50] Taewan Kim and Byung-Soo Choi. Efficient decomposition methods for controlled-R n using a single ancillary qubit. Scientific reports, 8 (1): 1–7, 2018. http://doi.org/10.1038/s41598-018-23764-x.
https://doi.org/10.1038/s41598-018-23764-x

[51] Tianren Liu, Vinod Vaikuntanathan, and Hoeteck Wee. Conditional disclosure of secrets via non-linear reconstruction. In Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part I, pages 758–790. Springer, 2017. http://doi.org/10.1007/978-3-319-63688-7_25.
https://doi.org/10.1007/978-3-319-63688-7_25

[52] Zeev Dvir and Sivakanth Gopi. 2-server PIR with subpolynomial communication. Journal of the ACM (JACM), 63 (4): 1–15, 2016. http://doi.org/10.1145/2968443.
https://doi.org/10.1145/2968443

[53] Vince Grolmusz. Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica, 20 (1): 71–86, 2000. http://doi.org/10.1007/s004930070032.
https://doi.org/10.1007/s004930070032

[54] Anne Broadbent. Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation. Physical Review A, 94 (2): 022318, 2016. http://doi.org/10.1103/PhysRevA.94.022318.
https://doi.org/10.1103/PhysRevA.94.022318

[55] Wim Van Dam. Implausible consequences of superstrong nonlocality. Natural Computing, 12: 9–12, 2013. http://doi.org/10.1007/s11047-012-9353-6.
https://doi.org/10.1007/s11047-012-9353-6

[56] Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. Non-local box complexity and secure function evaluation. Quantum Information & Computation, 11 (1): 40–69, 2011. http://doi.org/10.26421/QIC11.1-2-4.
https://doi.org/10.26421/QIC11.1-2-4

[57] Gerard 't Hooft. Dimensional reduction in quantum gravity. arXiv preprint gr-qc/9310026, 1993. https://doi.org/10.48550/arXiv.gr-qc/9310026.
https://doi.org/10.48550/arXiv.gr-qc/9310026

[58] Leonard Susskind. The world as a hologram. Journal of Mathematical Physics, 36 (11): 6377–6396, 1995. http://doi.org/10.1063/1.531249.
https://doi.org/10.1063/1.531249

[59] Juan Maldacena. The large-N limit of superconformal field theories and supergravity. International journal of theoretical physics, 38 (4): 1113–1133, 1999. https://doi.org/10.1023/A:1026654312961.
https://doi.org/10.1023/A:1026654312961

[60] Edward Witten. Anti de Sitter space and holography. arXiv preprint hep-th/9802150, 1998. 10.4310/ATMP.1998.v2.n2.a2.
https://doi.org/10.4310/ATMP.1998.v2.n2.a2

[61] Llorenç Escolà-Farràs and Florian Speelman. Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers. Physical Review Letters, 131 (14): 140802, 2023. http://doi.org/10.1103/PhysRevLett.131.140802.
https://doi.org/10.1103/PhysRevLett.131.140802

Cited by

[1] Rene Allerstorfer, Andreas Bluhm, Harry Buhrman, Matthias Christandl, Llorenç Escolà-Farràs, Florian Speelman, and Philip Verduyn Lunel, "Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss", Physical Review Letters 135 26, 260801 (2025).

[2] Llorenç Escolà-Farràs, Arpan Akash Ray, Rene Allerstorfer, Boris Škorić, and Florian Speelman, "Continuous-variable quantum position verification secure against entangled attackers", Physical Review A 110 6, 062605 (2024).

[3] Alex May, Sabrina Pasterski, Chris Waddell, and Michelle Xu, "Cryptographic tests of the python’s lunch conjecture", SciPost Physics 19 4, 084 (2025).

[4] Elena Cáceres, Rafael Carrasco, and Juan F. Pedraza, "Lorentzian threads and nonlocal computation in holography", Physical Review D 113 10, 106024 (2026).

[5] Andreas Bluhm, Simon Höfer, Alex May, Mikka Stasiuk, Philip Verduyn Lunel, and Henry Yuen, "A complexity theory for non-local quantum computation", Quantum 10, 2152 (2026).

[6] Jacqueline Caminiti, Batia Friedman-Shaw, Alex May, Robert C. Myers, and Olga Papadoulaki, "Holographic scattering and non-minimal RT surfaces", Journal of High Energy Physics 2024 10, 119 (2024).

[7] Mohansai Balusu, Gaurav Katoch, Sanhita Parihar, and Shubho R. Roy, "Quantum complexity of nonlocal field theories", Journal of High Energy Physics 2026 3, 162 (2026).

[8] Uma Girish, Alex May, Natalie Parham, and Henry Yuen, Proceedings of the 58th Annual ACM Symposium on Theory of Computing 845 (2026) ISBN:9798400725364.

[9] Vahid R. Asadi, Kohdai Kuroiwa, Debbie Leung, Alex May, Sabrina Pasterski, and Chris Waddell, "Conditional disclosure of secrets with quantum resources", Quantum 9, 1885 (2025).

[10] Uma Girish, Alex May, Leo Orshansky, and Chris Waddell, "Comparing classical and quantum conditional disclosure of secrets", Quantum 10, 2049 (2026).

[11] Kirsten Kanneworff, Mio Poortvliet, Dirk Bouwmeester, Rene Allerstorfer, Philip Verduyn Lunel, Florian Speelman, Harry Buhrman, Petr Steindl, and Wolfgang Löffler, "Towards experimental demonstration of quantum position verification using single photons", Quantum Science and Technology 10 4, 045004 (2025).

[12] Akinori KAWACHI and Yuto NISHIKUBO, "Private Quantum Signal Processing", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E108.A 9, 1105 (2025).

[13] Dmitry Grinko, Adam Burchardt, and Maris Ozols, "Efficient quantum circuits for port-based teleportation", arXiv:2312.03188, (2023).

[14] Vahid Asadi, Richard Cleve, Eric Culf, and Alex May, "Linear gate bounds against natural functions for position-verification", Quantum 9, 1604 (2025).

[15] Vahid R. Asadi, Eric Culf, and Alex May, "Rank lower bounds on non-local quantum computation", arXiv:2402.18647, (2024).

[16] Llorenç Escolà-Farràs and Florian Speelman, "Quantum position verification in one shot: parallel repetition of the $f$-BB84 and $f$-routing protocols", arXiv:2503.09544, (2025).

[17] Rene Allerstorfer, Llorenç Escolà-Farràs, Arpan Akash Ray, Boris Škorić, Florian Speelman, and Philip Verduyn Lunel, "Security of a Continuous-Variable based Quantum Position Verification Protocol", arXiv:2308.04166, (2023).

[18] Richard Cleve and Alex May, "Lower bounds on non-local computation from controllable correlation", arXiv:2602.00255, (2026).

The above citations are from Crossref's cited-by service (last updated successfully 2026-08-09 12:25:14) and SAO/NASA ADS (last updated successfully 2026-08-09 12:25:16). The list may be incomplete as not all publishers provide suitable and complete citation data.

This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.