| Quantum Homomorphic Encryption for Polynomial-Size Circuits Y Dulek, C Schaffner, F Speelman Theory of Computing 14 (7), 1-45, 2018 | 119 | 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 | 63 | 2016 |
| Computing with a full memory: Catalytic space H Buhrman, R Cleve, M Koucký, B Loff, F Speelman STOC '14, 857-866, 2014 | 58 | 2014 |
| The garden-hose model H Buhrman, S Fehr, C Schaffner, F Speelman ITCS 2013 - 4th conference on Innovations in Theoretical Computer Science …, 2013 | 52* | 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 | 49 | 2017 |
| Asymptotic performance of port-based teleportation M Christandl, F Leditzky, C Majenz, G Smith, F Speelman, M Walter Communications in Mathematical Physics, 2020 | 43 | 2020 |
| Instantaneous non-local computation of low T-depth quantum circuits F Speelman TQC 2016 - 11th Conference on the Theory of Quantum Computation …, 2016 | 43 | 2016 |
| 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 | 32 | 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 | 31* | 2021 |
| 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 | 22* | 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 | 21 | 2016 |
| 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 | 12 | 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 | 11 | 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 | 9 | 2018 |
| Position-based quantum cryptography and the garden-hose game F Speelman arXiv preprint arXiv:1210.4353, 2011 | 8 | 2011 |
| Relating non-local quantum computation to information theoretic cryptography R Allerstorfer, H Buhrman, A May, F Speelman, PV Lunel Quantum 8, 1387, 2024 | 7 | 2024 |
| On the role of quantum communication and loss in attacks on quantum position verification R Allerstorfer, H Buhrman, F Speelman, PV Lunel arXiv preprint arXiv:2208.04341, 2022 | 7 | 2022 |
| Towards practical and error-robust quantum position verification R Allerstorfer, H Buhrman, F Speelman, PV Lunel arXiv preprint arXiv:2106.12911, 2021 | 6* | 2021 |
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoft在 quantinuum.com 的电子邮件经过验证
