Convex optimization using quantum oracles
We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracles, and we examine the efficiency of reductions between the different oracles. In particular, we show how a separation or...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2020-01-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2020-01-13-220/pdf/ |