✦ LIBER ✦

Improved lower bounds on genuine-multipartite-entanglement concurrence

✍ Scribed by Chen, Zhi-Hua; Ma, Zhi-Hao; Chen, Jing-Ling; Severini, Simone

Book ID: 111904615
Publisher: The American Physical Society
Year: 2012
Tongue: English
Weight: 228 KB
Volume: 85
Category: Article
ISSN: 1050-2947
DOI: 10.1103/physreva.85.062320

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound of concurrence for multipa

A lower bound of concurrence for multipartite quantum states

✍ Li, Ming; Fei, Shao-Ming; Wang, Zhi-Xi 📂 Article 📅 2009 🏛 IOP Publishing 🌐 English ⚖ 129 KB

Determining lower bounds on a measure of

Determining lower bounds on a measure of multipartite entanglement from few local observables

✍ Wu, Jun-Yi; Kampermann, Hermann; Bruß, Dagmar; Klöckl, Claude; Huber, Marcus 📂 Article 📅 2012 🏛 The American Physical Society 🌐 English ⚖ 355 KB

Improved lower and upper bounds for enta

Improved lower and upper bounds for entanglement of formation

✍ Zhu, Xue-Na; Fei, Shao-Ming 📂 Article 📅 2012 🏛 The American Physical Society 🌐 English ⚖ 416 KB

Detect genuine multipartite entanglement

Detect genuine multipartite entanglement in the one-dimensional transverse-field Ising model

✍ Dong-Ling Deng; Shi-Jian Gu; Jing-Ling Chen 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Lower bounds on entanglement measures fr

Lower bounds on entanglement measures from incomplete information

✍ Gühne, O.; Reimpell, M.; Werner, R. F. 📂 Article 📅 2008 🏛 The American Physical Society 🌐 English ⚖ 221 KB

Improved lower bounds on k-independence

✍ Yair Caro; Zsolt Tuza 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

## Abstract A vertex set __Y__ in a (hyper)graph is called __k__‐independent if in the sub(hyper)‐graph induced by __Y__ every vertex is incident to less than __k__ edges. We prove a lower bound for the maximum cardinality of a __k__‐independent set—in terms of degree sequences—which strengthens an