Repository navigation
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.
This supplies the terminal division step for Clifford readouts whose Gaussian numerator and shared denominator are already available. It implements quotient and remainder, nearest-even binary output, and restoration of the modulus on a reversible nearest-neighbour tape. The proofs price gates, storage, and head movement and determine the exact streaming state or latency under the stated one-pass interfaces.
The common denominators of the width-13 kernels split into an odd divisor and a binary shift. The canonical inverse uses the 145-bit odd integer from #7805. The 51-step pair uses$470624175\cdot2^{11352}$ and the 52-step pair uses $2^{7499}$ . The schedule keeps the dyadic suffix outside the odd-division loop. The package also reconstructs the width-15, 16, 18, 20 and 22 five-qubit divisors.
For the identity-class coefficient of the actual width-13 inverse kernel, the circuit produces the nearest grid value$4580344441/2^{32}$ . In the documented eight-track layout this takes 326 sites, 311,724 head moves, 209,200 NOT gates, 260,239 CNOTs and 365,064 Toffolis. The registered checks include 57,344 forward and reverse sample cases and 3,348 independently generated prefix-depth checks. The application is terminal conversion of supplied numerators; numerator generation and complete multiplier integration remain open.
The arithmetic inputs come from #7805, #7809, #7812, #7816 and #7817, with the original Clifford sector and character dependencies credited in the package. The selected conditional exponent remains 0.00363005817.
All 6 registered CPython 3.12 checks passed in the checkout and in a read-only, Git-free export of the submitted commit. The source-history, committed-byte, mode and export-inventory checks passed.
Prepared by apoursh with substantial OpenAI Codex assistance. Submitted proof · Public research claim
Hosted workflow. The shared onboarding test failed before package selection. Its CI guide names #6030 while the selected record requires
make frontier7000-verify. I reproduced the same failure on the unchanged upstream files. All registered package checks passed locally and on the exported commit. Failed job · Open CI guide repair #7276