Most quantum speedup claims dangle connected an oracle that exists only on paper. This people teaches the trade of building applicable quantum circuits from scratch.
Choose the problem, build the oracle
1. A different computer
- CPU, GPU, QPU: 3 devices, 3 workloads
- the QPU’s job: fewer samples for an average
queries successful spot of 
samples- three questions: task randomness, precision, oracle cost
- Grover connected a database loses to data loading
- break-even:
View slides
2. The Monte Carlo speedup
- a query count is not a runtime
- the payoff qubit’s perspective encodes the win probability
- amplitude estimation sounds that perspective to precision ε
- best of k arms:
samples vs 
queries - Go fails mobility 1, the bandit fails mobility 3
- Sway: gaps of 10⁻⁴ connected a 32×32 board
- the aforesaid oracle style fits an epidemic model
3. Ship it
- the contract: board, 2 moves, randomness tape, payoff qubit
- one round: Black places, White places, every stone rolls
- the register layout successful Qiskit
- a azygous move prime complete the legal cells
- the d20 arsenic a 5-bit comparison against a neighbor count
- 3×3, 2 rounds: 169 qubits
4. Reversible by design
- amplitude estimation runs the rollout forward and backward
- decide from the aged board, constitute to a shadow board, keep the aged one
- in-place updates publication a neighbour that already flipped
- erase move-selection scratch earlier the board changes
- one payoff qubit, everything other inverted
- the qubit and gross count arsenic the committee grows
Make it correct
5. Garbage collection
- reversible circuits person no delete
- entangled scratch breaks interference
- Bennett: compute, transcript out, uncompute
- the inverse must spot the same inputs arsenic the forward pass
- peak scratch sets the qubit count
- clean scratch is necessary, not sufficient
6. Measure to erase
- the textbook says never measure mid-circuit
- compilers measurement scratch to reclaim qubits
- Gidney’s AND†: an X-basis measurement alternatively of a Toffoli
- a random sign, fixed by one shape gate
- half the T gates of an adder
- safe erstwhile scratch holds a basis function of the data
7. Calling conventions
- three scratch classes: clean, borrowed, conditionally clean
- Qiskit passes the reuse information arsenic unchecked convention
- a artifact tin destroy its ain condition
- two correct blocks, 1 unguaranteed boundary
- restoration types: Hoare contracts over subspaces
- a 12-bit oracle: 20 qubits to 13
8. Proof-carrying circuits
- truth tables cannot spot a phase
- full-basis checking costs 2ⁿ
- certificates replayed by a Lean kernel
- gate-by-gate checking needs closure nether the gate set
- past Toffoli, assertions turn exponentially
- one theorem per family, checked in milliseconds
Count it, trial it, judge it
9. Where the quantum lives
- a process that runs step by step
- between immoderate 2 steps, classical bits would do
- no 1 classical bearer useful for all steps at once (Bisio)
- the SHIFTS channel: 1 qubit in, 2 out, built to show it
- the quantum lives successful the memory betwixt steps
10. All aliases nothing
- running n copies does not amortize
- quantum memory: zero aliases linear successful n, nothing between
and 
scalings ruled out- the aforesaid rule for preparing states
- SHIFTS: astatine slightest 0.03 qubits per copy
- a theorem, pinch constants
11. Test, don’t trust
- a trial pinch single-qubit measurements only
- a correct instrumentality passes every time
- q qubits of representation walk pinch probability astatine most
- too small representation fails exponentially fast
- the instrumentality stays a black box
12. Audit the adjacent claim
- the AI era’s assumption: compute closes every gap
- the
wall: mini gaps, irreducible randomness - weak baselines, query counts sold arsenic runtimes
- ignored parallelism, solver randomness arsenic task randomness
- oracle costs hidden down “assume oracle access”
- the 3 questions connected a headline claim, live
English (US) · 
Indonesian (ID) · 
