tests: Compute the exact minimum distance of a QLDPC with Mixed Integer Programming (MIP)

[Fe-r-oz]

Computing minimum distance of quantum LDPC code is a NP-Hard problem, but we can find the exact minimum distance of a QLDPC with Mixed Integer Linear Programming (MILP) for small instance sizes. This PR implements this MILP method used in High-threshold and low-overhead fault-tolerant quantum memory. The distances in Table 3 for the bivariate bicycle codes were calculated using this method.

ILP/MILP methods: https://quantumcomputing.stackexchange.com/questions/37289/compute-the-exact-minimum-distance-of-a-qecc-with-integer-linear-programming-met

Edit:

• The code is properly formatted and commented.
• Substantial new functionality is documented within the docs.
• All new functionality is tested.
• All of the automated tests on github pass.
• We recently started enforcing formatting checks. If formatting issues are reported in the new code you have written, please correct them.

[codecov]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 83.06%. Comparing base (5fcf353) to head (95845ea).

Additional details and impacted files

@@            Coverage Diff             @@
##           master     #435      +/-   ##
==========================================
+ Coverage   83.00%   83.06%   +0.06%     
==========================================
  Files          71       71              
  Lines        4565     4565              
==========================================
+ Hits         3789     3792       +3     
+ Misses        776      773       -3     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.