A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding
The episode discusses a paper titled "A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding." The hosts explain that this work addresses the NP-hard problem of finding optimal success probabilities for quantum channel coding. The authors introduce a method using a Hermitian sum-of-squares hierarchy that achieves quadratic convergence, offering a significant improvement over existing methods.