Florian Speelman

Quantum communication complexity advantage implies violation of a Bell inequality

Harry Buhrman, Łukasz Czekaj, Andrzej Grudka et al. · Proceedings of the National Academy of Sciences · 2016 · 57 citations · Full text

Computing, Communication, Physics +17

Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach

Jordi R. Weggemans, Alexander Urech, Alexander Rausch et al. · Quantum · 2022 · 46 citations · Full text

Computing, Computer Science, Physics +17

Computing with a full memory

Harry Buhrman, Richard Cleve, Michal Koucký et al. · 2014 · 38 citations · Full text

Computing, Computer Science, Algorithms +10

Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits

Florian Speelman · Research at the University of Copenhagen (University of Copenhagen) · 2016 · 19 citations · Full text

Computing, Computer Science, Physics +16

Towards a Reverse Newman's Theorem in Interactive Information Complexity

Joshua Brody, Harry Buhrman, Michal Koucký et al. · 2013 · 17 citations · Full text

Computing, Computer Science, Mathematics +14