Metraipolis › archive › dc_32bfbbee1f57

Optimal Stratification of a Sampling Frame: A Comparative Study of Classical, Quantum, and Quantum-Inspired Approaches — arXiv:2608.10787

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.10787
License (as archived)
CC0-1.0
Archived
2026-10-19T06:25:23.591Z
SHA-256 of the archived text
b2994aef54456f9b9499b8a2aa0b9d78ec44dd250fdcaacf10e52f4b634cd5da
Stable URL of this page
https://metraipolis.com/documento/dc_32bfbbee1f57

How to cite

Optimal Stratification of a Sampling Frame: A Comparative Study of Classical, Quantum, and Quantum-Inspired Approaches — arXiv:2608.10787 — arXiv (en), https://arxiv.org/abs/2608.10787 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_32bfbbee1f57 (Metraipolis archive dc_32bfbbee1f57, sha256 b2994aef54456f9b9499b8a2aa0b9d78ec44dd250fdcaacf10e52f4b634cd5da)
BibTeX
@misc{dc32bfbbee1f57,
  title = {Optimal Stratification of a Sampling Frame: A Comparative Study of Classical, Quantum, and Quantum-Inspired Approaches — arXiv:2608.10787},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.10787},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_32bfbbee1f57; sha256 b2994aef54456f9b9499b8a2aa0b9d78ec44dd250fdcaacf10e52f4b634cd5da},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10787. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Optimal stratification aggregates strata into a small number of final strata to minimise total sample size required to meet target precision constraints. This combinatorial objective, reformulated as a within-cluster dispersion surrogate, can be expressed as a quadratic unconstrained binary optimisation (QUBO) problem. This paper reports a comparative case study of four solvers for that surrogate, run under heterogeneous free-tier constraints on an identical twenty-stratum frame from the swissmunicipalities dataset: a D-Wave-formulated QUBO, solved here by simulated annealing (QPU access unavailable); a gate-based quantum processor (IBM Quantum, running QAOA); a photonic entropy-quantum-computing device (QCi Dirac-3); and a classical GPU-based Ising machine as control (Fixstars Amplify AE). Solvers differ in hardware, computational budget, iteration count, and, for IBM, the encoding itself, so the comparison is a case study rather than a controlled experiment. Against a genetic-algorithm benchmark of 129 sample units, the best-known QUBO solution (objective 501.0) maps, after Bethel-Chromy evaluation, to a sample size of 160, a gap of roughly 24%, tied to the best solution found rather than a certified optimum. IBM and Dirac-3 fall further short, at 262 and 286; the IBM result is consistent with SWAP-routing degradation on a sparse qubit lattice, though not isolated from other causes, while Dirac-3, despite genuine optimisation, settles short of what a free GPU reaches in seconds. The paper concludes that a classical genetic algorithm remains, at the scale tested, the method of choice for optimal stratification, reflecting (a) limits of the dispersion surrogate versus the true Bethel-Chromy objective, not encodable as a low-degree polynomial, and (b) solver- and platform-specific limits in the IBM and Dirac-3 runs. These findings do not establish global optimality for either result.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-12 in stat.ME).
Categorie arXiv: Methodology (stat.ME) ; Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.10787 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T06:16:10.991Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).