Bounds on the minimum distance of additive quantum codes

Bounds on [[33,23]]₂

Construction

Construction of a [[33,23,4]] quantum code:
[1]:  [[41, 31, 4]] quantum code over GF(2^2)
     Construction from a stored generator matrix
[2]:  [[33, 23, 4]] quantum code over GF(2^2)
     Shortening of [1] at { 5, 9, 15, 24, 26, 29, 32, 38 }

    stabilizer matrix:

      [1 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 1 0 1 1 0 1 1 0 0 0 0 0 0 1 0|0 1 0 1 1 1 1 0 0 0 1 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 0]
      [0 1 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 1 1 1 0 0 1 0 0 1 0 1 1 0 0 1|0 0 1 1 1 0 0 0 1 1 0 0 1 0 1 1 1 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 0]
      [0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 0 1 0 1 0 1 0 0 0|0 1 0 1 1 1 1 0 0 0 0 1 1 1 1 1 1 0 1 1 0 0 1 0 1 1 0 1 0 1 0 1 1]
      [0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 1 1 1 1 0 0 0 1 1 0 1 1 1 1 1 0 1|0 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 0 1 0 0 0 0 0 0 0 1 1 1 0 1 1 1 1]
      [0 0 0 0 1 0 0 0 1 0 0 1 0 0 1 1 1 1 0 1 1 1 0 1 1 0 0 0 0 0 0 0 1|0 1 1 0 1 1 1 1 1 0 1 0 0 1 0 0 0 0 0 1 1 1 1 0 1 1 1 0 0 1 0 0 1]
      [0 0 0 0 0 1 0 0 1 1 0 0 0 1 0 1 1 0 1 0 1 1 1 1 0 0 1 1 0 1 0 0 1|0 0 1 1 1 1 1 1 1 1 0 1 0 0 0 1 0 0 0 1 1 0 0 0 1 0 0 1 1 1 0 0 0]
      [0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 1 1 1 1 0 0 1 1 1|0 1 0 1 1 1 1 1 1 1 0 0 0 0 1 1 1 1 0 1 1 0 0 0 1 1 1 0 0 1 0 0 1]
      [0 0 0 0 0 0 0 1 1 1 0 1 1 1 0 0 0 1 1 0 1 0 1 0 0 0 1 1 0 0 0 1 0|0 0 1 0 0 0 1 1 1 1 0 1 0 0 1 1 1 0 0 1 1 0 1 1 1 0 0 1 0 1 1 0 1]
      [0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 0 1 0 1 0 1|0 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 1 1 0 1 0 0 0 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0|1 0 0 0 1 1 0 1 1 1 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1]

last modified: 2005-07-21

Notes

• All codes establishing the lower bounds where constructed using MAGMA.
• Most upper bounds on qubit codes for n≤100 are based on a MAGMA program by Eric Rains.
• For n>100, the upper bounds on qubit codes are weak (and not even monotone in k).
• Some additional information can be found in the book by Nebe, Rains, and Sloane.
• My apologies to all authors that have contributed codes to this table for not giving specific credits.