Eight T states per round from the fewest noisy inputs
Magic-state factories take a large share of the cost of a fault-tolerant quantum computer. A protocol that yields eight good T states per round from fewer noisy inputs, at a fixed output error, makes a factory level smaller.
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 distill tri96-k8-p1000 example/tri96-k8-p1000.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 |
| distill.py | Validates submissions for this problem |
How verification works
The verifier checks full rank, the parity of every row and of every pairwise and triple overlap, and the Z distance by comparing the columns, and derives the S and CZ correction from the rows. It then counts the words of the check-row space and of the whole row space by weight, in Gray-code order, and evaluates the acceptance probability A and the probability of a wrong output in an accepted batch as exact fractions. The second is a joint probability over all outputs, not an average. A second, independently written program computes the same probabilities by a dynamic program over the inputs' syndromes and agreed on every test case.