arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.15993quant-ph
收藏

用于保真度估计的改进量子算法

Improved Quantum Algorithms for Fidelity Estimation

András Gilyén, Alexander Poremba

摘要:

保真度是两个量子态接近程度的基本度量,从理论和实践的角度来看都是重要的。然而,在一般情况下,很难给出保真度的良好估计,特别是当一个工作与混合状态在希尔伯特空间的非常高的维度。虽然在保真度估计方面已经取得了一些进展,但所有先前的工作要么需要大量相同的相关状态副本,要么依赖于未经证实的统计学。在这项工作中,我们通过开发新的和有效的量子算法的保真度估计与可证明的性能保证的情况下,至少有一个状态是近似低秩的这两个方面进行改进。我们的算法使用先进的量子线性代数技术,如量子奇异值变换,以及密度矩阵幂和量子频谱采样。作为一个补充的结果,我们证明了保真度估计任何非平凡的常数添加剂的准确性是很难在一般情况下,通过给出一个样本的复杂性下界,多项式依赖于尺寸。此外,如果电路描述的相关状态,我们表明,任务是很难的复杂性类称为(诚实的验证者)量子统计零知识通过减少密切相关的结果Watrous。

英文摘要:

Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one works with mixed states over Hilbert spaces of very high dimension. Although, there has been some progress on fidelity estimation, all prior work either requires a large number of identical copies of the relevant states, or relies on unproven heuristics. In this work, we improve on both of these aspects by developing new and efficient quantum algorithms for fidelity estimation with provable performance guarantees in case at least one of the states is approximately low-rank. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation, as well as density matrix exponentiation and quantum spectral sampling. As a complementary result, we prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general, by giving a sample complexity lower bound that depends polynomially on the dimension. Moreover, if circuit descriptions for the relevant states are provided, we show that the task is hard for the complexity class called (honest verifier) quantum statistical zero knowledge via a reduction to a closely related result by Watrous.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑