Skip to content
CI-nightly

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

Sign in to view logs

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 #2057

Triggered via pull request December 5, 2024 13:03
@Fe-r-ozFe-r-oz
synchronize #439
Fe-r-oz:fa/MILPExt
Status Success
Total duration 57m 3s
Artifacts –

ci-julia-nightly.yml

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

Annotations

2 warnings
Julia alpha - t=2 - jet=false - ubuntu-latest - x64 - pull_request
ubuntu-latest pipelines will use ubuntu-24.04 soon. For more details, see https://github.com/actions/runner-images/issues/10636
Julia 1 - t=2 - jet=true - ubuntu-latest - x64 - pull_request
ubuntu-latest pipelines will use ubuntu-24.04 soon. For more details, see https://github.com/actions/runner-images/issues/10636