fb230d8a62
engine::course reads the course from wai-quantum/course/: 21 lessons from a first circuit through superposition, entanglement, interference, the standard algorithms, noise and mitigation, error correction and fault tolerance to resource estimates, each a Markdown text in English and Simplified Chinese and an exercise.json with a schema. A check runs each case of an exercise (a generator's inputs) with its intent and the verdict, measures its constraints (the gates allowed, counts, the T count, the critique's smells, the resource estimate's counts), and says what went wrong from the diagnostics, the verdict and the critique, never from the solution. The tests hold every solution to pass by proof, every known wrong answer to fail for its stated reason, and every locale to every text and message. wai-quantum learn shows, starts, checks, hints and explains a lesson, keeps progress only on this machine, and speaks the language --lang or LANG names; the command summaries and docs topics have Chinese translations held to the English they came from. The verdict gains of_diagnostic for a generator's refusal. llms.txt names the course. Co-Authored-By: Claude Opus 5.5 <[email protected]>
7 lines
679 B
Markdown
7 lines
679 B
Markdown
Qubits that are prepared separately combine by the *tensor product*: two qubits each in (|0⟩ + |1⟩)/√2 make
|
|
|
|
(|00⟩ + |01⟩ + |10⟩ + |11⟩)/2,
|
|
|
|
four outcomes with amplitude 1/2 each, probability 1/4 each. With n qubits there are 2ⁿ amplitudes. That count is why a classical computer can follow a few dozen qubits exactly and not a few hundred, and why the engine picks its method by the program's shape: some circuits need far less than every amplitude.
|
|
|
|
A gate on a register's name applies it to each qubit: `h q;` is `h q[0]; h q[1]; …` for every qubit of `q`. `wai-quantum plan` shows the method the engine would pick for a program and why, without running it.
|