Obserwuj
Florian Speelman
Florian Speelman
University of Amsterdam, QuSoft
Zweryfikowany adres z uva.nl
Tytuł
Cytowane przez
Cytowane przez
Rok
Quantum Homomorphic Encryption for Polynomial-Size Circuits
Y Dulek, C Schaffner, F Speelman
Theory of Computing 14 (7), 1-45, 2018
1272018
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
692016
Computing with a full memory: Catalytic space
H Buhrman, R Cleve, M Koucký, B Loff, F Speelman
STOC '14, 857-866, 2014
662014
The garden-hose model
H Buhrman, S Fehr, C Schaffner, F Speelman
ITCS 2013 - 4th conference on Innovations in Theoretical Computer Science …, 2013
59*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
542017
Instantaneous non-local computation of low T-depth quantum circuits
F Speelman
TQC 2016 - 11th Conference on the Theory of Quantum Computation …, 2016
482016
Asymptotic performance of port-based teleportation
M Christandl, F Leditzky, C Majenz, G Smith, F Speelman, M Walter
Communications in Mathematical Physics, 2020
452020
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
392016
A Framework of Quantum Strong Exponential-Time Hypotheses
H Buhrman, S Patro, F Speelman
38th International Symposium on Theoretical Aspects of Computer Science …, 2021
36*2021
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
342022
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
28*2022
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
282016
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
162022
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
142022
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
142015
Relating non-local quantum computation to information theoretic cryptography
R Allerstorfer, H Buhrman, A May, F Speelman, PV Lunel
Quantum 8, 1387, 2024
112024
Oblivious Transfer from Zero-Knowledge Proofs: Or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States
L Colisson, G Muguruza, F Speelman
International Conference on the Theory and Application of Cryptology and …, 2023
102023
Towards practical and error-robust quantum position verification
R Allerstorfer, H Buhrman, F Speelman, PV Lunel
arXiv preprint arXiv:2106.12911, 2021
10*2021
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
102018
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
92023
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20