基于Legendre符号计算的经典和量子多项式重构
Classical and Quantum Polynomial Reconstruction via Legendre Symbol Evaluation
摘要:
我们考虑在p元有限域F上恢复一个d > 0次的隐一次多项式f(X)的问题,给定一个黑盒,对F中的任何x,该黑盒计算f(x)的二次特征。我们设计了一个复杂度为O(d^2p ^{d + c})的经典算法,对任意的c > 0,并且证明了该问题的量子查询复杂度为O(d).我们的一些结果推广了Wim van Dam,Sean Hallgren和Lawrence Ip在线性多项式f(X)= X + s(s未知)的情况下得到的结果;有些结果甚至在这种情况下也是新的。
英文摘要:
We consider the problem of recovering a hidden monic polynomial f(X) of degree d > 0 over the finite field F of p elements given a black box which, for any x in F, evaluates the quadratic character of f(x). We design a classical algorithm of complexity O(d^2 p^{d + c}), for any c > 0, and also show that the quantum query complexity of this problem is O(d). Some of our results extend those of Wim van Dam, Sean Hallgren and Lawrence Ip obtained in the case of a linear polynomial f(X) = X + s (with unknown s); some are new even in this case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。