Skip to content

Prove the exact four-qubit Clifford Gram rank at width nine - #7747

Open
petalas wants to merge 2 commits into
CrocSwap:mainfrom
petalas:research/w7-1118d-four-qubit-clifford-rank
Open

petalas wants to merge 2 commits into
CrocSwap:mainfrom
petalas:research/w7-1118d-four-qubit-clifford-rank

Conversation

@petalas

@petalas petalas commented Nov 18, 2026 •

Copy link
Copy Markdown
Contributor

Summary

Scoped proof produced by Nick Petalas. The full projective four-qubit Gaussian-dyadic Clifford tensor Gram at width nine has rank 10,107,260,791,808 out of 12,128,668,876,800. Its nullity is 2,021,408,084,992, so the pointwise independence threshold satisfies T(4) ≥ 10.

This answers the first character calculation proposed in alephnan's PR #6714. The proof identifies the quotient character with the action on ordered four-tuples of binary symplectic vectors and computes the occupied Clifford matrix blocks. It takes the published ordinary S8(2) character table as input. Credit also goes to aliromman #5526 for the pointwise framework and to the ATLAS and Thomas Breuer's CTblLib for the table.

Evidence

The exact calculation finds 61 present and 20 missing quotient irreducibles. A separate orbit calculation checks all nine moments of the fixed-dimension histogram. Two controls reject a changed character sum and an incorrect bin assignment. The published table archive reproduced the complete integer projection locally.

Run from the repository root with CPython 3.12.15.

python3.12 -B scripts/research_package.py --package research/clifford-four-qubit-width-nine
python3.12 -B scripts/check_research_commit.py --package research/clifford-four-qubit-width-nine --check-source-history
python3.12 -B -W error research/clifford-four-qubit-width-nine/verify.py

To rederive the integer projection from the published source:

scratch_dir=$(mktemp -d)
curl -fsSL 'https://www.math.rwth-aachen.de/~Thomas.Breuer/ctbllib/ctbllib-1.3.11.tar.gz' \
  -o "$scratch_dir/ctbllib-1.3.11.tar.gz"
python3.12 -B -W error research/clifford-four-qubit-width-nine/verify.py \
  --ctbllib-archive "$scratch_dir/ctbllib-1.3.11.tar.gz"

Limitations

The claim concerns exact operators at width nine. Width-ten independence, formal proof-kernel review, physical caller integration, and recursive cost accounting remain open. The selected multiplication theorem and its premises lie outside the claim.

Open next questions

  • Decide width-ten independence. Begin with the two quadratic-form stabilizers and test whether the twenty missing odd-sector rows can support a missing even-sector block under tensor reciprocity.

Related open work

The overlap search found no open PR computing the four-qubit width-nine Gram rank or nullity.

CI notes

This PR carries the shared CI-doc and replay-gap sync used by other open PRs. Passing CI on PR #7654

The current-status suite reproduced the stale CI section before the sync and passed all six tests after it. The historical replay-gap package and the Clifford rank package both passed locally on CPython 3.12.15.

All three hosted jobs passed at ff12ca358d601a21cd4b1f016b8a3a969ac44016. They covered planning, the Clifford rank package, and the historical replay-gap package. Registered research packages run

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant