Repository navigation
Prove the joint G20 exchange floor: 18 ADDs even with cross-component gates - #6081
Merged
Mister-Meeseeks merged 1 commit intoOct 28, 2026
Merged
Conversation
Contributor
Author
|
CI follow-up for The plan failure reproduces on clean canonical main |
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 three disconnected bank exchanges in PR5840 cannot be implemented with fewer than 18 unit ADDs, even when gates mix their twelve wires and arbitrary GL2 bases are allowed within each bank. This resolves the direct-sum question left by #5851/#5942 and the released handoff.
The proof applies the known connectivity/diagonal lower bound of Alan Bu, Evan Fan and Robert Joo (arXiv:2408.07898, Lemma 3.6 and Theorem 5.2). The new contribution is its exact source application and certificate, not a new general CNOT bound. Of 46,656 allowed endpoint maps, exactly eight attain 18; every other endpoint needs at least 19. The source attains 18 on each side, giving a 36-ADD subtotal per port.
Validation passes with Python 3.12: registered normal and optimized replay; literal source word/matrix binding; two graph algorithms; eight attaining words and inverse actions on every independent input column; 168 GL(3,2) states and 1,008 gate edges; gate omission and endpoint controls; committed bytes/source history; official export integrity; and an optimized read-only, Git-free, empty-PATH replay. The exported source-byte mutation rejects. Reproduce with
python3.12 -B scripts/research_package.py --package research/g20-joint-exchange-floor.This is a twelve-wire scalar result. It does not prove a global 32-wire minimum when gates also cross into the 18-wire chain component, change recursive paid ranks, admit a supplier or improve kappa. The five framework assumptions remain. External independent proof/code review and hosted CI are pending.
Credit Ali Romman/#5840 and the retained G20 lineage, Charan ./#5851, Nick Petalas/#5942 and the handoff, and Bu–Fan–Joo for the general bound. Prepared by JoyboyBrian with substantial OpenAI Codex assistance. Advance claim.