Florian Speelman

Cited by

	All	Since 2019
Citations	738	554
h-index	14	12
i10-index	16	15

160

120

2013201420152016201720182019202020212022202320247 20 16 38 44 49 46 61 63 97 127 153

Public access

View all

12 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftVerified email at quantinuum.com
Christian SchaffnerUniversity of Amsterdam & QuSoftVerified email at uva.nl
Bruno LoffLASIGE, Faculdade de Ciências da Universidade de LisboaVerified email at fc.up.pt
Yfke DulekPostdoc, Centrum Wiskunde en Informatica (CWI) AmsterdamVerified email at cwi.nl
Subhasree PatroEindhoven University of Technology and QuSoft, Centrum Wiskunde and InformaticaVerified email at tue.nl
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Matthias ChristandlUniversity of CopenhagenVerified email at math.ku.dk
Rene AllerstorferQuSoft (Centrum Wiskunde & Informatica)Verified email at aon.at
Philip Verduyn LunelPhD Student, QuSoftVerified email at cwi.nl
Serge FehrCWIVerified email at cwi.nl
Llorenç Escolà FarràsPhysicist and mathematician, PhD candidate University of AmsterdamVerified email at uva.nl
Richard CleveInstitute for Quantum Computing, University of WaterlooVerified email at uwaterloo.ca
Christian MajenzAssociate Professor, Technical University of DenmarkVerified email at dtu.dk
Andreas BluhmResearcher, Université Grenoble Alpes, CNRS, LIGVerified email at ma.tum.de
Felix LeditzkyUniversity of Illinois Urbana-ChampaignVerified email at illinois.edu
Michael WalterRuhr University BochumVerified email at rub.de
Graeme SmithIQC and University of WaterlooVerified email at colorado.edu
Joshua BrodyAssociate Professor, Swarthmore CollegeVerified email at cs.swarthmore.edu
Garazi MuguruzaQuSoft, University of AmsterdamVerified email at uva.nl
Jordi WeggemansPhD candidate, QuSoft/CWIVerified email at cwi.nl

Florian Speelman

University of Amsterdam, QuSoft

Verified email at uva.nl

quantum information complexity theory quantum cryptography quantum communication


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Quantum Homomorphic Encryption for Polynomial-Size Circuits Y Dulek, C Schaffner, F Speelman Theory of Computing 14 (7), 1-45, 2018	125	2018
Quantum communication complexity advantage implies violation of a Bell inequality H Buhrman, Ł Czekaj, A Grudka, M Horodecki, P Horodecki, ... Proceedings of the National Academy of Sciences 113 (12), 3191-3196, 2016	69	2016
Computing with a full memory: Catalytic space H Buhrman, R Cleve, M Koucký, B Loff, F Speelman STOC '14, 857-866, 2014	65	2014
The garden-hose model H Buhrman, S Fehr, C Schaffner, F Speelman ITCS 2013 - 4th conference on Innovations in Theoretical Computer Science …, 2013	57*	2013
Quantum fully homomorphic encryption with verification G Alagic, Y Dulek, C Schaffner, F Speelman Advances in Cryptology–ASIACRYPT 2017: 23rd International Conference on the …, 2017	53	2017
Instantaneous non-local computation of low T-depth quantum circuits F Speelman TQC 2016 - 11th Conference on the Theory of Quantum Computation …, 2016	46	2016
Asymptotic performance of port-based teleportation M Christandl, F Leditzky, C Majenz, G Smith, F Speelman, M Walter Communications in Mathematical Physics, 2020	44	2020
Towards a reverse newman’s theorem in interactive information complexity J Brody, H Buhrman, M Koucký, B Loff, F Speelman, N Vereshchagin Algorithmica 76, 749-781, 2016	39	2016
Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach JR Weggemans, A Urech, A Rausch, R Spreeuw, R Boucherie, F Schreck, ... Quantum 6, 687, 2022	34	2022
A Framework of Quantum Strong Exponential-Time Hypotheses H Buhrman, S Patro, F Speelman 38th International Symposium on Theoretical Aspects of Computer Science …, 2021	34*	2021
Catalytic space: non-determinism and hierarchy H Buhrman, M Koucký, B Loff, F Speelman STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science 47, 2016	27	2016
A single-qubit position verification protocol that is secure against multi-qubit attacks A Bluhm, M Christandl, F Speelman Nature Physics 18 (6), 623-626, 2022	26*	2022
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks H Buhrman, B Loff, S Patro, F Speelman 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) 215 …, 2022	15	2022
Round elimination in exact communication complexity J Briët, H Buhrman, D Leung, T Piovesan, F Speelman TQC 2015 - 10th Conference on the Theory of Quantum Computation …, 2015	14	2015
Memory Compression with Quantum Random-Access Gates H Buhrman, B Loff, S Patro, F Speelman 17th Conference on the Theory of Quantum Computation, Communication and …, 2022	12	2022
Quantum ciphertext authentication and key recycling with the trap code Y Dulek, F Speelman 13th Conference on the Theory of Quantum Computation, Communication and …, 2018	10	2018
Relating non-local quantum computation to information theoretic cryptography R Allerstorfer, H Buhrman, A May, F Speelman, PV Lunel Quantum 8, 1387, 2024	8	2024
Making existing quantum position verification protocols secure against arbitrary transmission loss R Allerstorfer, A Bluhm, H Buhrman, M Christandl, L Escolà-Farràs, ... arXiv preprint arXiv:2312.12614, 2023	8	2023
Towards practical and error-robust quantum position verification R Allerstorfer, H Buhrman, F Speelman, PV Lunel arXiv preprint arXiv:2106.12911, 2021	8*	2021
Position-based quantum cryptography and the garden-hose game F Speelman arXiv preprint arXiv:1210.4353, 2011	8	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors