量子线性规划界的单调性
Monotonicity of the quantum linear programming bound
摘要：
目前已知的最强大的技术限制量子码的大小的规定的最小距离是量子线性规划界。与经典的线性规划界不同，如果量子线性规划的约束对于维数K是可满足的，那么这些约束对于所有较低的维数都可以满足，这一点并不明显。我们证明了量子线性规划界在这个意义上确实是单调的，并给出了一个显式单调的重新表述。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
