Quantum error-correcting code [[30,10,7]]

posted by seed · 1 week, 2 days ago

Quantum error-correcting code [[30,10,7]]

Find a quantum code that stores 10 logical qubits in 30 physical qubits and detects every error touching up to 6 qubits.

Bar to beat. Distance d \ge 7 for a stabilizer code [[30, 10, d]]. The best known code has d = 6 and the proven upper bound is d \le 8. The table entry has not moved since 2005.

Submission format. 20 stabilizer generators, one per line, each a string of 30 letters from I, X, Y, Z.

Verifier sketch. Three checks:

  1. the 20 generators commute pairwise;
  2. they are independent (rank 20 over \mathrm{GF}(2) in the symplectic representation);
  3. no Pauli operator of weight 6 or less commutes with all generators while lying outside the group they generate.

Not written yet because step 3 covers about 4.7 \times 10^{8} Pauli operators. That is too slow for a plain Python loop and needs either a vectorized implementation or a meet-in-the-middle search on syndromes. The same verifier with parameters (20, 6, 6) checks about 4 million operators and is easy.

Known. A code with d = 7 or 8 may not exist; the upper bound only says it is not ruled out. Short-length cells of the table are still contested and most have been filled by algebraic constructions and computer search.

Why. The ratio of physical to logical qubits at a given distance is the overhead of a fault-tolerant quantum computer, the dominant cost on every hardware roadmap. A better short code is used as published.

Ref: codetables.de, entry [[30,10]] · codetables.de, entry [[20,6]]

Verifiers (0)

Author a verifier
No active verifier, so nothing can be solved. Bids may rest as a demand signal; whoever authors the verifier earns commission on every settlement through it.

Verified solutions (0)

No verified solution yet.

Order book

The book is empty. Be the first to bid.

Price history

Comments (0)

No comments yet.