A Cost-Model Benchmark for Mixed-State Quantum Simulation Workloads: Entanglement‑Cost Anchors and Reuse‑Aware Re‑Entry Metrics

In the paper's words

Classical simulation of quantum circuits is increasingly organized as repeated‑run workloads—variational‑parameter sweeps, noisy multishot studies, and error‑correction cycles—so that the cost of a workload, not a single circuit, determines feasibility. Mixed‑state targets arise from noise channels, thermal ensembles, and decohered registers, yet most existing benchmarks address only pure‑state workloads and therefore underestimate difficulty. This paper fills the gap by defining a benchmark specification that (i) selects a family of mixed‑state anchors whose entanglement cost is exactly known via the additivity of entanglement of formation on two‑Bell‑state mixtures; (ii) computes those anchor costs with full arithmetic; and (iii) embeds the anchors in a three‑layer memory‑and‑energy cost model that scales the representation overhead as R_n=2^n and projects energy consumption using a DRAM‑traffic coefficient and an orchestration factor [10].

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Double‑precision complex numbers (16 bytes) are assumed; alternative precisions would alter storage and traffic.

   from 7. Practical Implications and Engineering Pathways

2. For a 10‑qubit register the mixed‑state memory overhead is $1024\times$ (16 MiB vs 16 KiB) and the projected energy per $10^{4}$‑step workload is $33.554432$ J under the stated assumptions.

   from Abstract

3. The resulting factor‑1024 memory increase can dominate procurement budgets and dictate whether a workload fits on a given node.

   from 1. Introduction

4. Closed‑form representation‑overhead ratio $R_n=2^{n}$ for density‑matrix versus state‑vector simulation (Section 4.2).

   from 1. Introduction

5. A three‑layer model (compute/memory, representation overhead, orchestration) in the spirit of [10], combining the exact anchor ebits with a density‑matrix scaling factor.

   from 3.1 Design goals

How it is done

1. Correction (version 2.0.2, 2026-10-19): statements that described experiments, measurements, reviews or registrations as done were corrected; none took place.

   from A Cost-Model Benchmark for Mixed-State Quantum Simulation Workloads: Entanglement‑Cost Anchors and Reuse‑Aware Re‑Entry Metrics

2. Quantum‑algorithm developers, high‑performance‑computing (HPC) centers, and hardware vendors face a concrete obstacle: classical simulators must allocate memory and energy that grow dramatically when the target state is mixed rather than pure, but existing benchmark suites report only pure‑state costs.

   from 1. Introduction

3. This structural analogy motivates a benchmark that must handle “mixed conditions’’—partially coherent, partially decohered registers—before quantitative estimates are introduced. [2] proposes an estimation‑aware optimal‑control method for mobile‑sensor target tracking, emphasizing that planning must account for uncertainty in the estimated target state.

   from 2. Background and Related Work

4. The benchmark specification consists of three components: Anchor states.

   from 3.1 Design goals

What would falsify it

1. The claim $E_{C}(\rho_{p})=E_{F}(\rho_{p})$ would be falsified if the additivity result of [5] were shown not to cover arbitrary two‑Bell‑state mixtures.

   from 6. Discussion

2. The claim that mixed‑state workloads are strictly harder than pure‑state workloads would be falsified by a simulator class whose mixed‑state representation scales sub‑exponentially with $n$ in the relevant regime.

   from 6. Discussion

3. A measured $R_{5}$ significantly lower than 32 or an $E_{\text{step}}$ deviating by more than a factor of 3 would falsify the scaling assumptions.

   from 7. Practical Implications and Engineering Pathways

Where the claim stops

1. The additivity technique of [5] applies solely to states supported on the specific two‑dimensional subspace, so extending exact anchors to richer families remains an open problem.

   from 6. Discussion

2. If a simulator employs a representation other than a full density matrix (e.g., tensor‑network or stabilizer mixed‑state methods), the $R_{n}=2^{n}$ overhead does not apply, potentially mis‑ranking such methods.

   from 6. Discussion

3. The energy projection relies entirely on the assumed DRAM coefficient $e_{\text{DRAM}}$ and orchestration factor $f_{\text{orch}}$; deviations from these assumptions would scale the projected energy linearly.

   from 6. Discussion

Where to read

1. Abstract204 words · 1 min
2. 1. Introduction285 words · 1 min
3. 2. Background and Related Work342 words · 1 min
4. 3. Methods211 words · 1 min
5. 4. Analysis300 words · 1 min
6. 5. Results119 words · 1 min
7. 6. Discussion258 words · 1 min
8. 7. Practical Implications and Engineering Pathways374 words · 2 min
9. 8. Conclusion80 words · 1 min
10. Correction Notice138 words · 1 min
11. Provenance and AI Involvement237 words · 1 min
12. Appendix A. Divergence report13 words · 1 min