polish

ext/QuantumCliffordJuMPExt/min_distance_mixed_integer_programming.jl

@@ -136,22 +136,6 @@ julia> code_n(c1), code_k(c1), distance(c1)
 (48, 6, 8)
 ```
 
-!!!note Since the [[48, 6, 8]] GB code does not have specific lower and upper
-bounds (e.g., consider [[48, 6, 5 ≤ d ≤ 8]]), the minimum distance for all
-`Z`-type and `X`-type logical operators remains the same. Here, the *exact*
-minimum distance of `8` is provided.
-
-```jldoctest examples
-julia> distance(c1, all_logical_qubits=true)
-Dict{Int64, Int64} with 6 entries:
-  5 => 8
-  4 => 8
-  6 => 8
-  2 => 8
-  3 => 8
-  1 => 8
-```
-
 ### Applications
 
 - The first usecase of the MIP approach was the code capacity Most Likely