A quantum central path algorithm for linear optimization
The Quantum Central Path Method (QCPM) proposes a quantum algorithm to solve linear optimization problems by simulating the central path of an iterative method. It uses a time-dependent Schrödinger equation to find an epsilon-optimal solution in O(sqrt(m + n) R1 / epsilon) queries, achieving polynomial speedups over classical and existing quantum interior point methods without needing QRAM.