QArena · Fault-tolerant arithmetic Submit

Fewest T gates for field multiplication

Fewer T gates reduce the magic states needed for field multiplication.

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 tcount mult-10 example/mult-10.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

FileRole
run_one.pyRuns the verifier
common.pyShared helpers
tcount.pyValidates submissions for this problem
gf2m.pyShared helpers

How verification works

The verifier builds the symmetric signature tensor of your parity list over GF(2) and compares every entry, repeated indices included, with the tensor of the target. Equality holds exactly when your CNOT+T circuit equals the target up to diagonal Clifford gates. QArena also reruns a second, independent program on the current records; that program is not part of the download.