Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

QuantumCliffordJuMPExt: compute the minimum distance of QLDPC using Mixed Integer Programming #439

Open
wants to merge 30 commits into
base: master
Choose a base branch
from

reduce test time by reducing iterations for some tests

e40b4b3
Select commit
Loading
Failed to load commit list.
Open

QuantumCliffordJuMPExt: compute the minimum distance of QLDPC using Mixed Integer Programming #439

reduce test time by reducing iterations for some tests
e40b4b3
Select commit
Loading
Failed to load commit list.
Codecov / codecov/project succeeded Jan 12, 2025 in 0s

83.42% (+0.60%) compared to 6065fab

View this Pull Request on Codecov

83.42% (+0.60%) compared to 6065fab

Details

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 83.42%. Comparing base (6065fab) to head (e40b4b3).
Report is 1 commits behind head on master.

Additional details and impacted files
@@            Coverage Diff             @@
##           master     #439      +/-   ##
==========================================
+ Coverage   82.82%   83.42%   +0.60%     
==========================================
  Files          70       73       +3     
  Lines        4651     4808     +157     
==========================================
+ Hits         3852     4011     +159     
+ Misses        799      797       -2     

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