Configure inputs and open editable circuits in Composer.
ⓘ
Dashed cards are planned algorithms, not available yet. Their numbers show the build order.
62 results
Oracle algorithms
12 available
Transforms
3 available · 5 planned
Shor order-finding, N = 15Planned · #4
The quantum half of factoring: find the period of a^x mod 15. The classical half is a one-line gcd.
8 qubitsBuild details
The quantum half of factoring: find the period of a^x mod 15. The classical half is a one-line gcd.
Reuses qft.ts inverse layers + the arithmetic.ts modular ladders
No plan doc yet
HHL, 2×2 systemPlanned · #5
Solve Ax = b in amplitudes. The smallest case that still shows phase estimation, conditional rotation and uncompute.
4 qubitsBuild details
Solve Ax = b in amplitudes. The smallest case that still shows phase estimation, conditional rotation and uncompute.
Reuses qpe.ts, plus a controlled-RY decomposed into RY / CX
No plan doc yet
Iterative QPE (Kitaev)Planned · #8
One ancilla, reused round after round, each rotation angle set by the bits already measured. Phase estimation without the register.
2–3 qubitsBuild details
One ancilla, reused round after round, each rotation angle set by the bits already measured. Phase estimation without the register.
Reuses qpe.ts controlled-U powers, plus the classicalCondition feed-forward the protocol fixtures already run
No plan doc yet
Semiclassical QFT (Griffiths–Niu)Planned · #9
The QFT with every controlled rotation replaced by a measurement and a classical angle. One qubit does the work of n.
3–5 qubitsBuild details
The QFT with every controlled rotation replaced by a measurement and a classical angle. One qubit does the work of n.
Reuses qft.ts angles, plus RESET and classically conditioned P rotations
No plan doc yet
QSVT, smallest casePlanned · #10
One signal-processing rotation sequence that reproduces Grover, phase estimation and amplitude amplification as special cases.
2 qubitsBuild details
One signal-processing rotation sequence that reproduces Grover, phase estimation and amplitude amplification as special cases.
Reuses a one-qubit block encoding, then RZ / RY angles only
No plan doc yet
Arithmetic
8 available
Simulation & variational
5 planned
Trotterized spin chainPlanned · Next #1
Time evolution of an Ising, Heisenberg or XY chain, one Trotter step at a time. The simulation family is empty despite the interaction gates being native.
4–8 qubitsBuild details
Time evolution of an Ising, Heisenberg or XY chain, one Trotter step at a time. The simulation family is empty despite the interaction gates being native.
p rounds of cost and mixer layers on a small graph. The same shape a docking score turned into a QUBO takes.
4–6 qubitsBuild details
p rounds of cost and mixer layers on a small graph. The same shape a docking score turned into a QUBO takes.
Reuses RZZ + RX; the backend already carries AlgorithmId "qaoa"
No plan doc yet
VQE hardware-efficient ansatzPlanned · #3
The RY/CX ladder the folding backend already optimises, made visible and editable gate by gate.
4–6 qubitsBuild details
The RY/CX ladder the folding backend already optimises, made visible and editable gate by gate.
Reuses RY + CX only; the backend already carries AlgorithmId "vqe"
No plan doc yet
Data-reuploading classifierPlanned · #11
The smallest circuit that actually classifies. Features re-uploaded between rotation layers, with the training already done offline.
1 qubitBuild details
The smallest circuit that actually classifies. Features re-uploaded between rotation layers, with the training already done offline.
Reuses RY / RZ layers with fixed, pre-trained angles — no optimiser in the loop
No plan doc yet
IQP samplingPlanned · #12
Commuting circuits: H layers around a block where everything is diagonal. The shape of a hardness argument — at this width the simulator still wins, and the card says so.
6–8 qubitsBuild details
Commuting circuits: H layers around a block where everything is diagonal. The shape of a hardness argument — at this width the simulator still wins, and the card says so.
Reuses H, CZ, CP and RZ — every gate already native
No plan doc yet
Quantum walks
4 available · 1 planned
Continuous-time quantum walkPlanned · #7
Evolution under the adjacency matrix itself — no coin register, so the walker spreads without a direction to carry.
4–6 qubitsBuild details
Evolution under the adjacency matrix itself — no coin register, so the walker spreads without a direction to carry.
Reuses RXX / RZZ Trotterisation; the discrete walks' position view renders it unchanged
No plan doc yet
Primitives & tests
3 available
Foundations & paradoxes
2 available · 2 planned
Hardy's paradoxPlanned · #13
Nonlocality without an inequality: four outcomes no local model can assign together, on a circuit small enough to check by hand.
2 qubitsBuild details
Nonlocality without an inequality: four outcomes no local model can assign together, on a circuit small enough to check by hand.
Reuses RY and CX only — the shallowest entry on the whole roadmap
No plan doc yet
Delayed-choice quantum eraserPlanned · #14
Mark which path was taken and the interference dies; erase the mark, feed the outcome forward, and the fringes come back.
3 qubitsBuild details
Mark which path was taken and the interference dies; erase the mark, feed the outcome forward, and the fringes come back.
Reuses mid-circuit MEASURE plus a classically conditioned Z — the feed-forward variant, because the histogram cannot be sorted after the fact
No plan doc yet
Games & pseudo-telepathy
3 available
Quantum Error Correction
4 available · 2 planned
[[5,1,3]] perfect codePlanned · #6
The smallest code that corrects any single-qubit error. Fills the gap between the three-qubit repetition code and Steane.
9 qubitsBuild details
The smallest code that corrects any single-qubit error. Fills the gap between the three-qubit repetition code and Steane.
Reuses the QEC fixture and syndrome machinery already in catalog.ts
No plan doc yet
[[4,2,2]] error-detecting codePlanned · #15
XXXX and ZZZZ stabilizers spot any single error but cannot say which. The shallowest code after the three-qubit repetition.
4 qubitsBuild details
XXXX and ZZZZ stabilizers spot any single error but cannot say which. The shallowest code after the three-qubit repetition.
Reuses the QEC fixture and syndrome machinery already in protocolFixtures.ts