AF: Small: The Power of Randomness in Decision and Verification

AF：小：决策和验证中随机性的力量

• 批准号: 2312540
• 负责人: Dieter van Melkebeek
• 金额: $ 60万
• 依托单位: University of Wisconsin-Madison
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-05-01 至 2026-04-30
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2312540&HistoricalAwards=false
• 关键词: AF; Small; Power; Randomness; Decision

The ability to make random choices seems to simplify several computational tasks. For example, in order to decide whether two formulas like x*x-y*y and (x+y)*(x-y) are equivalent, one can merely plug in random values for x and y and verify whether the two formulas yield the same value. Even for complicated formulas, this is a reliable strategy, easier than manipulating the abstract formulas. A more involved use of randomness consists of a way to spot-check computations that requires significantly less effort than performing the computations themselves---a feature of paramount importance in the day and age of delegating computations to the cloud. This project investigates the potential of achieving similar efficiency in decision and verification without randomness. It incorporates graduate and undergraduate training and education, and includes the development of a textbook that makes computational thinking and the area of quantum algorithms more accessible to a broader public.The project explores two new directions in the area of derandomization. In the setting of polynomial-time decision procedures with bounded error (i.e., bounded-error probabilistic polynomial time class, BPP), the investigators propose a principled approach towards derandomizing Polynomial Identity Testing (PIT) based on the notion of a vanishing ideal. PIT captures the above formula equivalence problem and plays a central role in the area of derandomization as known results suggest that derandomizing PIT may enable derandomizing all of BPP. The investigators already characterized the vanishing ideal of a widely used pseudorandom generator for PIT, plan to develop the approach for other generators, and to research the ramifications. In the setting of polynomial-time interactive verification processes known as Arthur-Merlin (AM) protocols, the investigators want to further develop the connections between lower bounds and derandomization, in particular by adapting to the setting of AM the instance-wise connection that was recently established for the setting of BPP.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

做出随机选择的能力似乎简化了一些计算任务。例如，为了确定 x*x-y*y 和 (x+y)*(x-y) 等两个公式是否等效，只需为 x 和 y 插入随机值并验证这两个公式是否产生相同的值。即使对于复杂的公式，这也是一种可靠的策略，比操作抽象公式更容易。随机性的更复杂的使用包括一种抽查计算的方法，这种方法比执行计算本身需要的工作量要少得多——在将计算委托给云的时代，这是一个至关重要的功能。该项目研究了在没有随机性的情况下在决策和验证中实现类似效率的潜力。它结合了研究生和本科生的培训和教育，并包括编写一本教科书，使计算思维和量子算法领域更容易为更广泛的公众所了解。该项目探索了去随机化领域的两个新方向。在具有有界误差的多项式时间决策程序（即有界误差概率多项式时间类，BPP）的设置中，研究人员提出了一种基于理想消失概念的去随机化多项式恒等测试（PIT）的原则方法。 PIT 解决了上述公式等价问题，并在去随机化领域发挥着核心作用，因为已知结果表明，去随机化 PIT 可以使所有 BPP 去随机化。研究人员已经描述了广泛使用的 PIT 伪随机生成器的消失理想，计划开发其他生成器的方法，并研究其后果。在被称为 Arthur-Merlin (AM) 协议的多项式时间交互式验证过程的设置中，研究人员希望进一步开发下限和去随机化之间的联系，特别是通过适应 AM 的设置，即实例级连接最近为 BPP 的设置而设立。该奖项反映了 NSF 的法定使命，并且通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。