3-qubit repetition code that encodes 1 logical qubit and corrects single bit-flip (X) errors.

Fair coin flipping over a quantum channel: Alice and Bob each contribute randomness via entanglement.

Demonstrate the phase kickback trick: a CNOT with ancilla in |−⟩ imprints a phase on the control qubit.

Find the hidden period s='11' of a 2-to-1 function f(x) = f(x⊕s) with exponential quantum speedup.

Teleport an arbitrary single-qubit state from Alice to Bob using a shared Bell pair and two classical bits.

Count the number of solutions to a 2-qubit oracle (marks |11⟩) using QPE applied to Grover's operator.

Generate 4 truly random bits using quantum superposition and measurement.

One first-order Trotter step simulating the 1D transverse-field Ising model on 4 qubits (J=1, h=0.5, dt=0.1).

3-qubit code that corrects single phase-flip (Z) errors by encoding in the X basis.

Reversible quantum half-adder: computes sum = a XOR b and carry = a AND b for 1-bit inputs.

Estimate the eigenphase φ=1/8 of the T gate: U|ψ⟩=e^{i2πφ}|ψ⟩ using 3 counting qubits.

Quadratic speedup for unstructured search: finds |11⟩ among 4 basis states with one Grover iteration.

W state: symmetric 3-qubit entangled state (|001⟩ + |010⟩ + |100⟩)/√3.

Core period-finding subroutine of Shor's algorithm: find the period r of f(x) = 7^x mod 15.

Estimate Re(⟨ψ|U|ψ⟩) for U=Z gate and |ψ⟩=|+⟩ using a single ancilla qubit.

Greenberger–Horne–Zeilinger (GHZ) state: maximally entangled 3-qubit state (|000⟩ + |111⟩)/√2.

Measure |⟨ψ|φ⟩|² between two quantum states using a Fredkin (controlled-SWAP) gate.

Estimate the amplitude a = sin²(π/8) ≈ 0.146 using 3 precision qubits via quantum phase estimation.

Preparation of the maximally entangled two-qubit Bell state |Φ⁺⟩ = (|00⟩ + |11⟩)/√2.

4-qubit Quantum Fourier Transform (QFT): the quantum analogue of the discrete Fourier transform.