Florian Speelman
Florian Speelman
University of Amsterdam, QuSoft
Verified email at uva.nl
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
772018
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
412016
Computing with a full memory: Catalytic space
H Buhrman, R Cleve, M Koucký, B Loff, F Speelman
STOC '14, 857-866, 2014
412014
The garden-hose model
H Buhrman, S Fehr, C Schaffner, F Speelman
ITCS 2013 - 4th conference on Innovations in Theoretical Computer Science …, 2013
36*2013
Towards a reverse newman’s theorem in interactive information complexity
J Brody, H Buhrman, M Koucký, B Loff, F Speelman, N Vereshchagin
Algorithmica 76 (3), 749-781, 2016
352016
Quantum fully homomorphic encryption with verification
G Alagic, Y Dulek, C Schaffner, F Speelman
International Conference on the Theory and Application of Cryptology and …, 2017
262017
Instantaneous non-local computation of low T-depth quantum circuits
F Speelman
TQC 2016 - 11th Conference on the Theory of Quantum Computation …, 2016
20*2016
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
152016
Asymptotic performance of port-based teleportation
M Christandl, F Leditzky, C Majenz, G Smith, F Speelman, M Walter
Communications in Mathematical Physics, 2020
142020
A Framework of Quantum Strong Exponential-Time Hypotheses
H Buhrman, S Patro, F Speelman
38th International Symposium on Theoretical Aspects of Computer Science …, 2021
10*2021
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
92015
Position-based quantum cryptography and the garden-hose game
F Speelman
arXiv preprint arXiv:1210.4353, 2011
52011
Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks
A Bluhm, M Christandl, F Speelman
arXiv preprint arXiv:2104.06301, 2021
22021
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
22018
Position-based quantum cryptography and catalytic computation
F Speelman
12016
A quantum gate on an atom chip by controlled collisions in state-dependent rf-dressed potentials
F Speelman
University of Amsterdam, 2008
12008
New Protocols and Ideas for Practical Quantum Position Verification
R Allerstorfer, H Buhrman, F Speelman, PV Lunel
arXiv preprint arXiv:2106.12911, 2021
2021
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
arXiv preprint arXiv:2106.02005, 2021
2021
A Guide for New Program Committee Members at Theoretical Computer Science Conferences
Y Dulek, S Jeffery, C Majenz, C Schaffner, F Speelman, R de Wolf
arXiv preprint arXiv:2105.02773, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–19