arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.09319quant-phcs.ITmath.IT
收藏

量子通道的单位arity估计

Unitarity estimation for quantum channels

Institute of Software, Chinese Academy of Sciences(中国科学院软件研究所);University of Chinese Academy of Sciences(中国科学院大学);Graduate School of Mathematics, Nagoya University(名古屋大学数学研究院);Department of Computer Science and Technology, Tsinghua University(清华大学计算机科学与技术系)

Kean Chen, Qisheng Wang, Peixun Long, Mingsheng Ying

AI总结:

本文提出了一种统一的量子通道单位arity估计框架,通过相干和非相干访问分别获得最优查询复杂性算法。

摘要:

估计未知量子通道E的单位arity提供了关于其多少是单位ary的信息,这是量子设备认证和基准测试中的基本且重要的问题。单位arity估计可以通过相干或非相干访问进行,其中前者通常导致更好的查询复杂性,而后者允许更实际的实现。在本文中,我们提供了一个统一的框架用于单位arity估计,这诱导了ancilla高效的算法,这些算法使用O(ε⁻²)和O(√d·ε⁻²)次调用E,分别对应于相干和非相干访问,其中d是E所作用的系统的维度,ε是所需精度。我们进一步证明了我们的算法的d依赖性和ε依赖性都是最优的。作为我们的结果的一部分,我们通过给出匹配的下界Ω(√d),解决了非相干访问下退极化和单位ary通道的区分问题的查询复杂性,改进了Aharonov等人(Nat. Commun. 2022)和Chen等人(FOCS 2021)之前的最佳下界Ω(d¹/³)。

英文摘要:

Estimating the unitarity of an unknown quantum channel $\mathcal{E}$ provides information on how much it is unitary, which is a basic and important problem in quantum device certification and benchmarking. Unitarity estimation can be performed with either coherent or incoherent access, where the former in general leads to better query complexity while the latter allows more practical implementations. In this paper, we provide a unified framework for unitarity estimation, which induces ancilla-efficient algorithms that use $O(ε^{-2})$ and $O(\sqrt{d}\cdotε^{-2})$ calls to $\mathcal{E}$ with coherent and incoherent accesses, respectively, where $d$ is the dimension of the system that $\mathcal{E}$ acts on and $ε$ is the required precision. We further show that both the $d$-dependence and $ε$-dependence of our algorithms are optimal. As part of our results, we settle the query complexity of the distinguishing problem for depolarizing and unitary channels with incoherent access by giving a matching lower bound $Ω(\sqrt{d})$, improving the prior best lower bound $Ω(\sqrt[3]{d})$ by Aharonov et al. (Nat. Commun. 2022) and Chen et al. (FOCS 2021).

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

↑