Florian Speelman

Full Name

F. Speelman

Email

F.Speelman@cwi.nl

Phone

+31 20 5929 333

Room

L213

Department(s)

Algorithms and Complexity

Function(s)

Researcher

Florian Speelman

Folkertsma, M., Mertz, I., Speelman, F.& Tupker, Q. M. (2026). Fully characterizing lossy catalytic computation. Algorithmica, 88(3).https://doi.org/10.1007/s00453-026-01376-6
Allerstorfer, R., Bluhm, A., Buhrman, H., Christandl, M., Escolà Farràs, L., Speelman, F.& Verduyn Lunel, P. (2025). Making existing quantum position verification protocols secure against arbitrary transmission loss. Physical Review Letters, 135(26), 260801:1–260801:7.https://doi.org/10.1103/szwj-s7r6
Buhrman, H., Folkertsma, M., Mertz, I., Speelman, F., Strelchuk, S., Subramanian, S.& Tupker, Q. M. (2025). Quantum Catalytic Space. Proceedings of the Conference on the Theory of Quantum Computation, Communication and Cryptography, 350.https://doi.org/10.4230/LIPIcs.TQC.2025.11
Kanneworff, K., Poortvliet, M., Bouwmeester, D., Allerstorfer, R., Verduyn Lunel, P., Speelman, F., Buhrman, H., Steindl, P.& Löffler, W. (2025). Towards experimental demonstration of quantum position verification using single photons. Quantum Science and Technology, 10(4), 045004:1–045004:10.https://doi.org/10.1088/2058-9565/adf2da
Escolà Farràs, L.& Speelman, F. (2025). Lossy-and-constrained extended non-local games with applications to quantum cryptography. Quantum, 9, 1712:1–1712:31.https://doi.org/10.22331/q-2025-04-18-1712
Folkertsma, M., Mertz, I., Speelman, F.& Tupker, Q. M. (2025). Fully characterizing lossy catalytic computation. Proceedings of the Innovations in Theoretical Computer Science Conference, 50:1–50:13.https://doi.org/10.4230/LIPIcs.ITCS.2025.50
Allerstorfer, R., Buhrman, H., May, A., Speelman, F.& Verduyn Lunel, P. (2024). Relating non-local quantum computation to information theoretic cryptography. Quantum, 8, 1387:1–1387:47.https://doi.org/10.22331/q-2024-06-27-1387
Colisson, L. A. S., Muguruza Lasa, G.& Speelman, F. (2023). Oblivious transfer from zero-knowledge proofs, or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states. Advances in Cryptology - ASIACRYPT, 14445.https://doi.org/10.1007/978-981-99-8742-9_1
Escolà Farràs, L.& Speelman, F. (2023). Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers. Physical Review Letters, 131(14).https://doi.org/10.1103/PhysRevLett.131.140802
Buhrman, H., Loff Barreto, B. S., Patro, S.& Speelman, F. (2022). Memory compression with quantum random-access gates. Proceedings of the Conference on the Theory of Quantum Computation, Communication and Cryptography, 232.https://doi.org/10.4230/LIPIcs.TQC.2022.10

Andreas Bonn medal (2018)