Support solving integer linear programs with modulus > 2

Infleqtion / qLDPC

Tools for constructing and analyzing quantum low density parity check (qLDPC) codes.

Apache License 2.0

74 stars 8 forks source link

Support solving integer linear programs with modulus > 2 #11

Closed perlinm closed 8 months ago

perlinm commented 8 months ago

I will deal with that by changing what CSSCode does depending on whether the base field is prime. The integer linear program is still well-defined for arbitrary (including non-prime) modulus, so no reason to restrict it here.