A quantum algorithm solves SOCPs with O~(√r γ^5 + √m γ^4) queries and a classical algorithm uses O~(n γ^4 + m γ^6) samples, nearly matching LP complexity.
The power of block-encoded matrix powers: Improved regression techniques via faster hamiltonian simulation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum and classical algorithms for SOCP based on the multiplicative weights update method
A quantum algorithm solves SOCPs with O~(√r γ^5 + √m γ^4) queries and a classical algorithm uses O~(n γ^4 + m γ^6) samples, nearly matching LP complexity.