Please use this identifier to cite or link to this item:
|Title:||Bound entanglement in tree graphs|
|Citation:||Kay, A. (2010-12-10). Bound entanglement in tree graphs. Journal of Physics A: Mathematical and Theoretical 43 (49) : -. ScholarBank@NUS Repository. https://doi.org/10.1088/1751-8113/43/49/495301|
|Abstract:||In this paper, we discuss the entanglement properties of graph-diagonal states, with particular emphasis on calculating the threshold for the transition between the presence and absence of entanglement (i.e. the separability point). Special consideration is made of the thermal states of trees, including the linear cluster state. We characterize the type of entanglement present, and describe the optimal entanglement witnesses and their implementation on a quantum computer, up to an additive approximation. In the case of general graphs, we invoke a relationwith the partition function of the classical Ising model, thereby intimating a connection to computational complexity theoretic tasks. Finally, we show that the entanglement is robust to some classes of local perturbations. © 2010 IOP Publishing Ltd.|
|Source Title:||Journal of Physics A: Mathematical and Theoretical|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 9, 2018
WEB OF SCIENCETM
checked on May 28, 2018
checked on Mar 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.