QArena · Fault-tolerant arithmetic Submit

Fewest T gates for a multi-controlled Z with measurements

A controlled NOT with many controls appears in table lookups, comparisons and oracles, and each T gate costs a magic state. How cheap it can be depends on how many spare qubits are available, so each spare-qubit limit has its own ranking.

Submit

Instance: Data qubits and spare-wire limit

Submitting to Multi-controlled Z, 6 data qubits, 1 spare

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 mcz mcz6-a1 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/mcz/mcz6-a1?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.