对任意量子计算正确实现的信心获取
Gaining confidence on the correct realization of arbitrary quantum computations
AI总结：
本文提出验证协议，利用匹配门计算的可模拟性及额外资源，结合弱模拟、随机编译和经典统计，设计出与原电路相似且可在有错误时高效模拟的验证电路，以增强对任意量子计算正确实现的信心。
摘要：
我们提出验证协议，以增强对任意通用量子计算实现正确性能的信心。这些协议的推导基于这样一个事实：匹配门计算在经典上可高效模拟，但若补充额外资源则变得通用。我们结合弱模拟、随机编译和经典统计工具来推导验证电路。这些电路具有以下性质：（i）它们与原电路高度相似，（ii）不仅能在理想（即无错误）场景中被经典高效模拟，而且能在存在错误的现实情况下被模拟。实际上，在其中一个协议中，我们应用了与原计算完全相同的电路，但作用于一个略微修改的输入态。
英文摘要：
We present verification protocols to gain confidence in the correct performance of the realization of an arbitrary universal quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and classical statistics to derive verification circuits. These circuits have the property that (i) they strongly resemble the original circuit and (ii) cannot only be classically efficiently simulated in the ideal, i.e. error free, scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
