Quantum SDP-Solvers: Better upper and lower bounds
Brandão and Svore \cite{brandao2016QSDPSpeedup} recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithms in terms of the dimension $n$ of the problem and the number $m$ of constraints, but worse in...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2020-02-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2020-02-14-230/pdf/ |