Skip to content

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

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

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

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

ci.yml

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

Annotations

8 errors
Documentation
Canceling since a higher priority waiting request for 'CI-refs/pull/439/merge-true' exists
Julia 1.10 - t=5 - ubuntu-latest - x64 - pull_request
Canceling since a higher priority waiting request for 'CI-refs/pull/439/merge-true' exists
Julia 1 - t=1 - macos-latest - aarch64 - pull_request
Canceling since a higher priority waiting request for 'CI-refs/pull/439/merge-true' exists
Julia 1.10 - t=1 - ubuntu-latest - x64 - pull_request
Canceling since a higher priority waiting request for 'CI-refs/pull/439/merge-true' exists
Julia 1 - t=1 - windows-latest - x64 - pull_request
Canceling since a higher priority waiting request for 'CI-refs/pull/439/merge-true' exists
Julia 1 - t=5 - ubuntu-latest - x64 - pull_request
Canceling since a higher priority waiting request for 'CI-refs/pull/439/merge-true' exists
Julia 1 - t=1 - ubuntu-latest - x64 - pull_request
Canceling since a higher priority waiting request for 'CI-refs/pull/439/merge-true' exists
Julia 1 - t=1 - macos-latest - x64 - pull_request
Canceling since a higher priority waiting request for 'CI-refs/pull/439/merge-true' exists