Arboreal Bound Entanglement
arXiv:1008.2316 · doi: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 characterise 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 relation with 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.
9 pages + appendices, 3 figures
References in corpus (13)
- Entanglement detection
- Multi-party entanglement in graph states
- Detecting Genuine Multipartite Entanglement with Two Local Measurements
- Entanglement Detection in the Stabilizer Formalism
- Identifying phases of quantum many-body systems that are universal for quantum computation
- Detecting multipartite entanglement
- State Transfer and Spin Measurement
- On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
- Optimal purification of thermal graph states
- How long can a quantum memory withstand depolarizing noise?
- A Witness of Multipartite Entanglement Strata
- Multipartite purification protocols: upper and optimal bounds
- Weight of quadratic forms and graph states