arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.00752quant-phcs.CCcs.ITmath.IT
收藏

关于量子Tsallis相对熵的估计

On Estimating the Quantum Tsallis Relative Entropy

School of Informatics, University of Edinburgh(爱丁堡大学信息学院);Institute of Software, CAS(中国科学院软件研究所);School of Computer Science, Shanghai Jiao Tong University(上海交通大学计算机科学与技术学院)

Jinge Bao, Minbo Gao, Qisheng Wang

AI总结:

本文研究了量子Tsallis相对熵的估计方法,提出了一种在量子Hellinger距离下容忍认证的高效算法,并展示了相关问题在计算复杂性方面的完备性。

摘要:

量子状态之间的相对熵量化了它们的可区分性。在文献中,某些相对熵的估计已被研究,例如冯·诺依曼相对熵和夹心瑞尼里相对熵。在本文中,我们对量子Tsallis相对熵的估计进行了全面研究。我们证明,对于任何常数α∈(0,1),两个秩为r的量子状态之间的α-Tsallis相对熵可以以样本复杂度poly(r)进行估计,如果已知其状态制备电路,可以使其更高效。作为应用,我们获得了一种在量子Hellinger距离下对量子态进行容忍认证的方法,其样本复杂度为~O(r^{3.5}),当r是量子比特数的多项式函数时,这比基于量子态重构的传统方法指数级更优。此外,我们还表明,在一定范围内,相对于量子α-Tsallis相对熵和量子Hellinger距离的量子态可区分性问题在某些情况下是QSZK-完全的,在低秩情况下是BQP-完全的。

英文摘要:

The relative entropy between quantum states quantifies their distinguishability. The estimation of certain relative entropies has been investigated in the literature, e.g., the von Neumann relative entropy and sandwiched Rényi relative entropy. In this paper, we present a comprehensive study of the estimation of the quantum Tsallis relative entropy. We show that for any constant $α\in (0, 1)$, the $α$-Tsallis relative entropy between two quantum states of rank $r$ can be estimated with sample complexity $\operatorname{poly}(r)$, which can be made more efficient if we know their state-preparation circuits. As an application, we obtain an approach to tolerant quantum state certification with respect to the quantum Hellinger distance with sample complexity $\widetilde{O}(r^{3.5})$, which exponentially outperforms the folklore approach based on quantum state tomography when $r$ is polynomial in the number of qubits. In addition, we show that the quantum state distinguishability problems with respect to the quantum $α$-Tsallis relative entropy and quantum Hellinger distance are $\mathsf{QSZK}$-complete in a certain regime, and they are $\mathsf{BQP}$-complete in the low-rank case.

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

↑