arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.09533cs.DMcs.ITmath.ITquant-ph
收藏

多项式相交的最坏情况最优问题

On Worst-Case Optimal Polynomial Intersection

Stanford University(斯坦福大学)

Yihang Sun, Mary Wootters

AI总结:

本文研究了多项式相交问题的最坏情况最优解,证明了在素数域上存在比半圆定律更好的解,并展示了其在Max-LINSAT问题中的应用。

摘要:

最优多项式相交(OPI)问题是:给定集合S_1,…,S_m⊆F和评估点a_1,…,a_m∈F,寻找一个次数低于n的多项式Q∈F[x],使得Q(a_i)∈S_i对于尽可能多的i∈{1,2,…,m}。解码量子干涉度量(DQI)是一种量子算法,能高效返回良好的解,即使在最坏情况下(Jordan等,2025)。解的质量遵循半圆定律,优于已知的高效经典算法。但DQI是否能获得最佳解?即是否存在比半圆定律更好的解?令人惊讶的是,在此工作之前,最佳存在性结果与最佳算法性结果一致。本文证明了在素数域上存在更好的解。特别是DQI和半圆定律并非最优。例如,当列表S_i的大小为ρp,ρ≈1/2时,我们的结果表明,当n/m≥0.6225时,存在渐近优于半圆定律的解,并且当n/m≥0.7496时,存在渐近完美的解。我们的结果推广到由任何最大距离可分(MDS)码导出的Max-LINSAT问题,以及任何ρ∈(0,1)。关键见解是将本地泄漏抗性与秘密共享方案联系起来。在此过程中,我们恢复了若干重新证明了实现半圆定律解存在的证明。

英文摘要:

The Optimal Polynomial Intersection (OPI) problem is the following: Given sets $S_1, \ldots, S_m \subseteq \mathbb{F}$ and evaluation points $a_1, \ldots, a_m \in \mathbb{F}$, find a polynomial $Q \in \mathbb{F}[x]$ of degree less than $n$ so that $Q(a_i) \in S_i$ for as many $i \in \{1, 2, \ldots, m\}$ as possible. Decoded Quantum Interferometry (DQI) is a quantum algorithm that efficiently returns good solutions to the problem, even on worst-case instances (Jordan et. al., 2025). The quality of the solutions returned follows a semicircle law, which outperforms known efficient classical algorithms. But does DQI obtain the best possible solutions? That is, are there solutions better than the semicircle law for worst-case OPI instances? Surprisingly, before this work, the best existential results coincide with (and follow from) the best algorithmic results. In this work, we show that there are better solutions for worst-case OPI instances over prime fields. In particular, DQI and the semicircle law are not optimal. For example, when the lists $S_i$ have size $ρp$ for $ρ\sim 1/2$, our results imply the existence of a solution that asymptotically beats the semicircle law whenever $n/m \geq 0.6225$, and we show that an asymptotically perfect solution exists whenever $n/m \geq 0.7496$. Our results generalize to Max-LINSAT problems derived from any Maximum Distance Separable (MDS) code, and to any $ρ\in (0,1)$. The key insight to our improvement is a connection to local leakage resilience of secret sharing schemes. Along the way, we recover several re-proofs of the existence of solutions achieving the semicircle law.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑