Fewest stabilizer terms for magic states
Fewer stabilizer terms can reduce the cost of simulating circuits with T, CCZ and other non-Clifford gates.
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 stabrank T-14 example/T-14.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 |
| stabrank.py | Validates submissions for this problem |
How verification works
The verifier builds the amplitude vector of each state, picks an invertible block modulo a fixed prime, solves for the coefficients with exact rational arithmetic, and then checks every amplitude exactly, using enough primes to prove equality over the integers. A target with irrational amplitudes, such as the face state with its factor 1 + √3, is first split into a few exact components with Gaussian-integer entries, and each component must lie in the span. Sets with redundant states are accepted if they reproduce the target. A second program rechecks every record numerically. During development, a separately written exact checker, which eliminates over cyclotomic integers without any prime moduli, agreed with the verifier on 169,000 random and adversarial submissions.