W态和GHZ态的计算能力
The Computational Power of the W and GHZ states
摘要：
众所周知，量子纠缠的使用显著增强了系统的计算能力。大部分的注意力都集中在贝尔态和他们的多体推广。然而，在多体情况下，已知有几种不等价的状态，例如W-状态和GHZ-状态所代表的状态。我们的主要贡献是一个示范的特殊的计算能力，这些国家的背景下，从经典的分布式计算的范式问题。具体地说，我们证明了W态是唯一可以用来精确解决匿名量子网络中领导选举问题的纯态。同样，我们表明，GHZ状态是唯一一个可以用来解决分布式共识的问题时，没有经典的后处理被认为是。这些结果推广到一个家庭的W-和GHZ类状态。这些不可能结果的证明核心在于对称性论证。
英文摘要：
It is well understood that the use of quantum entanglement significantly enhances the computational power of systems. Much of the attention has focused on Bell states and their multipartite generalizations. However, in the multipartite case it is known that there are several inequivalent classes of states, such as those represented by the W-state and the GHZ-state. Our main contribution is a demonstration of the special computational power of these states in the context of paradigmatic problems from classical distributed computing. Concretely, we show that the W-state is the only pure state that can be used to exactly solve the problem of leader election in anonymous quantum networks. Similarly we show that the GHZ-state is the only one that can be used to solve the problem of distributed consensus when no classical post-processing is considered. These results generalize to a family of W- and GHZ-like states. At the heart of the proofs of these impossibility results lie symmetry arguments.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
