arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.17439quant-phcs.CC
收藏

受限测量下的量子态测试

Quantum state testing with restricted measurements

Yuhan Liu, Jayadev Acharya

AI总结:

本文研究受限测量下的量子态测试,提出基于测量信息信道的信息论框架,统一给出非自适应测量的副本复杂度下界,并证明随机化测量方案优于固定方案。

摘要:

我们研究量子态测试问题,其目标是在给定 $n$ 份 $ρ$ 的副本以及已知态描述 $ρ_0$ 的情况下,判断是否 $ρ=ρ_0\in\mathbb{C}^{d\times d}$,或者 $\\|ρ-ρ_0\\|_1>\varepsilon$。在实践中,并非所有测量都能轻易实施,即使采用每份副本分别测量的非纠缠测量也是如此。我们建立了一个信息论框架,通过一种新颖的测量信息信道,为受限的非自适应测量族给出统一的副本复杂度下界。利用该框架,我们针对具有固定方案和随机化方案的一类自然的 $k$ 结果测量,得到了最优下界。我们展示了这两种方案之间的分离,揭示了随机化测量方案相对于固定方案的优势。此前,关于固定方案的结果很少,紧界仅在 $k\ge d$ 的随机化方案以及 Pauli 观测量(2 结果测量的一种特殊类别)情形下已知。我们的工作弥合了文献中的这一空白。

英文摘要:

We study quantum state testing where the goal is to test whether $ρ=ρ_0\in\mathbb{C}^{d\times d}$ or $\|ρ-ρ_0\|_1>\varepsilon$, given $n$ copies of $ρ$ and a known state description $ρ_0$. In practice, not all measurements can be easily applied, even using unentangled measurements where each copy is measured separately. We develop an information-theoretic framework that yields unified copy complexity lower bounds for restricted families of non-adaptive measurements through a novel measurement information channel. Using this framework, we obtain the optimal bounds for a natural family of $k$-outcome measurements with fixed and randomized schemes. We demonstrate a separation between these two schemes, showing the power of randomized measurement schemes over fixed ones. Previously, little was known for fixed schemes, and tight bounds were only known for randomized schemes with $k\ge d$ and Pauli observables, a special class of 2-outcome measurements. Our work bridges this gap in the literature.

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

↑