{"id":"fb2dadd0-9671-4603-86c8-8b0bf7c692dc","arxiv_id":"2607.10360","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":5.5,"correctness_risk":"low","formal_verification":"none","parameter_count":4,"one_line_summary":"A coarse spectral flag that is δ_c-suboptimal transfers to a fine isometrically lifted problem with suboptimality at most δ_c+2ε, certified by a 2m amplitude Gram matrix, and continuation is justified only when mismatch, feasible-family inclusion, topology, and total work pass audits.","lead":"The paper gives a certificate for when a cheaper quantum-state model can safely warm-start a richer one, using small Gram matrices of complex overlaps instead of full density operators. It shows exact lifts work, approximate transfers need a trace-distance budget, and full multi-rung cascades can cost more than solving the hard problem directly.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified to the central transfer theorems; the reader's weakest assumption is correctly the practical bottleneck.","rationale":"The reader's strongest claim is correctly the δ_c+2ε transfer bound and its 2m Gram realization. Those statements follow from Lemma 2.1 (effect form of trace distance), spectrum preservation under isometric conjugation, and the partial-isometry argument that XSX† and RSR† share nonzero signed eigenvalues. The factor two is attained, so the bound is tight. The paper carefully separates encoder change (density transfer) from exact feasible-family prolongation (Proposition 2.6) and from gap-dependent subspace stability (Proposition 2.9), and it states the Schmidt-rank ceiling (Theorem 2.10) that no continuation path can evade. The executed controls match the theory: exact ancilla lifts give ε~10^{-15}, partial activation keeps the bound informative, full activation correctly rejects, and total cascade work exceeds a direct final-rung solve. The proprietary-code limitation affects only the numerical cascade numbers, not the theorems; the released CSVs and fully specified protocol already allow article-level verification of the reported figures. The reader's weakest assumption (need for complex cross overlaps) is exactly the practical gate that keeps the certificate from being universally algorithmic; it is already flagged in the manuscript. No stronger load-bearing mathematical concern appears. Therefore the CONDITIONAL verdict, high confidence on the math, and moderate novelty assessment stand without adjustment.","tokens_in":15255,"tokens_out":716,"duration_ms":10705,"concrete_test":"Independently re-derive the nonzero signed spectrum identity of Theorem 2.5: form the 2m block Gram K from synthetic pure-state columns with a known isometry V, factor R with K=R†R, form B=RSR†, and check that the nonzero eigenvalues of B match those of ρ_f−V\rho_c V† (including signs) to machine precision for m=8 and m=48; if they disagree, the Gram certificate fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claims (Theorem 2.3 and its Gram realization Theorem 2.5) rest on standard trace-distance control of effects, Ky Fan, and the XSX† / RSR† isometry argument. The proofs are short, self-contained, and the constant 2 is shown sharp by an explicit low-dimensional example (Remark 2.4). The synthetic controls deliberately include negative outcomes (cascade work ratio 4.80–5.43, noninformative 2ε at full activation, ordering-dependent bond 256 vs 2), so the paper does not overclaim that continuation is generically cheaper. The only load-bearing practical condition is already named by the reader: efficient complex cross overlaps ⟨ψ^f_i|V|ψ^c_j⟩ (and the declared contractions). Without them the certificate remains algebraically valid but is not an efficient algorithm; fidelity-only data are insufficient. That condition is stated explicitly after Theorem 2.5 and is not hidden. No internal inconsistency or incorrect inequality was found.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper develops Gram-certified resource continuation for structured quantum-representation workloads: when a solution under a lower-cost resource model is a justified initialization for a richer one. For coarse and fine ensembles linked by a declared isometry V, fine/coarse/cross amplitude overlaps form a PSD block Gram; a signed operator of dimension at most 2m realizes the nonzero signed spectrum of ρ_f − Vρ_c V†, giving trace- and operator-norm diagnostics without materializing either density. Theorem 2.3 proves that a coarse weighted spectral flag with suboptimality δ_c has fine-level suboptimality at most δ_c + 2ε (ε the empirical trace distance), with the factor two shown sharp in Remark 2.4; no spectral gap is required. The authors distinguish encoder change from exact feasible-family prolongation (Prop. 2.6), give a gap-dependent Davis–Kahan subspace test (Prop. 2.9), and prove a path-independent Schmidt-rank ceiling (Thm. 2.10). Deterministic synthetic controls on an 8-to-40-qubit ladder confirm exact ancilla lifts to numerical precision, show that transferred initialization reduces final-rung block updates (30→20) while the full cascade costs 4.80–5.43× a direct solve with no material objective gain, and that reordering eight Bell pairs reduces max MPS bond from 256 to 2. Continuation is justified only when mismatch, feasible-family inclusion, topology, and total work jointly pass prespecified audits; the work claims neither generic 40-qubit simulability nor quan","tokens_in":15585,"tokens_out":1006,"duration_ms":9977,"significance":"If the transfer theorems and protocol hold as stated, the paper supplies a concrete, checkable audit for warm-starting structured quantum-representation problems (flags, tensor networks, product blocks) rather than informal parameter copying. The central results rest on standard linear algebra (Jordan decomposition of effects, Ky Fan, XSX†/RSR† isometry) with an explicit sharp constant, and the synthetic controls deliberately report negative outcomes (cascade work ratio, noninformative 2ε at full activation, ordering-dependent bond). Strengths include the exact 2m Gram certificate (Thm. 2.5), the encoder-change vs. prolongation distinction, the Bell-cap limitation, and transparent total-work accounting. The practical bottleneck—efficient complex cross overlaps—is named after Thm. 2.5 and is not hidden. The contribution is an integration of established ingredients into a Gram-implicit multirank flag-transfer audit; that is useful for the community even if it does not enlarge the set of classically simulable circuits.","major_comments":[],"minor_comments":[{"comment":"After Theorem 2.5, the text correctly notes that fidelity-only data do not determine the complex block Gram. A short forward pointer in the abstract or introduction would help readers who might otherwise expect a fidelity-kernel certificate.","section":null},{"comment":"Figure 1a: the 2ε bounds become noninformative at full activation; the caption already states this is the intended rejection signal, but a single sentence in the main text quantifying how often the bound is tight vs. loose would aid interpretation.","section":null},{"comment":"Section 2.3 / Remark 2.7: the fixed-rank stratum caveat is important; a brief cross-reference to the rank-activation step in the protocol (Methods 4.1, item 5) would make the practical recommendation easier to find.","section":null},{"comment":"Table 1 and Methods: the primary work unit is “attempted block updates.” Wall-time ratios are described as secondary; stating the observed wall-time range (if available from the same runs) would strengthen the total-work claim without changing the conclusion.","section":null},{"comment":"Notation: β := ∑ α_ℓ ≤ 1 is introduced in Eq. (1); the parenthetical that every ε becomes βε when β > 1 is easy to miss—consider elevating it to a short remark.","section":null},{"comment":"References: the self-citation to Alavi et al. (2026) is used only for geometric background; ensuring that arXiv link remains stable (or adding a DOI when available) will help readers.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is careful not to overclaim simulability or advantage and reports negative cascade-work results. Scope is a methodological audit paper rather than a new hardness or advantage result; that is appropriate for quant-ph if the journal accepts theory-plus-synthetic-controls contributions. Proprietary code is not released, but Online Resource 1 supplies the numerical outputs and the protocol is fully specified, which is acceptable given the competing-interest disclosure. No load-bearing technical error found; I would not require major revision."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The punchline is a clean δ_c + 2ε transfer bound for weighted spectral flags under an isometry, with an exact 2m signed Gram certificate that never builds the densities, plus synthetic controls that deliberately show when continuation is not worth it.\n\nWhat is new is the packaging, not the ingredients. Trace-distance control of effects, Ky Fan, Davis–Kahan, amplitude Grams, and Schmidt caps are standard, and the paper says so. The useful piece is the multirank flag transfer with the sharp constant-2 example, the exact-versus-approximate prolongation distinction, and the insistence that total cascade work, topology, and feasible-family inclusion all have to pass declared audits. The proofs are short linear algebra and look correct; Remark 2.4 shows the factor two is tight. The 8-to-40 ladder matches the theory: exact ancilla lifts to machine precision, all 42 transfer rows obey the 2ε inequality, warm start cuts final-rung updates 30→20 but the full cascade costs ~5× a direct solve, and reordering eight Bell pairs drops max MPS bond 256→2. They do not overclaim 40-qubit simulability or hardware advantage.\n\nSoft spots are real but proportionate. The practical bottleneck is already named: you need complex fine–coarse cross overlaps and the structured contractions; fidelity-only data do not determine the Gram. Code is proprietary; they release CSVs and a full protocol, which is better than nothing but not independent reimplementation. Experiments are exploratory synthetic product-block witnesses, not a preregistered confirmatory study. Significance is subfield-scale—honest progress for people who already do tensor-flag or quantum-ML optimization audits, not a field reorganizer.\n\nThis is for readers who care about certified warm starts and resource ladders in structured quantum representation. Math and citation pattern look solid; self-citation is background, not a hidden premise. I would send it to peer review. Engage if that is your lane; skip if you only want new physics or open code.","headline":"Solid, carefully proved transfer audit for structured warm starts; moderate novelty, honest negative controls, worth a referee.","tokens_in":16243,"tokens_out":509,"would_cite":true,"duration_ms":8937,"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":"A solution from a cheaper quantum resource model is a justified start for a richer one only when Gram audits on mismatch, feasible families, topology, and total work all pass.","keywords":["certified warm starting","resource continuation","flag manifolds","amplitude Gram matrices","tensor networks","quantum machine learning audits","trace distance transfer","Schmidt-rank ceiling"],"falsifier":"In a controlled encoder-change ladder where the complex cross overlaps are available, measure the fine suboptimality of the lifted coarse flag; if it systematically exceeds δc+2ε, or if a cascade whose audits all pass still fails to match a matched cold final-rung solve on total work and objective, the central transfer claim fails.","tokens_in":16140,"feed_emoji":"⚛️","tokens_out":1059,"duration_ms":10507,"temperature":0.7,"pith_summary":"Dense n-qubit states cannot be written out classically, so large structured quantum-representation problems are often solved on a ladder of cheaper models and then transferred upward. This paper asks when that transfer is scientifically justified rather than informal warm starting. For coarse and fine ensembles linked by a declared isometry, fine, coarse, and cross amplitude overlaps form a block Gram matrix; a signed matrix of size at most twice the sample count recovers the nonzero spectrum of the fine density minus the lifted coarse density, giving trace- and operator-norm diagnostics without building either density. A coarse weighted spectral flag that is δc-suboptimal remains at most δc+2ε suboptimal after the lift, where ε is the empirical trace distance; the factor two is sharp. Exact prolongations (idle-ancilla lifts, nested bond caps, product-block merges) preserve the objective; approximate ones and encoder changes do not. Continuation cannot beat a final Schmidt-rank ceiling, and topology can change the required bond by orders of magnitude. Synthetic 8-to-40-qubit controls show exact lifts work to numerical precision and that warm starts can cut final-rung iterations yet raise total cascade cost. The claim is that continuation is defensible only when those audits are specified in advance and satisfied.","feed_headline":"Warm starts for bigger quantum models need Gram audits first","feed_subtitle":"A coarse flag stays within δc+2ε of fine optimum; cascades can still cost 5× a direct solve","key_machinery":"The 2m-dimensional amplitude-Gram certificate (Theorem 2.5): fine, coarse, and cross complex overlaps form a PSD block Gram K; any factor R of K yields a signed matrix B=RSR† whose nonzero signed spectrum equals that of ρf−VρcV†, so the empirical trace distance ε and operator-norm ζ are read from B alone and feed the δc+2ε transfer bound.","core_discovery":"A coarse weighted spectral flag that is δc-suboptimal for the coarse empirical return has fine-level suboptimality at most δc+2ε after an isometric lift, where ε is the empirical trace distance between the fine density and the lifted coarse density; no spectral gap is required, and the constant two is attained. The same diagnostics are realized exactly by a signed operator of dimension at most 2m built from the fine/coarse/cross amplitude Gram, without materializing either density operator.","pith_inferences":["Any multilevel quantum-inspired or hybrid solver that claims progressive resource enrichment should publish the same cross-rung Gram diagnostics or an equivalent mismatch certificate.","Train-only topology or ordering search may yield larger practical gains than uniform bond growth, but must be locked before test evaluation to avoid overfitting.","Hardware or shot-budget versions of the same audit would need an explicit noise model for estimated overlaps and a declared positive-semidefinite projection step.","The framework supplies a template for auditing warm starts in classical multilevel optimization whenever two resource models share an empirical density and nested feasible families."],"forward_implications":["Warm starts must be reported as total cascade cost against a matched cold final-rung solve, not only as fewer final iterations.","Exact idle-ancilla and nested-bond prolongations preserve the empirical objective; parameter-name copying between unrelated ansatzes does not.","Topology and site order can dominate bond escalation: the same eight Bell pairs drop maximum MPS bond from 256 to 2 under reordering.","A final Schmidt-rank ceiling cannot be overcome by any continuation path that ends in that ansatz family.","Acceptance certifies only the declared empirical-objective transfer; rejection does not imply quantum advantage or rule out another classical representation."],"fun_headline_variants":["Coarse flags transfer with fine suboptimality at most δc+2ε","Gram audits certify isometric warm starts for larger quantum models","Signed Gram operator bounds density mismatch without materializing states","Continuation needs audits of mismatch, inclusion, topology and work","δc+2ε bound holds for lifted spectral flags with no gap required"],"cache_read_input_tokens":128,"weakest_assumption_plain":"The audit is an efficient algorithm only when the complex fine–coarse cross overlaps and the declared structured contractions can actually be evaluated; fidelity-only data do not determine the Gram.","fun_headline_variants_meta":{"raw":{"variants":["Coarse flags transfer with fine suboptimality at most δc+2ε","Gram audits certify isometric warm starts for larger quantum models","Signed Gram operator bounds density mismatch without materializing states","Continuation needs audits of mismatch, inclusion, topology and work","δc+2ε bound holds for lifted spectral flags with no gap required"]},"model":"grok-4.5","effort":"low","cost_usd":0.005146,"raw_usage":{"total_tokens":1533,"prompt_tokens":917,"num_sources_used":0,"completion_tokens":71,"cost_in_usd_ticks":51460000,"prompt_tokens_details":{"text_tokens":917,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":545,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":917,"tokens_out":71,"duration_ms":4574,"temperature":1.0,"reasoning_tokens":545,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-14T12:19:32.410339+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"In a controlled encoder-change ladder where the complex cross overlaps are available, measure the fine suboptimality of the lifted coarse flag; if it systematically exceeds δc+2ε, or if a cascade whose audits all pass still fails to match a matched cold final-rung solve on total work and objective, the central transfer claim fails.","supporting_citations":[],"review_version":1}