Repository navigation
Sharp two-qubit Clifford tensor threshold 9 and Gram condition 219/28 - #5675
Merged
Mister-Meeseeks merged 1 commit intoOct 26, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
Conversation
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.
The full two-qubit Gaussian-dyadic Clifford tensor alphabet has sharp pointwise independence threshold 9. At every f>=9 its normalized Gram spectrum lies in the sharp interval [315/1024,9855/4096], with sharp Gram condition number 219/28, attained at nine. This resolves the two-qubit next question in #5594 and improves the n=2 sufficient threshold 12 from Ali Romman's #5526. No new kappa, physical supplier or selected-frontier change is claimed.
The isolated
research/full-clifford-two-qubit-centrepackage enumerates 46,080 exact lifts/11,520 projective classes, reduces 59 conjugacy classes to residue blocks of sizes 11,16,11,21, and certifies exact spectra and regular multiplicities at widths 1..12 by integer polynomial/projector identities. It never constructs a dense 11,520-square Gram. An independent determinant-character sum supplies the width-eight null witness; the all-width argument is the Schur product theorem. The proof explicitly distinguishes pointwise sharpness from the merely sufficient fixed-residual test window 9..12.Validation: registered normal and optimized/warning-strict commands pass on CPython 3.12.14/NumPy 2.3.5/Windows 11, with equal complete JSON outputs; all lifts and class blocks, 64 literal tensor entries and seven rejection controls pass. Committed bytes and read-only, Git-free export replays also passed; reproduction commands and scope are in the package README. Hosted CI and independent human/formal acceptance are separate. NumPy is the sole pinned replay dependency; no symbolic eigensolver or predecessor executable is used.
The group count itself was already independently enumerated for a different task in JoyboyBrian/#5051; the new result is its tensor spectrum and quantitative bounds. Credit Ali Romman/#5526, MatShep/#5549/#5594, DLamdata/#5547, josecarlosgonzalezroque-design/#5570 and their retained lineage (NOTICE.md has exact context pins). Prepared for MatShep with substantial OpenAI Codex assistance; Apache-2.0. Current canonical main, guidance, handoffs and targeted open/closed PR/Issue/Discussion overlap were checked with bounded coverage. The next question is whether 4n+1 remains sharp beyond two qubits; no such general claim is made.
Submission refresh: canonical main
df0137efd35e11b4445734bf612bdd4c7ebc330cnow selects PR5599. Applicable submission guidance and priority revision remain unchanged. The frozen package retains its historical PR5413 source context and original base; this isolated algebraic result does not depend on or modify either frontier. Astra performed only a brief obvious-error and bounded overlap check, not a full replay or deep proof audit.