10 citations · 13 across the 4 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
quant-ph2004
Exact quantum query complexity for total Boolean functions
Gatis Midrijanis
We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorit…
quant-ph2004★ 3 cited
A polynomial quantum query lower bound for the set equality problem
Gatis Midrijanis
The set equality problem is to tell whether two sets and are equal or disjoint under the promise that one of these is the case. This problem is related to the Graph Isomorp…