Repository navigation
Conversation
This was referenced Nov 19, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
At width 13, the canonical Moore–Penrose decoder for the full four-qubit Clifford alphabet has least common odd denominator 22,742,436,009,630,709,072,767,882,717,680,300,149,753,125. This answers the canonical-denominator question left in #7802, where another norm-optimal left inverse required only 470,624,175.
The dyadic splitting transfers the question to the inverse Gram matrix. The 81 character blocks give an upper bound. Its diagonal entry supplies every required odd factor except one power of three. The off-diagonal entry at the explicit order-17 Clifford of #6208 supplies that power. Their denominator least common multiple meets the upper bound.
Two independent programs compute the spectrum and check that witness. All four registered commands passed under CPython 3.12.14 in the checkout and in a read-only Git-free export. The committed bytes, source history, file modes and exported input inventory passed the repository checks. The result concerns exact coefficient denominators; a priced division circuit remains open.
Ali Romman supplied #7772, #7788 and #7792, and Nick Petalas supplied the #7747 projection. The argument also uses the splitting in #7799 and the distinction between minimizers in #7802. Prepared by apoursh with substantial OpenAI Codex assistance. The selected conditional multiplication exponent is unaffected. Proof at the submitted revision · Research claim
Hosted check. The shared onboarding test failed before package selection. The CI guide references #6030 while the selected record requires
make frontier7000-verify. The same test fails on the unchanged upstream files. The registered package checks passed locally and on the exported commit. Workflow log · Open CI guide repair #7276