{"id":"b71fb76c-48db-4184-b6a8-040c589d2795","arxiv_id":"2607.26771","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"low","formal_verification":"none","parameter_count":5,"one_line_summary":"Gate-based QAOA can replace annealing for cut selection in MCMS Benders on VRP, but at tested scales cut selection is not the classical bottleneck and QAOA is slower than Cbc.","lead":"The authors built an end-to-end hybrid pipeline that uses QAOA to pick Benders cuts for vehicle-routing MILPs, extending a prior annealing-based method. On the sizes they can run, classical cut selection is already cheap, so quantum speedup in that step looks unlikely until much larger instances and better QUBO solvers exist.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The reader correctly identifies the strongest claim and the real (but already author-owned) weakest assumption about scaling/extrapolation. Because the paper’s headline conclusion is explicitly limited to “problems of this size” and is directly supported by the two timing regimes they measured, that assumption is not load-bearing for the claim as stated. No further concern rises to the level that would move an ACCEPT. The suggested concrete_test is a useful robustness check the authors themselves gesture at in §VI, not a refutation.","tokens_in":11241,"tokens_out":383,"duration_ms":29985,"concrete_test":"Re-run the Fig. 3 QOptLib protocol (same 10 permutations, 2/4/16/64 subproblems) replacing Cbc multi-solution extraction with a commercial MILP solver’s native solution pool at fixed time-per-iteration; if cut-selection time rises above ~10% of median iteration time under that regime, the bottleneck diagnosis would need re-qualification.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper’s central empirical claim is narrowly scoped and matched by the reported evidence: on the QOptLib n=20 classical MCMS runs, cut selection is a negligible fraction of iteration time (Fig. 3, MP-dominated); on n=5 toys with MPS-JuliQAOA, cut selection consumes ~99.3% of wall-clock time and is far slower than Cbc, so advantage for this insertion point is unlikely at these sizes (§V-B, §VI). The authors already flag the two natural extrapolation risks (solver quality / sequential multi-solution extraction inflating MP time; set-cover→QUBO overhead) and do not claim asymptotic advantage. No internal inconsistency or unsupported leap undermines the stated claim.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The manuscript presents an end-to-end hybrid quantum–classical pipeline that embeds QAOA (on tensor-network emulators and IBM superconducting hardware) into the cut-selection step of Multiple-Cuts-via-Multiple-Solutions (MCMS) Benders decomposition for MILPs, extending Paterakis’s annealing-based HQC-MCMS framework. Using the capacitated VRP as a case study, the authors run fully classical MCMS on 10 permutations of a QOptLib instance (20 customers, 4 vehicles) and a hybrid end-to-end pipeline on five random toy VRPs (n=5) with MPS-JuliQAOA. They report that cut selection is a negligible fraction of classical iteration time (master-problem solves dominate; Fig. 3), whereas on the toys ~99.3% of wall-clock time is spent in QAOA cut selection, so quantum advantage for this insertion point is unlikely at the sizes considered. They also demonstrate QAOA sample statistics on a small set-cover instance across three backends (Fig. 5).","tokens_in":11339,"tokens_out":1120,"duration_ms":29195,"significance":"The contribution is primarily empirical and infrastructural: a working, publicly coded end-to-end bridge from MCMS Benders to gate-based QAOA solvers, plus a clear, modestly scoped negative result on bottleneck location. That honesty is valuable for the hybrid-optimisation community; the paper does not over-claim asymptotic advantage and explicitly flags the need for larger-scale tests once stronger QUBO oracles exist. Reproducible code, standardised QOptLib instances, and multi-backend QAOA runs are concrete strengths. Significance is incremental rather than transformative, but appropriate for a methods/applications venue.","major_comments":[{"comment":"§V-A / Fig. 3 and §VI: The central classical claim (cut selection is a negligible fraction of iteration time) rests on Cbc with sequential extraction of multiple feasible master solutions. The authors note that commercial solvers can extract multiple solutions far more cheaply, which would further shrink the relative cost of cut selection and strengthen, not weaken, their conclusion. Still, a short quantitative sensitivity check—or at least a clearer statement that the reported MP times are an upper bound on the classical bottleneck—would make the load-bearing timing comparison more robust before readers generalise beyond open-source solvers.","section":"§V-A, Fig. 3; §VI"},{"comment":"§V-B and Abstract: The hybrid end-to-end assessment (and the 99.3% cut-selection share) is performed only on n=5 toys with p=1 MPS-JuliQAOA. The wording “quantum advantage of this framework unlikely at problems of this size” is therefore well-supported for the toys but is easy to misread as applying to the QOptLib scale. A single clarifying sentence that separates the classical bottleneck profile (n=20) from the hybrid runtime profile (n=5) would prevent over-extrapolation while preserving the paper’s careful stance.","section":"§V-B; Abstract"}],"minor_comments":[{"comment":"Fig. 4 caption writes “HQC-MCMC Benders” instead of “HQC-MCMS Benders”.","section":"Fig. 4"},{"comment":"Table I header “QOptLib MCMS Toy HQC-MCMS” is hard to parse; a two-column layout (Classical QOptLib | Hybrid toy) would be clearer.","section":"Table I"},{"comment":"Eq. (14) defines the optimality gap with an “∞ else” branch that is never plotted; a brief note on how unbounded cases are handled in Fig. 2 would help.","section":"§V-A, Eq. (14)"},{"comment":"Fig. 5: most QAOA samples are infeasible set covers. The text already mentions post-selection of the lowest-cost valid cover; stating the acceptance rate (or number of shots needed to obtain one valid cover) would make the practical overhead transparent.","section":"§V-C, Fig. 5"},{"comment":"References [14] and [15] have 2026 dates; confirm they are citable or mark as preprints consistently with the rest of the bibliography.","section":"References"},{"comment":"Minor typography: “1st Camille de Valk” style author block and occasional missing spaces around citations could be cleaned for camera-ready.","section":"Title page / passim"}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is a solid, modest empirical systems paper. I see no load-bearing error; the two major comments are clarification/robustness requests, not blockers. Fit is better for a quantum-applications or hybrid-optimisation venue than for a pure theory journal. Reader and skeptic assessments align with my reading: accept-level science with light revision."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The useful bit is the timing evidence, not a new algorithm. They take Paterakis’s HQC-MCMS Benders (cut selection as min-set-cover QUBO), swap annealing for gate-based QAOA (Ava, MPS-JuliQAOA, IBM via Qiskit), and run a real end-to-end VRP pipeline on 10 QOptLib permutations (20 customers, 4 vehicles) plus five toys. Claims stay modest and match the figures: classical MCMS has MP solve dominating and cut selection orders of magnitude cheaper (Fig. 3); on the toys with MPS-JuliQAOA, cut selection eats ~99% of wall-clock and loses badly to Cbc, so advantage for this slot is unlikely at these sizes. Code is public. That is a clean, non-hype baseline that practitioners choosing where to spend QPU time can actually use.\n\nNovelty is incremental—the core framing is [1]; the new work is the gate-based wiring, the QOptLib case study, and the classical-vs-hybrid profiles. Soundness is fine for what they claim: gaps fall without fake optimality, percentiles are reported, and §VI already flags the two real caveats (open-source solvers plus sequential multi-solution extraction inflate MP time; set-cover→QUBO overhead). The soft spot is extrapolation: n≈20 classical and n=5 QAOA do not tell you whether the bottleneck ever flips at scale, and they never close the gap under the 1.5 h limit. That is a scope limit, not a hidden flaw, and they own it.\n\nMath and citations look ordinary and solid; no circularity. This is for people building hybrid MILP pipelines who need negative/cautionary placement evidence, not for someone hunting asymptotic quantum advantage. I would send it to referees—claims track data, reproducible, useful as a baseline—even if I would not rearrange my own agenda around it.","headline":"Honest engineering extension of Paterakis: cut selection is not the classical bottleneck on these VRPs, so this QAOA insertion point looks weak at the sizes they can actually run.","tokens_in":12096,"tokens_out":505,"would_cite":false,"duration_ms":17628,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"At the vehicle-routing sizes tested, cut selection is not the bottleneck in MCMS Benders, so a quantum QAOA step is unlikely to help.","keywords":["Benders decomposition","Hybrid Quantum Computing","QUBO","Vehicle Routing Problem","QAOA","MCMS","cut selection","MILP"],"falsifier":"A scaling study on larger VRPs (or other MILPs) in which cut-selection QUBOs become both large enough that classical solvers slow down and cheap enough on future QUBO hardware that total Benders time drops below a strong classical baseline.","tokens_in":12049,"feed_emoji":"🚚","tokens_out":819,"duration_ms":14266,"temperature":0.7,"pith_summary":"This paper builds a full hybrid pipeline that solves mixed-integer linear programs by Benders decomposition, handing the cut-selection step to QAOA on gate-based emulators and hardware. The authors take a standard vehicle-routing benchmark (20 customers, 4 vehicles) and show that, when cut selection is done classically, almost all iteration time goes into solving the master problem; cut selection itself is a small fraction of the work. On smaller toy instances they close the loop with a tensor-network QAOA solver and find the opposite: cut selection then consumes the bulk of wall-clock time and is far slower than a classical MIP solver. The central claim is therefore negative but practical: quantum advantage for this particular cut-selection formulation is unlikely at the problem sizes examined, and only large-scale tests with faster QUBO solvers can decide whether the bottleneck ever moves.","feed_headline":"Quantum cut selection unlikely to speed VRP Benders at tested sizes","feed_subtitle":"Master solves dominate classical time; QAOA cut selection eats nearly all runtime on toys","key_machinery":"HQC-MCMS Benders: multiple candidate solutions per iteration generate a pool of cuts that is reduced by solving a minimum-set-cover QUBO with QAOA; the selected cuts are returned to the classical master problem.","core_discovery":"For the QOptLib VRP instances examined, classical MCMS Benders spends only a small fraction of each iteration on cut selection (master-problem solving dominates). When the same cut-selection step is performed by QAOA on a toy VRP, that step accounts for roughly 99 percent of wall-clock time, making quantum advantage for the framework unlikely at these sizes.","pith_inferences":["Master-problem growth, not cut selection, is the more promising classical target for speed-ups in multi-cut Benders.","Alternative cut-selection encodings (maximum independent set, HUBO) will face the same bottleneck test: they must dominate runtime before a quantum oracle can matter.","The negative result is useful as a template for other hybrid MILP claims that have not yet published stage-by-stage timings."],"forward_implications":["At the scales tested, accelerating cut selection alone will not speed up MCMS Benders for VRP.","End-to-end hybrid pipelines must measure wall-clock share of every stage, not only the quantum subroutine.","Set-cover-to-QUBO encoding overhead remains a first-order obstacle even if a fast QUBO oracle appears.","Large-scale benchmarking with stronger QUBO solvers is required before claiming advantage for this architecture."],"fun_headline_variants":["QAOA cut selection takes ~99% runtime on toy VRP Benders","Classical master solves dominate; quantum cuts lag at tested sizes","Hybrid MCMS Benders unlikely to gain from quantum cuts on small VRP","Cut selection is tiny classically but swamps QAOA toy VRP pipeline","No quantum edge for VRP Benders when QAOA handles cuts on toys"],"cache_read_input_tokens":128,"weakest_assumption_plain":"That the relative cost of cut selection versus master and subproblem solves seen at these small sizes will still decide whether cut selection is the right place to put a quantum solver when instances grow.","fun_headline_variants_meta":{"raw":{"variants":["QAOA cut selection takes ~99% runtime on toy VRP Benders","Classical master solves dominate; quantum cuts lag at tested sizes","Hybrid MCMS Benders unlikely to gain from quantum cuts on small VRP","Cut selection is tiny classically but swamps QAOA toy VRP pipeline","No quantum edge for VRP Benders when QAOA handles cuts on toys"]},"model":"grok-4.5","effort":"low","cost_usd":0.004185,"raw_usage":{"total_tokens":1308,"prompt_tokens":807,"num_sources_used":0,"completion_tokens":83,"cost_in_usd_ticks":41848000,"prompt_tokens_details":{"text_tokens":807,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":418,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":807,"tokens_out":83,"duration_ms":9090,"temperature":1.0,"reasoning_tokens":418,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-30T21:32:51.744717+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"A scaling study on larger VRPs (or other MILPs) in which cut-selection QUBOs become both large enough that classical solvers slow down and cheap enough on future QUBO hardware that total Benders time drops below a strong classical baseline.","supporting_citations":[],"review_version":1}