✦ LIBER ✦

A tight lower bound on the classical communication cost of entanglement dilution

✍ Scribed by Harrow, A.W.; Hoi-Kwong Lo

Book ID: 114637518
Publisher: IEEE
Year: 2004
Tongue: English
Weight: 239 KB
Volume: 50
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2003.822597

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tight lower bound on the size of visib

A tight lower bound on the size of visibility graphs

✍ Xiaojun Shen; Herbert Edelsbrunner 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 451 KB

A Lower Bound on the Entanglement in the

A Lower Bound on the Entanglement in the Jaynes–Cummings Model

✍ Jin-Fang, Cai; Jian, Zou 📂 Article 📅 2005 🏛 Institute of Physics 🌐 English ⚖ 366 KB

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of a simplicial graph

✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It

Rigorous lower bound on the compressibil

Rigorous lower bound on the compressibility of a classical system

✍ J. Ginibre 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 132 KB

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of a 3-connected loopless multigraph

✍ Li Deming; Liu Yanpei 📂 Article 📅 2000 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 400 KB

Tight Lower Bounds on the Size of a Maxi

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 106 KB