1 citations · 1 across the 1 of their papers we have counts for
1 paper
Aleksandrs Belovs, Ansis Rosmanis
We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only requir…