### wai-quantum 0.6.6: Clifford circuits measured in a product basis, exactly, by cut-rank

Additive. Every pinned digest is unchanged.

- **`Tableau::graph_form`** (`quantum_tableau`) writes a stabilizer state as local Cliffords
  (`H^h S^s Z^z` per qubit) on a graph state. Tested by rebuilding the state from the form
  over 40 random circuits.
- **`quantum_cutrank`** (a new feature, in `full`) sums a Clifford circuit's state measured
  after one closing layer of single-qubit gates at any angles:
  `⟨x| ⊗ V_q |ψ⟩ = 2^{-n/2} Σ_z ∏_q W_q[x_q][z_q] (−1)^{Σ_{a~b} z_a z_b}`.
  - The sum goes one qubit at a time along an order, in a table of `2^{cut-rank}` entries.
    Each qubit is an in-place pass: a merge where the boundary space loses a dimension, the
    qubit's signed terms, and a doubling or an XOR-shifted sum for its edges ahead.
  - The passes depend on the graph and the order alone, so they are planned once per state.
  - By Parseval, the table's norm is a prefix's probability, so the same passes sample
    exactly: `amplitude`, `probability`, `sample`.
  - `Precision::Single` stores the table in `f32` with `f64` arithmetic: half the memory and
    traffic. `anneal_order` searches orders for less work (`work` = Σ 2^cut) and never
    returns a worse one.
  - Every reduction is summed in fixed chunks, so a result is the same bits at any thread
    count.
  - Tests:
    - amplitudes equal the state vector's in probability and relative phase (30 circuits up
      to 12 qubits);
    - forward, reverse and shuffled orders agree (24 to 54 qubits);
    - single-precision tables agree with double;
    - samples follow the exact law and are seeded;
    - annealing lowers the work and keeps the amplitudes;
    - cut-ranks are the entanglement of GHZ and product states.
  - Five mutants are caught: the merge's signs, the sampling choice, the doubling's sign,
    the fold's coefficient, and the graph form without its S.
- **Examples:**
  - `cutrank_qasm` reads an OpenQASM 2 Clifford bulk with a closing single-qubit layer, and
    prints cut-ranks, annealed orders, amplitudes and exact samples. On a 70-qubit
    graph-state sampling circuit, an annealed order keeps every cut at 29 bits or fewer: one
    amplitude in about half a second, one exact sample in 1.1 to 1.5 s, with a largest
    table of 4 GiB.
  - `patch_xeb` scores measured shots of a patched circuit by patched cross-entropy, each
    patch simulated exactly on the dense state vector.
  - `tn_cost` prints the contraction cost of one amplitude as `find_path` finds it.

