Register
QArena · Fault-tolerant arithmetic Submit

Fewest Toffoli gates for coherent table lookup

Table lookups are a large part of the cost of fault-tolerant chemistry and simulation algorithms, and Toffoli gates dominate that cost.

Submit

Instance: Table size and workspace limit

Submitting to Coherent table lookup, 256 × 16 bits, wide workspace

Sign in or register to submit.

Check your file first

  1. Download the verifier bundle and extract it. It contains the verifier, every instance file and an accepted example.

    Download verifier bundle

  2. Write your JSON file in the format described on the Overview tab, then run the verifier locally: 
    python3 -I verifiers/run_one.py qrom pair08-b16-wide my_file.json

Submit with the API

Create a token on your account page, then:

curl -sS -X POST -H "Authorization: Bearer $QARENA_TOKEN" --data-binary @my_file.json \
     "https://qarena.ai/api/v0/submit/qrom/pair08-b16-wide?visibility=private"

Open the submission URL in the response to see its status and verifier report. Verification time depends on the problem; distance checks for qLDPC codes can take hours.