AI 中文总结
该研究将经典电路编译为容错电路，据此构造出查询复杂度为多对数级的NP类问题PCP，为量子PCP的容错构造路线图提供了有前景的候选方案。
AI 中文摘要
我们展示了如何将任意经典电路编译为容错电路，该电路即使在每个时间步都有几乎线性数量的比特被对手刻意选择并损坏的情况下，仍能执行所需计算。利用该容错方案仅检测（而非纠正）损坏的变体，我们为NP类问题构造了一种查询复杂度为多对数级的新型概率可检验证明（PCP）。这种从容错出发的PCP构造，为Anshu、Breuckmann和Nguyen（STOC'24）的工作所提出的量子PCP容错构造路线图提供了有前景的候选方案。
英文摘要
We show how to compile an arbitrary classical circuit into a fault-tolerant circuit, which performs the desired computation even when an almost-linear number of bits are adversarially chosen and corrupted in each timestep. Using a variant of this fault-tolerance scheme that only detects (rather than corrects) corruptions, we give a new construction of probabilistically checkable proofs (PCPs) for NP with polylogarithmic query complexity. This PCP construction from fault-tolerance presents a promising candidate for quantization by the work of Anshu, Breuckmann, and Nguyen (STOC'24), who provided a roadmap for constructing quantum PCPs via fault-tolerance.
