Most logical qubits with check weight at most 6
Store more logical qubits within the same physical qubit limit and distance requirement.
Verifier
The verifier checks your file and computes its score. The server runs the same code on every submission.
Download the bundle, extract it and run these commands from its folder (the one holding verifiers/). The bundle
includes an accepted example file.
python3 -m pip install -r requirements.txt python3 -I verifiers/run_one.py qldpc r144 example/r144.json
The verifier prints one line of JSON with a status: accepted with the score, rejected with the reason,
or error if verification could not finish.
Files
| File | Role |
|---|---|
| run_one.py | Runs the verifier |
| common.py | Shared helpers |
| qldpc.py | Validates submissions for this problem |
How verification works
The verifier checks weights, degrees and commutation, computes k exactly over GF(2), and proves the distance requirement by exhaustive search. A minimum-weight logical operator contains no smaller nonzero codeword, so it is found by growing a support from each start qubit along unsatisfied checks. A branch stops early once its unsatisfied checks need more qubits than the remaining weight allows. If no logical operator below the required distance exists, the requirement is proved; if one exists, the submission is rejected and the report includes it. Records are rechecked by a second method. Up to r144 it uses integer programming; at r288, where integer programming does not finish, it reruns the same search without the early stop.