Linear programming bounds for quantum error-correcting codes
賴青沂教授交大電信所 15:30 – 17:00 鴻經館 M107Combinatorics Seminar (Colloquium)
Abstract：Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. The basic idea is to utilize the linear constraints induced from the MacWilliams identity that connects the weight enumerations of two orthogonal groups. In this talk, I will introduce the applications of linear programming bounds in quantum codes, including our recent results on entanglement-assisted quantum codes and quantum data-syndrome codes.