Quantum query complexity of symmetric oracle problems
We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, and we find a description of the optimal success probability of a $t$-query quantum algorithm in terms of group characters. A...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2021-03-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2021-03-07-403/pdf/ |