QArena · Fault-tolerant arithmetic Submit

Fewest AND gates for field multiplication

Each product can be implemented with a Toffoli gate.

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 andcount mult-16 example/mult-16.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
andcount.pyValidates submissions for this problem
gf2m.pyShared helpers

How verification works

The verifier checks all m^3 entries of the multiplication tensor: for every pair of basis elements it adds up the products you selected and compares the result with the true field product. A second program rechecks every record by multiplying all pairs of field elements (m up to 10) or through an independent tensor computation.