Repository navigation
Prove exact Pauli paid-history minimum for arbitrary targets: X/Y/Z squares need 2 returns, not 3 (no new κ) - #5979
Merged
Mister-Meeseeks merged 1 commit intoOct 28, 2026
Conversation
…targets In the PR CrocSwap#5482 phase-complete Pauli history model, the least number of returned rows for arbitrary targets on distinct owners is the largest common-character count at even width and ceil(sum of R-module excesses / 2) at odd width. Classify every tensor square and every rank-one tensor power at width at least three; three width-two X/Y/Z-type owners need two returns, and two rank-one Pauli-eigenvector owners at odd width need one.
This was referenced Oct 27, 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.
Result
Scoped proof with exact finite corroboration. No new κ.
This answers the open boundary of JoyboyBrian's #5482 (
research/pauli-twisted-history-threshold), which "does not classify arbitrary Pauli-nonordinary matrices."Theorem 1. In #5482's phase-complete Pauli history model, the least number of returned rows for arbitrary targets H_j on distinct owners is exactly:
R=span{I,P,C,PC}.ceil(sum_j s_j / 2). Here R is isomorphic toM_2(K)ands_j=(dim(R+R H_j)-4)/2is in {0,1,2}.The lower bound holds for every program in the model. Explicit returned rows attain it.
Corollaries.
M tensor Mis the set of forms B in {I,X,Z} withM^T B Mnot proportional to B. A short case analysis shows that a non-Pauli M has two or three of them. The minimum is therefore at leastceil(2q/3), and this is sharp. Owners with targets(2I+X)^⊗2,(2I+Y)^⊗2and(2I+Z)^⊗2need 2 returns, not 3.M=u w^T, the odd-width excess is 1 exactly when u is an eigenvector of X, Z or XZ, so two such owners share one return. At even width the profile has all four characters, or exactly two for Pauli eigenvectors, tabulated by f mod 4. These profiles force q when f≡0 mod 4 and allowceil(2q/3)when f≡2 mod 4.Evidence and reproduction
From the repository root, with
/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12(CPython 3.12.15; substitute any CPython 3.12):Local results at
b017210c92b8c9cda4bcb1debf130313bc908fbd:PASS_REGISTERED_RESEARCH_PACKAGEin 3.7 s.PASS_RESEARCH_COMMIT_BYTES.PASS_PAULI_HISTORY_ARBITRARY_TARGETS, in about 1.7 s each.The verifier uses the standard library only, with exact Q(i) arithmetic. It checks:
dim R u^⊗f = 2exactly for the 30 Pauli eigenvectors.The all-width statements rest on PROOF.md, not on these finite checks.
Limitations and unrun obligations
Open next questions
K{I,X,Z,XZ}have excess 2 at odd f≥3 and all four characters at even f≥4? A yes would extend Prove sharp paid-history threshold for phase-complete Pauli operations (no new kappa) #5482's q-call count to all invertible nonordinary tensor powers.Related open work
No open PR studies this model or quantity. #5482 is the merged predecessor, cited and not rechecked. #5967 studies Clifford tensor-Gram thresholds, a different quantity. The later open PRs #5976, #5977, #5978 and #5980 concern power-variation roots, plane-port decoders and address-twist syzygies, not this model.
CI notes
Both hosted checks passed for
b017210c92b8c9cda4bcb1debf130313bc908fbd:planandreplay (research/pauli-history-arbitrary-targets), in run https://github.com/CrocSwap/integer-mult-bounds/actions/runs/40566651767.Credit: JoyboyBrian (#5482) for the model, the history-module inclusion and the (aI+bX) q-call theorem, with that package's retained credits to Chris R / Clear1nsight, the PR5425/PR5446 authors and Ali Romman's PR5450.