wai-quantum 0.3.31: quantum-inspired optimisation, a re-runnable classical baseline #151

Merged

dcharlot merged 1 commit from wai-quantum-qio into main 2026-10-05 10:55:34 -04:00

Conversation 0 Commits 1 Files changed 14 +1139 -22

dcharlot commented 2026-10-05 05:27:52 -04:00

Owner

Copy link

What

quantum_qio (wai-quantum 0.3.31) is a deterministic, re-checkable classical baseline for optimisation. Optimisation is the claim made most often for quantum hardware, and each such claim is a comparison with a classical solver.

• Problems. Ising (sparse symmetric J, fields h) and Max-Cut (J = −w), a G-set reader, and the ±1 all-to-all spin glass.
• Simulated bifurcation. Ballistic, discrete, heated ballistic and heated discrete, from the published update rules: symplectic Euler, inelastic walls, and heating after the walls (arXiv:2203.08361).
  • Fields ride on an extra spin.
  • Eight trials advance together per pass over the couplings, bit-identical to running one at a time.
• Also included. Simulated annealing, single-flip descent, an exact Gray-code referee up to 34 spins, and step-to-solution.
• CLI. wai-quantum qio …. Example: qio_gset.

Checked

• Small instances. Every simulated-bifurcation variant, and annealing, reaches the exact ground state on 20-spin glasses.

• Batching. Batched runs leave the same final positions, bit for bit, as one trial at a time. The test fails on a 1e-15 change to one lane; a mutation that leaves the arithmetic exactly the same passes, as it should.

• G-set best-known cuts reached (seed 1):

  Instance	Cut	Method
  G1	11,624	39% of 2,000-step trials
  G2	11,620
  G3	11,622
  G11	564
  G14	3,064	annealing; simulated bifurcation stops at 3,062
  G22	13,359
  G43	6,660

  On G55 the best found is 10,292, against a best-known 10,299.

• Stability finding. The published step size for dense glasses (Δt = 1.1) blows up on sparse Max-Cut graphs.

  • The stiffest mode has ω² = a₀(a₀ − c₀μ_min) with μ_min = −degree, so the stable limit on G1 is near Δt = 0.88.
  • The working settings are documented.

• Determinism. The new pin holds natively and under wasm32-wasip2, and all 16 pins pass. CLI output is byte-identical between the two, threaded or not, including G-set input.

• Lint and tests. Clippy is clean on the new code, the prose checks pass, and the full suite (403 library tests) passes.

• Not covered. The dense K2000 benchmark is left out because its host was unreachable from here.

🤖 Generated with Claude Code

## What `quantum_qio` (wai-quantum 0.3.31) is a deterministic, re-checkable classical baseline for optimisation. Optimisation is the claim made most often for quantum hardware, and each such claim is a comparison with a classical solver. - **Problems.** Ising (sparse symmetric `J`, fields `h`) and Max-Cut (`J = −w`), a G-set reader, and the ±1 all-to-all spin glass. - **Simulated bifurcation.** Ballistic, discrete, heated ballistic and heated discrete, from the published update rules: symplectic Euler, inelastic walls, and heating after the walls (arXiv:2203.08361). - Fields ride on an extra spin. - Eight trials advance together per pass over the couplings, bit-identical to running one at a time. - **Also included.** Simulated annealing, single-flip descent, an exact Gray-code referee up to 34 spins, and step-to-solution. - **CLI.** `wai-quantum qio …`. Example: `qio_gset`. ## Checked - **Small instances.** Every simulated-bifurcation variant, and annealing, reaches the exact ground state on 20-spin glasses. - **Batching.** Batched runs leave the same final positions, bit for bit, as one trial at a time. The test fails on a 1e-15 change to one lane; a mutation that leaves the arithmetic exactly the same passes, as it should. - **G-set best-known cuts reached** (seed 1): | Instance | Cut | Method | |---|---|---| | G1 | 11,624 | 39% of 2,000-step trials | | G2 | 11,620 | | | G3 | 11,622 | | | G11 | 564 | | | G14 | 3,064 | annealing; simulated bifurcation stops at 3,062 | | G22 | 13,359 | | | G43 | 6,660 | | On G55 the best found is 10,292, against a best-known 10,299. - **Stability finding.** The published step size for dense glasses (Δt = 1.1) blows up on sparse Max-Cut graphs. - The stiffest mode has `ω² = a₀(a₀ − c₀μ_min)` with `μ_min = −degree`, so the stable limit on G1 is near Δt = 0.88. - The working settings are documented. - **Determinism.** The new pin holds natively and under wasm32-wasip2, and all 16 pins pass. CLI output is byte-identical between the two, threaded or not, including G-set input. - **Lint and tests.** Clippy is clean on the new code, the prose checks pass, and the full suite (403 library tests) passes. - **Not covered.** The dense K2000 benchmark is left out because its host was unreachable from here. 🤖 Generated with [Claude Code](https://claude.com/claude-code)

dcharlot added 1 commit 2026-10-05 05:27:52 -04:00

wai-quantum 0.3.31: quantum-inspired optimisation, a re-runnable classical baseline ... 92f9e000cd

Optimisation is the claim made most often for quantum hardware, and each such
claim is a comparison with a classical solver. quantum_qio is that solver,
deterministic and re-checkable:

- Ising problems (sparse symmetric J, fields h) and Max-Cut (J = -w), a G-set
  reader, and the +-1 all-to-all spin glass.
- Simulated bifurcation from its published update rules: symplectic Euler,
  perfectly inelastic walls, ballistic (f = Jx) and discrete (f = J sgn x)
  forces, and both heated (arXiv:2203.08361), with c0 = c1 / (rms(J) sqrt N).
  Fields ride on an extra spin fixed at +1.
- Eight trials advance per pass over the couplings; each trial's arithmetic is
  unchanged, so a batched run leaves the same final positions bit for bit as
  one trial at a time. The test fails on a 1e-15 change to one lane.
- Simulated annealing (single-spin Metropolis, linear beta), single-flip
  descent, an exact Gray-code referee up to 34 spins (threaded), and
  step-to-solution S = N_s ln 0.01 / ln(1 - P).

Checked:
- every variant and annealing reach the exact ground state on 20-spin glasses;
- G-set best-known cuts reached (seed 1): G1 11624 (39% of 2,000-step
  trials), G2 11620, G3 11622, G11 564, G14 3064 (annealing; bifurcation
  stops at 3062), G22 13359, G43 6660; G55 reaches 10292 of 10299;
- the published dense-glass step (1.1) is unstable on sparse Max-Cut graphs:
  the stiffest mode has w^2 = a0(a0 - c0 mu_min) and mu_min = -degree, so G1's
  limit is near 0.88; documented, with the settings that work.

CLI: wai-quantum qio (--gset FILE | --sk N) --method dsb|bsb|hdsb|hbsb|sa|exact
[--descend --target --spins --json]. Example: qio_gset. Pinned bit for bit
natively and under wasm32-wasip2 (16 pins); CLI output byte-identical across
the two, threaded or not, G-set files included.

Co-Authored-By: Claude Opus 5.5 <[email protected]>

dcharlot referenced this pull request 2026-10-05 07:46:16 -04:00

wai-quantum 0.3.32: union-find decoding in near-linear time #155

dcharlot referenced this pull request 2026-10-05 08:08:11 -04:00

wai-quantum 0.3.33: noisy circuits, and where the digital error model is off #156

dcharlot referenced this pull request 2026-10-05 09:50:45 -04:00

wai-quantum 0.3.34: ground states of spin chains by DMRG, held to exact answers #159

dcharlot merged commit bffbace524 into main 2026-10-05 10:55:34 -04:00

dcharlot referenced this pull request from a commit 2026-10-05 10:55:35 -04:00

Merge pull request 'wai-quantum 0.3.31: quantum-inspired optimisation, a re-runnable classical baseline' (#151) from wai-quantum-qio into main

dcharlot referenced this pull request 2026-10-05 11:14:04 -04:00

wai-quantum 0.3.35: time evolution of spin chains by TDVP, held to exact answers #160

Sign in to join this conversation.

Reviewers

No reviewers

Labels

Clear labels

No items

No labels

Milestone

Clear milestone

No items

No milestone

Projects

Clear projects

No items

No project

Assignees

Clear assignees

No assignees

1 participant

Notifications

Subscribe

Due date

The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set

Reference

Transaction-Science/open-standards!151

No description provided.