The asymptotic probability distribution of the relative distance of additive quantum codes (Q2467792)

For given information rate \(R\), it is proved as \(n\) tends to infinity, that almost all additive \([[n,n\cdot R]]\) quantum codes (pure and impure) are the codes with their relative distance tending to \(h^{-1}(1-R)\), where \(h(x)=-x\log^{x/3}_2-(1-x)\log^{1-x}_2\) is an entropy function.