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

量子序贯假设检验

Quantum Sequential Hypothesis Testing

Esteban Martínez-Vargas, Christoph Hirche, Gael Sentís, Michalis Skotiniotis, Marta Carrizo, Ramon Muñoz-Tapia, John Calsamiglia

摘要:

我们介绍了顺序分析在量子信息处理,通过集中在量子假设检验的基本任务。特别是,我们的目标是区分两个任意的量子态与规定的错误阈值,$ε$,当副本的状态可以要求的需求。我们得到最终的下限的平均副本数量需要完成任务。我们给出了一个块采样策略,允许实现某些类别的状态的下限。在对称和非对称设置中,该界限都是最优的,因为它需要所有其他程序中最少的平均拷贝数,包括提前固定拷贝数的程序。对于量子比特状态,我们推导出显式表达式的最小平均副本数,并表明,一个顺序的策略,基于固定的本地测量优于最好的集体测量的预定数量的副本。而对于一般状态,拷贝数随着$\log 1/ε$而增加,对于纯状态,即使在完全区分的情况下,顺序策略也需要有限的平均样本数,即,$ε=0$。

英文摘要:

We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular our goal is to discriminate between two arbitrary quantum states with a prescribed error threshold, $ε$, when copies of the states can be required on demand. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. We give a block-sampling strategy that allows to achieve the lower bound for some classes of states. The bound is optimal in both the symmetric as well as the asymmetric setting in the sense that it requires the least mean number of copies out of all other procedures, including the ones that fix the number of copies ahead of time. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement on a predetermined number of copies. Whereas for general states the number of copies increases as $\log 1/ε$, for pure states sequential strategies require a finite average number of samples even in the case of perfect discrimination, i.e., $ε=0$.

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

↑