A preconditioned inexact infeasible quantum interior point method improves the condition number of the normal equations from O(1/μ^2) to O(1/μ), yielding better QLSA query complexity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A preconditioned inexact infeasible quantum interior point method for linear optimization
A preconditioned inexact infeasible quantum interior point method improves the condition number of the normal equations from O(1/μ^2) to O(1/μ), yielding better QLSA query complexity.