QNFO Papers

Quick read · plain language

Testing a Code-Spotting Idea on More Code Types

A plain-language version of “Extending v_p^max Code Classification: Testing the Mahler Spectral Conjecture on Additional Stabilizer Code Families”

2 min readNo jargon, no mathematicsError correction

The short version

An earlier paper claimed a math trick could tell perfect codes from random ones. This paper tests that claim on eight more code types. The trick works only for one special family of codes. It fails for all others.

The idea being tested

An earlier paper said it found a way to sort codes into two groups. The first group holds the best possible codes. The second group holds random junk codes. The test uses a math tool called the Mahler expansion. This tool turns a code's weight pattern into a set of numbers. Then it checks how many times two can divide into those numbers. The highest count across all numbers was called the top score. The earlier paper said best codes score twenty-eight. Random codes score four.

The earlier paper tested four code families. This paper tests eight more. Some tests use exact weight patterns from published books. Other tests use rough guesses where exact patterns are not known.

What was checked

The new tests looked at eight code types. Two came from a famous perfect code called the Golay code. One was a tiny five-bit code. One was a seven-bit code called Steane. One was a nine-bit code called Shor. Three were surface codes of different sizes. The Golay codes have exact weight patterns. The others do too, except the surface codes and the Shor code used rough guesses.

What the scores were

The two Golay-derived codes scored twenty-eight. This matched the earlier paper. But every other code scored between one and six. The random baseline was four. So the other codes looked just like random junk. The five-bit code scored one. The Steane code scored two. The Shor code scored two. The surface codes scored two, four, and six. None of these matched the claimed twenty-eight.

Why the trick fails

The Golay code has a very special shape. Its weight pattern mirrors itself perfectly. This extreme balance creates big scores in the math trick. Most codes lack this mirror shape. The earlier paper probably tested only Golay-type codes when it said "best codes." The label "best" was true for those codes. But the math trick does not work for best codes in general. It works only for this one mirror-shaped family.

What this means

The idea that the math trick spots best codes does not hold up. It survives only in a weaker form. The weaker form says mirror-shaped Golay-type codes get high scores. That is all. The big gap between twenty-eight and four is a fluke of one code family. It is not a universal rule. The paper leaves open whether any non-Golay code could ever score high. It also leaves open whether someone else can repeat the Golay result.

Words used here

Mahler expansion
a math tool that turns a pattern of weights into a new set of numbers, like reshuffling a deck of cards into a new order
Weight distribution
a count of how many pieces in a code have each possible weight, like counting how many people in a room wear each shoe size
Self-dual
a code whose weight pattern mirrors itself perfectly, like a face that looks the same on both sides
Stabilizer code
a type of quantum error-fixing code built from math rules that keep certain patterns steady

Learn more in plain language

This plain-language version was written by an AI model from the text of the paper and checked against plain-language rules: everyday words, no mathematics, no unexplained names. It leaves details out and can still be wrong; the paper is the source of record. To report a problem, open the paper, select the passage and choose Report.

For specialists: the technical digest, quoted from the paper

In the paper's words

ACRP-06: Tests UF paper C7.3 on 8 additional codes. Golay CSS confirmed v_p^max=28; all other stabilizer codes cluster at random baseline (1-6). C7.3 bound to Golay-type self-dual codes.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

No sentence of this paper reports a figure with a unit or a quantity word, so none is shown.

How it is done

  1. Confirmation: The Golay CSS code and extended Golay CSS code achieve $v_{p}^{\max}=28$ — EXACTLY the UF paper's claim for "optimal" codes.

    from 4. Analysis

What would falsify it

  1. [CHECK: 2027-08] [STRONG] If any standard published stabilizer code (not Golay-derived) is shown to achieve v_p^max >= 20 from its exact weight distribution, this bounding result is FALSIFIED.

    from 8. Calibration Register

Where the claim stops

  1. The "28 vs 4" gap does not generalize.

    from 7. Conclusion
  2. This note extends the test to eight additional stabilizer code families using EXACT weight distributions (where known) and approximate distributions (where only [[n,k,d]] parameters are available), and finds that the conjecture does not generalize.

    from Abstract
  3. However, for general stabilizer codes — including the [[5,1,3]] perfect code, the [[7,1,3]] Steane code, the [[9,1,3]] Shor code, and surface codes of sizes [[16,1,4]] through [[36,1,6]] — $v_{p}^{\max}$ clusters between 1 and 6, indistinguishable from the random-ensemble baseline (mean=4).

    from Abstract

Where to read

  1. Abstract201 words · 1 min
  2. 1. The Conjecture Under Test229 words · 1 min
  3. 2. Mahler Spectrum Computation47 words · 1 min
  4. 3. Results90 words · 1 min
  5. 4. Analysis210 words · 1 min
  6. 5. Conjecture Survival52 words · 1 min
  7. 6. Mandatory Symmetry (KIF-18)88 words · 1 min
  8. 7. Conclusion87 words · 1 min
  9. 8. Calibration Register42 words · 1 min
  10. 9. Declarations43 words · 1 min
  11. Version History8 words · 1 min

Read from the paper itself: 16 sections, 1,200 words. Nothing in this digest is written by a model; a line that is not a sentence of the paper is not shown. Have a specific question? Ask this paper.

The full text · Ask the whole corpus