56 citations · 210 across the 25 of their papers we have counts for
4 papers · 1 filter
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks
Harry Buhrman, Bruno Loff, Subhasree Patro +1
Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5…
Towards practical and error-robust quantum position verification
Rene Allerstorfer, Harry Buhrman, Florian Speelman +1
Loss of inputs can be detrimental to the security of quantum position verification (QPV) protocols, as it may allow attackers to not answer on all played rounds, but only on those…
A Guide for New Program Committee Members at Theoretical Computer Science Conferences
Yfke Dulek, Stacey Jeffery, Christian Majenz +3
In theoretical computer science, conferences play an important role in the scientific process. The decisions whether to accept or reject articles is taken by the program committee…
A single-qubit position verification protocol that is secure against multi-qubit attacks
Andreas Bluhm, Matthias Christandl, Florian Speelman
The position of a device or agent is an important security credential in today's society, both online and in the real world. Unless in direct proximity, however, the secure verific…