Quantum advantage under spectral discretization for analytic Young-measure densities

Let d2d\geq 2, let νx,y(ξ)\nu_{x,y}(\xi) be a Young-measure density analytic in xx and yy, discretize ξ\xi algebraically at Nξε1N_\xi\sim\varepsilon^{-1}, and suppose R1R_1 is polynomially bounded in logε|\log\varepsilon|. At fine-scale accuracy δ=ε\delta=\varepsilon, write ndetn_{\rm \det} for the resulting deterministic LP size and QCPdet\mathrm{QCP}_{\rm \det} for the quantum central path cost. Quantum advantage under spectral discretization. One should have

ndetεdlogε2d,QCPdetO~ ⁣(R1ε(1+d/2)logεd),n_{\rm \det}\sim\varepsilon^{-d}|\log\varepsilon|^{2d},\qquad \mathrm{QCP}_{\rm \det}\sim\widetilde O\!\bigl(R_1\,\varepsilon^{-(1+d/2)}|\log\varepsilon|^{d}\bigr),

with this improving over direct classical solvers at cost O~(εd)\widetilde O(\varepsilon^{-d}) for all d2d\geq2. In the stochastic case with NωrN_\omega^r free, the advantage condition should be Nωrε(d2)N_\omega^r\gtrsim\varepsilon^{-(d-2)}, and is therefore satisfied for all d2d\geq2 and r1r\geq1. This proposes a quantum advantage when the density is analytic in the macroscopic and microscale spatial variables, replacing algebraic spatial resolution by spectral resolution; the source gives no proof or status evidence for these complexity estimates.

Sources & referencesView supporting material

Primary source

Siqi Chen, Shi Jin and Lei Zhang, “Young Measure Based Quantum Linear Programming Algorithms for Nonlinear/Stochastic Multiscale Partial Differential Equations and Homogenization”, arXiv:2606.06165 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.