Bounds on the minimum distance of additive quantum codes

Bounds on [[13,6]]₃

Construction

Construction of a [[13,6,4]] quantum code:
[1]:  [[13, 6, 4]] quantum code over GF(3^2)
     cyclic code of length 13 with generating polynomial x^10 + w^5*x^8 + w^3*x^7 + 2*x^6 + w^3*x^4 + w^2*x^3 + w^5*x^2 + w^6*x + w^6

    stabilizer matrix:

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

last modified: 2024-06-10

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.