Instructor · quantum-computing

Quantum Computing: from tiles to Qiskit

Gates

Stations are one hard chain; each unit's gate passes when all its stations pass. Only the server records a gate, after running and checking every move. The credential asserts qc.C1.practiceqc.C2.practiceqc.C3.practiceqc.C4.practiceqc.rehearsal(hard prerequisite).

Unit	Practice gate	Construct	Stations (gate · requires · moves)
W · Write: tiles to code	`qc.C2.practice`	qc.C2	1. Prove the Bell pair · `qc.w1` · — · 4 2. H and X, written down · `qc.w2` · qc.w1 · 4 3. Bell pair, in code · `qc.w3` · qc.w2 · 7 4. All answers at once? · `qc.w4` · qc.w3 · 4
R · Read: code to bars	`qc.C1.practice`	qc.C1	5. Read code, predict the bars · `qc.r1` · qc.w4 · 11
P · Runway: modify a program	`qc.C3.practice`	qc.C3	6. Enough Python to be dangerous · `qc.p1` · qc.r1 · 6
N · Noise: simulator versus device	`qc.C4.practice`	qc.C4	7. Simulator versus device · `qc.n1` · qc.p1 · 10
X · Rehearsal: the credential form	`qc.rehearsal`	qc.rehearsal	8. Rehearsal: the credential form, open · `qc.x1` · qc.n1 · 9

Construct mapping qlps-map-1.0

Registered as four mappings through the mapping-ratification engine, each proposed until faculty ratify it below. OB 3.0 achievement quantum-computing/1.0.

Mapping	Construct	Item	Rule
`qlps-map-1.0/C1`	C1 Translate: read code, predict the distribution	A	The single committed prediction for item A is within 0.1 of the ideal distribution on every key.
`qlps-map-1.0/C2`	C2 Translate: write an unseen algorithm from words	B	The referenced simulator run called the sealed oracle, its ideal distribution is the algorithm's prediction for the drawn variant, and the reported answer matches.
`qlps-map-1.0/C3`	C3 Python runway: modify someone else's program	C	The referenced run has the required qubit count and distribution, and the program output contains the required value.
`qlps-map-1.0/C4`	C4 Judgment: algorithm versus device noise (adjudicated)	D	The referenced device run is the same circuit as the scored simulator run, the top key and its fraction are read correctly, the verdict on the candidate's own run is correct, the verdict on a provided pair (someone else's program, correct or flawed, shown only as its simulator run and its device run) is correct, and two raters adjudicate the justification at 1 or above.

Across learners

Loading…

Instructor preview (this account)

Preview on: every station opens for this account, and every override is logged as gate.override.

Preview is stored on the server against this account. While it is on, this account cannot open a credential session, and nothing it passes, then or later in an overridden station, is written to the mastery ledger.

Ratify a construct mapping

Each decision is recorded with this account as the ratifier, through the mapping-ratification engine. The public anon key cannot change these rows. A credential issues only when all four are ratified.

Adjudicate C4

0: does not identify the control run, or attributes the spread to the algorithm or the code
1: names either the simulator control (same code, one key) or the device model (gate, readout, routing error), not both
2: names the control run and attributes the spread to the device model, with the evidence used

Two raters; a split across the threshold (1) needs a third.