Monotonicity of the quantum linear programming bound

Details Monotonicity of the quantum linear programming bound Monotonicity of the quantum linear programming bound

1998-02-27

arxiv.org/abs/quant-ph/9802070v1

Physics

Quantum Physics

5 pages, AMSTeX

Scientific paper

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, that the constraints can be satisfied for all lower dimensions. We show that the quantum linear programming bound is indeed monotonic in this sense, and give an explicitly monotonic reformulation.

Affiliated with

Also associated with

No associations

Rating

Monotonicity of the quantum linear programming bound does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Monotonicity of the quantum linear programming bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Monotonicity of the quantum linear programming bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-364482