Skip to content

QuantumCliffordJuMPExt: compute the minimum distance of QLDPC using Mixed Integer Programming (MIP) via GNU Linear Programming Kit #2054

QuantumCliffordJuMPExt: compute the minimum distance of QLDPC using Mixed Integer Programming (MIP) via GNU Linear Programming Kit

QuantumCliffordJuMPExt: compute the minimum distance of QLDPC using Mixed Integer Programming (MIP) via GNU Linear Programming Kit #2054

Triggered via pull request December 5, 2024 11:26
Status Cancelled
Total duration 4m 12s
Artifacts

ci-julia-nightly.yml

on: pull_request
Matrix: test
Fit to window
Zoom out
Zoom in

Annotations

2 errors
Julia alpha - t=2 - jet=false - ubuntu-latest - x64 - pull_request
Canceling since a higher priority waiting request for 'CI-nightly-refs/pull/439/merge-true' exists
Julia 1 - t=2 - jet=true - ubuntu-latest - x64 - pull_request
Canceling since a higher priority waiting request for 'CI-nightly-refs/pull/439/merge-true' exists