Hybrid quantum interior point methods for linear programming have no practical runtime advantage over classical solvers like HiGHS on realistic instances because their quantum lower bounds already exceed classical performance under optimistic assumptions.
An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Practical lower bounds for hybrid quantum interior point methods in linear programming
Hybrid quantum interior point methods for linear programming have no practical runtime advantage over classical solvers like HiGHS on realistic instances because their quantum lower bounds already exceed classical performance under optimistic assumptions.