agentleFS
odinfreeodinfree/storm-ecdsa-harness/skills/quantum-dense-qrom/SKILL.md

quantum-dense-qrom

Skill4 starsChanged 21 days agoMITView on GitHub

Evaluate dense Pauli-encoded QROM and packetized lookup as a structural replacement for material coherent table lookup costs.

The file

We split this skill into the rules it gives an agent

1 rule. About 0 are common, 1 is distinctive, and 0 are very specific to this project.

  • ≈0

    Common · estimate

    Many files like this have a rule of this kind.

  • ≈1

    Distinctive · estimate

    This author's own choices. Worth a look.

  • 0

    Very specific

    Tied to their project's names, files or tools. Probably skip.

  • Common
  • Distinctive
  • Very specific
  1. Distinctive:

    Read the shared contract before a trial.

    line 10

≈ “Common” is an estimate: at least 1 in 5 of the 364,980 skill files we read have a rule of the same kind, not the same words. “Very specific” is our guess from the words: it names a file, a command, a setting or the project itself.

Keep what fits and drop the rest. Your version, ready for your agents.
Files
SKILL.md

Sardinebüchs (quantum-dense-qrom)

Change how table information is loaded and read. Read dense-encoding QROM.

Read the shared contract before a trial. Start with the five-line post; the shared native-test order, stop rules and promotion gate apply.

Practical lane

First prove lookup is actually present in the scored path. Record table entries N, output bits b, address split, allowed gates, dirty workspace D and current lookup/use/unlookup cost. A classically supplied addend has no automatic lookup saving.

First experiment: implement the elementary two-entry read on a small channel/unitary model with a superposed address and a dirty qubit entangled with a spectator. Compare the complete operation to XOR lookup tensor identity. Include nonzero output targets and both Pauli choices. Preserve the true inverse of the load: changing inverse order can introduce a phase error.

Only then emit the complete table lookup with finite-size accounting. Compare the existing implementation, dense encoding and dense encoding plus packets under the same workspace cap. Include row selection, controls, output basis changes, padded rows, unload and the consumer boundary. Use a local name such as block_rows instead of confusing the paper's lambda with a board failure parameter.

Structural extension

Co-design the table interface with a consumer that remains in a useful representation. Any removal of lookup cleanup needs its own correctness proof. Dirty workspace must be available during the whole borrow interval, not merely elsewhere in the circuit.

Stop if the evaluator cannot represent the needed operation stream, no usable table is in the objective, finite overhead dominates, or workspace raises global Q enough to erase the gain. Classical basis-only testing cannot validate this encoding. Deliver actual table shape, emitted resource curve across feasible block/packet choices, identity-on-borrowed-state evidence and whole-path result.

Download now (ZIP)

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
What did you use it for? e.g. Reviewing pull requests in a Rails app

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.