Skip to content

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

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

Workflow file for this run

name: Downgrade
on:
pull_request:
branches: [master, main]
paths-ignore:
- 'docs/**'
push:
branches: [master, main]
paths-ignore:
- 'docs/**'
env:
PYTHON: ~
jobs:
test:
runs-on: ubuntu-latest
strategy:
matrix:
version: ['1.9']
steps:
- uses: actions/checkout@v4
- uses: julia-actions/setup-julia@v1
with:
version: ${{ matrix.version }}
- uses: cjdoris/julia-downgrade-compat-action@v1
with:
skip: Pkg,TOML,InteractiveUtils,Random,LinearAlgebra
- uses: julia-actions/cache@v2
- uses: julia-actions/julia-buildpkg@v1
- uses: julia-actions/julia-runtest@v1