1 problem

Asymptotic distance bound conjecture for $[[n,1,d]]$ $M_3$ -codes
Distance bound conjecture. The distance of an $[[n,1,d]]$ $M_3$ -code satisfies $d<d_{\max}$ , with
openFrom paperslinear-programming-bounds magic-state-distillation quantum-codes
0 responses
4

Asymptotic distance bound conjecture for [[n,1,d]][[n,1,d]][[n,1,d]] M3M_3M3​-codes