Direct evaluation of pure graph state entanglement
Direct evaluation of pure graph state entanglement
复制标题
DOI：
10.1088/1367-2630/15/1/013039
复制
发表时间：
2012-07
影响因子：
3.3
通讯作者：
Michal Hajduvsek;M. Murao
中科院分区：
文献类型：
--
作者：
Michal Hajduvsek;M. Murao
我们解决的问题量化纠缠纯图状态。对于大多数纯量子态来说，多体纠缠度量的评估是极其困难的。在本文中，我们演示了如何解决图论中的一个问题，即确定一个最大的独立集，使我们能够评估纯图状态的三个多体纠缠措施。我们构造的最小线性分解成产品状态的一大群纯图状态，使我们能够评估的施密特措施。此外，我们表明，距离的措施，如相对熵的纠缠和几何措施的计算变得容易为这些国家的明确建设的最近可分和最近的产品状态，分别。我们展示了如何使用稳定器的形式主义，以及预计纠缠对建设这些可分离的状态。最后，我们讨论了如何将噪声引入到系统中可以最佳地破坏纠缠。
We address the question of quantifying entanglement in pure graph states. The evaluation of multipartite entanglement measures is extremely difficult for most pure quantum states. In this paper, we demonstrate how solving one problem in graph theory, namely the identification of a maximum independent set, allows us to evaluate three multipartite entanglement measures for pure graph states. We construct the minimal linear decomposition into product states for a large group of pure graph states, allowing us to evaluate the Schmidt measure. Furthermore, we show that the computation of distance-like measures such as relative entropy of entanglement and geometric measure becomes tractable for these states by the explicit construction of the closest separable and closest product states, respectively. We show how these separable states can be described using stabilizer formalism as well as projected entangled pairs-like construction. Finally, we discuss how introducing noise into the system can optimally destroy entanglement.