Gleipnir: toward practical error analysis for Quantum programs
Gleipnir: toward practical error analysis for Quantum programs
复制标题
DOI：
10.1145/3453483.3454029
复制
发表时间：
2021-04
期刊：
影响因子：
--
通讯作者：
Runzhou Tao;Yunong Shi;Jianan Yao;J. Hui;F. Chong;Ronghui Gu
中科院分区：
文献类型：
--
作者：
Runzhou Tao;Yunong Shi;Jianan Yao;J. Hui;F. Chong;Ronghui Gu
实用的误差分析是设计，优化和评估的噪声中间尺度量子（NISQ）计算的必要条件。然而，量子程序中的边界错误是一个巨大的挑战，因为量子错误的影响取决于指数级大的量子态。在这项工作中，我们提出了Gleipnir，一种新的方法对实际计算验证的误差范围在量子程序。Gleipnir引入了（ρ，δ）-diamond范数，这是一个由近似态ρ及其到理想态ρ的距离δ组成的量子谓词约束的误差度量。该谓词（ρ，δ）可以使用基于矩阵乘积状态的张量网络自适应地计算。Gleipnir提供了一个轻量级的逻辑，用于基于（ρ，δ）-diamond范数度量来推理噪声量子程序中的误差界。我们的实验结果表明，Gleipnir能够有效地为10到100个量子位的真实世界量子程序生成严格的错误边界，并可用于评估量子编译器转换的错误缓解性能。
Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.