Answers are grounded in this paper and cite their sources.
Industrial quantum computing requires problem decompositions that respect near-term resource limits while preserving operational value. This study presents a hybrid classical-quantum workflow for autoclave batch scheduling in composite manufacturing, in which release-time and cure-family logic remain in a classical orchestration layer and each batch-selection decision is encoded as a quadratic unconstrained binary optimization (QUBO) problem. Candidate pools of 4–10 jobs produce 8–14 logical-qubit QAOA subproblems after capacity-slack encoding. Depth-1 and depth-2 QAOA were evaluated using noiseless statevector simulation, with depth-2 parameters trained on four instances per problem size and transferred without re-optimization to six held-out instances per size. For transferred depth-2 QAOA, decoded feasible probability mass decreased from 0.956 at 8 qubits to 0.427 at 14 qubits, while optimal-subset probability decreased from 0.05283 to 0.00150. Comparison with an exact uniform-sampling null showed no consistent optimal-subset concentration advantage for transferred p=2 QAOA, despite exact best-of-4096 recovery across the held-out instances. The estimated sampling budget for a 95% probability of observing the optimum increased from approximately 55 to 2000 shots. In 15 end-to-end synthetic production scenarios containing 24–48 jobs, no statistically significant differences were detected between transferred QAOA and exact per-batch selection or simulated annealing for any reported schedule metric. Relative to greedy selection, transferred QAOA increased mean autoclave utilization by 2.70% points, corresponding to a 3.3% relative increase. This was the only nominally significant paired difference against greedy selection (unadjusted Wilcoxon $$\:p=0.029$$ ); other schedule metrics improved directionally but were not statistically significant. All results were obtained using noiseless statevector simulation and establish neither quantum advantage nor hardware-level speedup, but rather a testable quantum-classical integration pathway defined by decomposition, parameter reuse, sampling burden, and classical fallback.
No takes yet. Share an insight, caveat, or question.
Otaru et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: