Florian Speelman

Full Name

F. Speelman

Email

F.Speelman@cwi.nl

Phone

+31 20 592 4299

Room

L213

Department(s)

Algorithms and Complexity

Function(s)

Researcher

Florian Speelman

Colisson, L. A. S., Muguruza Lasa, G., & Speelman, F. (2023). Oblivious Transfer from Zero-Knowledge proofs: Or wow to achieve round-optimal quantum Oblivious Transfer and Zero-Knowledge proofs on quantum states. In Advances in Cryptology - ASIACRYPT (pp. 3–38). doi: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). doi:10.1103/PhysRevLett.131.140802
Buhrman, H., Loff Barreto, B. S., Patro, S., & Speelman, F. (2022). Memory compression with quantum random-access gates. In Conference on the Theory of Quantum Computation, Communication and Cryptography (pp. 10:1–10:19). doi:10.4230/LIPIcs.TQC.2022.10
Weggemans, J., Urech, A., Rausch, A., Spreeuw, R., Boucherie, R., Schreck, F., … Speelman, F. (2022). Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach. Quantum, 6, 687:1–687:42. doi:10.22331/Q-2022-04-13-687
Buhrman, H., Loff Barreto, B. S., Patro, S., & Speelman, F. (2022). Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference, ITCS 2022 (pp. 31.1–31.12). doi:10.4230/LIPIcs.ITCS.2022.31
Christandl, M., Leditzky, F. (Felix), Majenz, C., Smith, G. (Graeme), Speelman, F., & Walter, M. (Michael). (2020). Asymptotic performance of port-based teleportation. Communications in Mathematical Physics, 381, 379–451. doi:10.1007/s00220-020-03884-0
Dulek, Y., & Speelman, F. (2018). Quantum ciphertext authentication and key recycling with the trap code. In 13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018 (pp. 1:1–1:17). doi:10.4230/LIPIcs.TQC.2018.1
Alagic, G., Dulek, Y., Schaffner, C., & Speelman, F. (2017). Quantum fully homomorphic encryption with verification. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 438–467). doi:10.1007/978-3-319-70694-8_16
Speelman, F. (2016, November 16). Position-based quantum cryptography and catalytic computation.
Brody, J., Buhrman, H., Koucký, M., Loff Barreto, B. S., Speelman, F., & Vereshchagin, N. K. (2016). Towards a Reverse Newman’s Theorem in interactive information complexity. Algorithmica, 76(3), 749–781. doi:10.1007/s00453-015-0112-9

Andreas Bonn medal (2018)