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

保真度估计的量子算法

Quantum Algorithm for Fidelity Estimation

Qisheng Wang, Zhicheng Zhang, Kean Chen, Ji Guan, Wang Fang, Junyi Liu, Mingsheng Ying

摘要:

对于$N$维希尔伯特空间中的两个未知混合量子态$ρ$和$σ$,计算它们的保真度$F(ρ,σ)$是量子计算和量子信息中具有许多重要应用的基本问题,例如量子计算机输出的验证和表征,以及量子算法的设计和分析。在本文中,我们提出了一个量子算法,解决了这个问题在$\operatorname{poly}(\log (N), r, 1/\varepsilon)$时间,其中$r$是较低的秩$ρ$和$σ$,和$\varepsilon$是所需的精度,提供的纯化$ρ$和$σ$是由量子预言机准备。该算法表现出指数加速比最知名的算法(基于量子态层析成像),其时间复杂度在$N$多项式。

英文摘要:

For two unknown mixed quantum states $ρ$ and $σ$ in an $N$-dimensional Hilbert space, computing their fidelity $F(ρ,σ)$ is a basic problem with many important applications in quantum computing and quantum information, for example verification and characterization of the outputs of a quantum computer, and design and analysis of quantum algorithms. In this paper, we propose a quantum algorithm that solves this problem in $\operatorname{poly}(\log (N), r, 1/\varepsilon)$ time, where $r$ is the lower rank of $ρ$ and $σ$, and $\varepsilon$ is the desired precision, provided that the purifications of $ρ$ and $σ$ are prepared by quantum oracles. This algorithm exhibits an exponential speedup over the best known algorithm (based on quantum state tomography) which has time complexity polynomial in $N$.

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

↑