Title :
Monotonicity of the quantum linear programming bound
Author_Institution :
Shannon Lab., AT&T Res., Florham Park, NJ, USA
fDate :
11/1/1999 12:00:00 AM
Abstract :
The most powerful technique known at present for bounding the size of quantum codes of prescribed minimum distance is the quantum linear programming bound. Unlike the classical linear programming bound, it is not immediately obvious that if the quantum linear programming constraints are satisfiable for dimension K, then the constraints can be satisfied for all lower dimensions. We show that the quantum linear programming bound is monotonic in this sense, and give an explicitly monotonic reformulation
Keywords :
linear programming; quantum communication; random codes; minimum distance; monotonic reformulation; quantum codes; quantum linear programming bound; Codes; Education; Entropy; History; Interpolation; Linear matrix inequalities; Linear programming; Optimization methods; Quantum mechanics; Reliability theory;
Journal_Title :
Information Theory, IEEE Transactions on
