arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.11015quant-phcs.CR
收藏

基于过滤的平均格点问题变式的量子算法

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering

Yilei Chen, Qipeng Liu, Mark Zhandry

摘要:

(*)无穷范数下的短整数解(SIS)问题,其中公共矩阵很宽,模是多项式大素数,无穷范数的界设为模的一半减去一个常数.(*)给定具有多项式大模和某些误差分布(包括有界均匀分布和拉普拉斯分布)的LWE类量子态的带误差学习(LWE)问题。(*)具有某些参数的外推二面角陪集问题(EDCP)。SIS、LWE和EDCP问题在其标准形式下与解决最坏情况下的格点问题一样困难。然而,我们可以解决的变量并不像解决最坏情况的晶格问题那样困难。尽管如此,没有经典或量子多项式时间算法已知的SIS和LWE的变种,我们考虑。对于EDCP,我们的量子算法稍微扩展了Ivanyos等人的结果。我们的算法的SIS和EDCP的变种使用现有的量子减少从这些问题的LWE,或更准确地说,解决LWE的问题,LWE的量子态。我们的主要贡献是利用滤波技术求解具有感兴趣参数的类LWE量子态。

英文摘要:

We show polynomial-time quantum algorithms for the following problems: (*) Short integer solution (SIS) problem under the infinity norm, where the public matrix is very wide, the modulus is a polynomially large prime, and the bound of infinity norm is set to be half of the modulus minus a constant. (*) Learning with errors (LWE) problem given LWE-like quantum states with polynomially large moduli and certain error distributions, including bounded uniform distributions and Laplace distributions. (*) Extrapolated dihedral coset problem (EDCP) with certain parameters. The SIS, LWE, and EDCP problems in their standard forms are as hard as solving lattice problems in the worst case. However, the variants that we can solve are not in the parameter regimes known to be as hard as solving worst-case lattice problems. Still, no classical or quantum polynomial-time algorithms were known for the variants of SIS and LWE we consider. For EDCP, our quantum algorithm slightly extends the result of Ivanyos et al. (2018). Our algorithms for variants of SIS and EDCP use the existing quantum reductions from those problems to LWE, or more precisely, to the problem of solving LWE given LWE-like quantum states. Our main contribution is solving LWE given LWE-like quantum states with interesting parameters using a filtering technique.

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

↑