区分可计算混合量子态
Distinguishing computable mixtures of quantum states
摘要：
在这篇文章中，我们从我们以前的工作[Bendersky，德拉托雷，Senno，Figueira和Acín，物理。116，230406（2016）]通过提供一种协议来在有限时间内以任意高的成功概率区分纯状态的任何算法混合与最大混合状态。此外，我们介绍了一个概念验证实验，包括在两个不同的纯态随机序列的情况下，准备这些序列是不可区分的，根据量子力学，但他们成为可区分的随机性被替换为伪随机性的准备过程中。
英文摘要：
In this article we extend results from our previous work [Bendersky, de la Torre, Senno, Figueira and Acín, Phys. Rev. Lett. 116, 230406 (2016)] by providing a protocol to distinguish in finite time and with arbitrarily high success probability any algorithmic mixture of pure states from the maximally mixed state. Moreover, we introduce a proof-of-concept experiment consisting in a situation where two different random sequences of pure states are prepared; these sequences are indistinguishable according to quantum mechanics, but they become distinguishable when randomness is replaced with pseudorandomness within the preparation process.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
