Monotonicity of the quantum linear programming bound

Authors
Rains, EM
Citation
Em. Rains, Monotonicity of the quantum linear programming bound, IEEE INFO T, 45(7), 1999, pp. 2489-2492
Citations number
3
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
45
Issue
7
Year of publication
1999
Pages
2489 - 2492
Database
ISI
SICI code
0018-9448(199911)45:7<2489:MOTQLP>2.0.ZU;2-F
Abstract
The most powerful technique known at present for bounding the size of quant um codes of prescribed minimum distance is the quantum linear programming b ound. Unlike the classical linear programming bound, it is not immediately obvious that if the quantum linear programming constraints are satisfiable for dimension Ii, then the constraints can be satisfied for all lower dimen sions. We show that the quantum linear programming bound is monotonic in th is sense, and give an explicitly monotonic reformulation.