在噪声设备上以最小开销实现BQP计算
Verifying BQP Computations on Noisy Devices with Minimal Overhead
摘要：
随着委托量子计算的发展，客户将希望确保其数据和算法的机密性以及计算的完整性。虽然存在盲和可验证的量子计算协议，但它们存在高开销和过度敏感的问题：当在嘈杂的设备上运行时，不完美会触发与恶意攻击相同的检测机制，导致永久中止计算。我们介绍了第一个盲和可验证的协议，用于将BQP计算委托给功能强大的服务器，重复作为唯一的开销。它是可组合的，具有指数下界的统计安全性，并且可以容忍恒定量的全局噪声。
英文摘要：
With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms, and the integrity of their computations. While protocols for blind and verifiable quantum computation exist, they suffer from high overheads and from over-sensitivity: When running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations. We introduce the first blind and verifiable protocol for delegating BQP computations to a powerful server with repetition as the only overhead. It is composable and statistically secure with exponentially-low bounds and can tolerate a constant amount of global noise.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
