A. Rosmanis

activity

20122022

most citedOn the Power of Non-Adaptive Learning Graphs

1 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing quant-phShow all

2 papers · 1 filter

quant-ph2020

Quantum Coupon Collector

Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs +3

We study how efficiently a $k$ -element set $S \subseteq [n]$ can be learned from a uniform superposition $∣ S ⟩$ of its elements. One can think of $|S\rangle=\sum_{i\in S}|i\rang…

quant-ph2012★ 1 cited

On the Power of Non-Adaptive Learning Graphs

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…