Semidefinite Programming Strong Converse Bounds for Classical Capacity
نویسندگان
چکیده
منابع مشابه
Strong converse for the classical capacity of entanglement-breaking channels
Mark M. Wilde, Andreas Winter, 3, 4 and Dong Yang 5 Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State University, Baton Rouge, Louisiana 70803, USA ICREA – Institució Catalana de Recerca i Estudis Avançats, Pg. Lluis Companys 23, ES-08010 Barcelona, Spain F́ısica Teòrica: Informació i Fenomens Quàntics, Universitat Autònoma de Barcelona, ES-08193 Bellate...
متن کاملStrong Duality for Semidefinite Programming
It is well known that the duality theory for linear programming (LP) is powerful and elegant and lies behind algorithms such as simplex and interior-point methods. However, the standard Lagrangian for nonlinear programs requires constraint qualifications to avoid duality gaps. Semidefinite linear programming (SDP) is a generalization of LP where the nonnegativity constraints are replaced by a s...
متن کاملStrong converse for the classical capacity of all phase-insensitive bosonic Gaussian channels
Submitted for the DAMOP14 Meeting of The American Physical Society Strong converse for the classical capacity of all phase-insensitive bosonic Gaussian channels BHASKAR ROY BARDHAN, Department of Physics and Astronmoy, Louisiana State University, USA, RAUL GARCIAPATRON, Ecole Polytechnique de Bruxelles, Universite Libre de Bruxelles, Belgium and Max-Planck Institut fuer Quantenoptik, Germany, M...
متن کاملStrong converse for the classical capacity of the pure-loss bosonic channel
This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [Giovannetti et al., Physical Review Letters 92, 027902 (2004), arXiv:quant-ph/0308012]. In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean-photon number constraint on the...
متن کاملBounds for projective codes from semidefinite programming
We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2741101