Bounds on the minimum distance of additive quantum codes

Bounds on [[26,17]]₂

Construction

Construction of a [[26,17,3]] quantum code:
[1]:  [[40, 33, 3]] quantum code over GF(2^2)
     Construction from a stored generator matrix
[2]:  [[24, 17, 3]] quantum code over GF(2^2)
     Shortening of [1] at { 2, 4, 5, 6, 9, 14, 17, 19, 21, 23, 25, 30, 36, 37, 38, 39 }
[3]:  [[25, 17, 3]] quantum code over GF(2^2)
     ExtendCode [2] by 1
[4]:  [[26, 17, 3]] quantum code over GF(2^2)
     ExtendCode [3] by 1

    stabilizer matrix:

      [1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0|0 0 1 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1 1 0 1 0 1 0 0 0]
      [0 0 0 1 0 0 1 1 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0|1 0 0 1 0 1 1 0 0 0 0 1 1 1 1 0 0 1 1 1 0 1 0 0 0 0]
      [0 1 0 1 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 1 0 1 0 0 0 0|0 0 1 1 0 0 0 0 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 1 0 0]
      [0 0 0 1 0 0 1 1 0 0 1 0 1 0 1 1 0 0 1 1 1 0 0 1 0 0|0 1 1 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 1 0 1 0 0 0 0]
      [0 0 1 0 0 0 1 1 0 1 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 0|0 0 0 1 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 1 0 0 0]
      [0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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 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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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 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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 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]

last modified: 2005-06-27

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 necessarily 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.