research
∙
12/06/2022
Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model
We consider the LOCAL model of distributed computing, where in a single ...
share
research
∙
03/16/2021
Tight Bounds for Inverting Permutations via Compressed Oracle Arguments
In his seminal work on recording quantum queries [Crypto 2019], Zhandry ...
research
∙
07/11/2019
Quantum and Classical Algorithms for Approximate Submodular Function Minimization
Submodular functions are set functions mapping every subset of some grou...
research
∙
02/19/2019
A Tight Lower Bound for Index Erasure
The Index Erasure problem asks a quantum computer to prepare a uniform s...
research
∙
10/25/2018
Quantum Advantage for the LOCAL Model in Distributed Computing
There are two central models considered in (fault-free synchronous) dist...
research
∙
12/29/2017