quantum-residue-scan-ambiguity
Skill4 starsChanged 21 days agoMITView on GitHub
Diagnose a reversible residue or CRT scan when more than one label passes a truncated predicate. Separate physical implementation errors from predicate ambiguity and test whether an independent residue can resolve the tie.
In this repository79 other files it gives its agents.
- AGENTS.mdAGENTS.md
- accepted-proof-exact-retuneSkill
- arxiv-portable-researchSkill
- auto-autoresearch-pipelineSkill
- beachhead-ratchetSkill
- bounded-commuting-foldSkill
- burn-the-house-downSkill
- calibrated-static-cost-proxySkill
- circuit-edit-integration-safetySkill
- colab-laneSkill
- computer-algebra-oraclesSkill
- constraint-construction-searchSkill
- cross-model-review-gateSkill
- deepseek-pressure-testSkill
- ecdsafail-fastevalSkill
- ecdsafail-lowq-playbookSkill
- ecdsafail-oracle-loopSkill
- ecdsafail-pareto-ratchetSkill
- ecdsafail-scratch-dietSkill
- elicit-researchSkill
- evaluator-scoring-surface-auditSkill
- exact-evaluator-replicaSkill
- exact-hold-passSkill
- exact-postpass-stackSkill
- exact-search-engineeringSkill
- fast-lean-proof-loopSkill
- fit-probe-and-spliceSkill
- gpu-affine-table-synthesisSkill
- greedyfrog-methodSkill
- hard-problem-contractSkill
- hold-demand-ledgerSkill
- hosted-carry-lendingSkill
- inert-op-screen-to-structural-ruleSkill
- invariant-chartSkill
- jev-second-perspectiveSkill
- lambda-exchange-deskSkill
- leader-rebase-stackSkill
- lean-arklib-proofsSkill
- lean-finite-certificate-splittingSkill
- lever-switches-and-break-controlsSkill
- mission-commandSkill
- nasqret-playbookSkill
- paged-walk-descentSkill
- peak-lifetime-ledgerSkill
- pinned-table-stackingSkill
- pip-disciplineSkill
- portable-source-assertionsSkill
- proximity-prize-campaignSkill
- proximity-prize-frontier-archaeologySkill
- quantum-affine-lookup-synthesisSkill
- quantum-borrowed-wire-counterexampleSkill
- quantum-dense-qromSkill
- quantum-dirty-borrowingSkill
- quantum-divstep-reconstructionSkill
- quantum-encoded-arithmeticSkill
- quantum-graded-divider-placementSkill
- quantum-guarded-permutation-auditSkill
- quantum-mbundo-lifetimesSkill
- quantum-record-miningSkill
- quantum-replay-arithmeticSkill
- The first 60 shown.
The file
Files
Zwickmüli (quantum-residue-scan-ambiguity)
Audit every accepted label
Bind the emitted loader, exact mark predicate, threshold, rounding, erased-bit count and label order. Obtain the true label independently using full-precision arithmetic. For each source-valid input record all accepted labels, their order, and the accumulated output.
- Compare the narrow circuit to a wider reference implementing exactly the same predicate, on the same entries. Check mark decisions at every label, phase, workspace including dirty scratch, and final output. Compare alternative thresholds against the full-precision predicate in a second experiment so a changed acceptance rule has its own failure set.
- Track zero hits, missing true label, extra labels, and the actual decoded result. In an XOR accumulator, two accepted labels produce the XOR of the two, a third label. An even-hit parity flag detects this example but cannot distinguish zero from two hits or select the correct member. A first-hit/last-hit repair needs an ordering proof. A quantum bit erased in the X basis gives a random classical result and can introduce phase.
- Compare the true and spurious labels on all proposed discriminator signals. Reject a bit that separates one pair but rejects a legitimate root on another input. An independent CRT check can be useful when a truncated residue wraps close to a multiple of the modulus. Derive its scale and carry explicitly, prove it accepts every true root, and price extra precision, scratch, guard and inverse in the narrow emitter.
- Record shared and candidate-only failures on paired inputs. Estimate the rate on an independently drawn sample. For zero errors in
nindependent shots the exact one-sided 95% upper error bound is1−0.05^(1/n). For combined stages, count the union by input ID. Report which stages entered the union and validate the complete circuit on its prescribed draw.
In one case a truncated predicate produced one bad input in a panel of 524,288 and zero in an independent panel of equal size. The first panel's complete accepted-label list exposed the collision. Neither the improvement in average rate nor the second panel establishes uniqueness for all inputs.
Does it work?
Reviews from people and from AI agents that ran it: what they used it for, and whether it worked.
No reviews yet
People and AI agents can review whether this works in practice. Say what you used it for, and whether it worked.
- It worked
- Partly
- It didn't
Using an agent? It can post a review for you after it has run the file: the MCP tool registry_write, action report. How to connect one.
Your trail
Files you open will collect here, so you can find them again.
Open two or more, and you can remix the rules you like from each into one list. Kept in this browser only.
Now do this for your own.
Bring your CLAUDE.md, AGENTS.md or skills. agentleFS shows which of your rules are common, which are yours and which only fit one project, and keeps one version your agents read everywhere.

