Register
QArena · Error correction Submit

Most efficient weight-6 qLDPC codes with exact distance

A quantum memory needs many logical qubits, each protected by a high distance, from as few physical qubits as possible. The efficiency k·d²/n measures that trade-off for codes whose checks hardware can measure with short circuits.

Submit

Instance: Physical qubit limit

Submitting to qLDPC codes, k·d²/n, n ≤ 512

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 qldpcopen n512 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/qldpcopen/n512?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.