论文标题
查找最大量子资源
Finding maximal quantum resources
论文作者
论文摘要
对于许多应用，量子优势的存在至关重要地取决于机智状态的可用性。尽管资源通常取决于特定任务，但在多方系统的上下文中，纠结的量子状态通常被认为是足智多谋的。我们提出了一种算法方法，以找到用于各种应用和量词的几个粒子的最大足智多谋的状态。我们详细讨论了几何措施的情况，识别身体上有趣的状态并为绝对最大纠缠状态的问题提供见解。此外，我们通过将其应用于最大纠缠的子空间，施密特级，稳定器等级以及三角网络中的准备性来证明我们的方法的普遍性。
For many applications the presence of a quantum advantage crucially depends on the availability of resourceful states. Although the resource typically depends on the particular task, in the context of multipartite systems entangled quantum states are often regarded as resourceful. We propose an algorithmic method to find maximally resourceful states of several particles for various applications and quantifiers. We discuss in detail the case of the geometric measure, identifying physically interesting states and delivering insights to the problem of absolutely maximally entangled states. Moreover, we demonstrate the universality of our approach by applying it to maximally entangled subspaces, the Schmidt-rank, the stabilizer rank as well as the preparability in triangle networks.
