Quantum advantage under spectral discretization for analytic Young-measure densities

Less than 1 year old · traced to

Let d≥2d\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 ndet⁡n_{\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⁡∼ε−d∣log⁡ε∣2d,QCPdet⁡∼O~ ⁣(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 d≥2d\geq2. In the stochastic case with NωrN_\omega^r free, the advantage condition should be Nωr≳ε−(d−2)N_\omega^r\gtrsim\varepsilon^{-(d-2)}, and is therefore satisfied for all d≥2d\geq2 and r≥1r\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.

References

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.