{"id":"58b903c5-cdfa-4bf1-a20d-40209cb04903","arxiv_id":"2607.04669","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"Scale transformation restores RIP for compressed sensing of k-sparse multi-qubit Hamiltonians, enabling recovery from O(k log(4^N/k)) equations even for N≥3.","lead":"A scale-transformation fix restores the Restricted Isometry Property so compressed sensing can recover a k-sparse N-qubit Hamiltonian from only O(k log(4^N/k)) measurements. The method is demonstrated in simulations up to 30 qubits and could ease characterization of large quantum processors.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"Scale transformation restores the sufficient condition on κ but does not prove that the rescaled matrix actually satisfies RIP for the product-state ensembles used.","rationale":"The Reader correctly flags the a-priori sparsity assumption and the moment conditions of Proposition 1 as necessary. Those assumptions are stated clearly and the appendix proof that E(Φ†Φ) is diagonal is correct. The deeper load-bearing gap, however, is that restoring κ=1 only re-enables a known sufficient condition; it does not establish that the actual (correlated) measurement ensemble satisfies RIP. Because the paper never supplies a concentration argument or an empirical RIP check for the rescaled matrices, the strongest claim remains only partially supported. The existing numerical recovery plots are consistent with success but do not close the gap. A direct computation of empirical δ_k on the precise ensemble would settle the issue; until then the verdict stays CONDITIONAL with medium correctness risk, essentially unchanged from the Reader's assessment but for a more precise technical reason.","tokens_in":13053,"tokens_out":662,"duration_ms":5927,"concrete_test":"For N=4 and N=6, draw 200 independent realizations of the rescaled sensing matrix Φ̃ under the exact ensemble of Proposition 1 and Algorithm 1; for each realization compute the empirical restricted isometry constant δ_k for k=5,10,20 by maximizing |‖Φ̃v‖_2^{2}/‖v‖_2^{2}-1| over 10^4 random k-sparse unit vectors. If the median δ_k exceeds √2-1 for any of these (N,k) pairs, the theoretical recovery guarantee fails for the ensembles actually used.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim is that scale transformation restores RIP so that standard CS recovery applies for N≥3. Section III-A recalls that κ<√2+1 is only a sufficient condition for the concentration argument that yields RIP with high probability; the paper itself notes it is 'by far not clear how to restore RIP when this condition is violated.' After Λ-rescaling one obtains κ=1, which satisfies the inequality, yet no concentration bound, restricted-isometry constant, or recovery guarantee is re-derived for the concrete (non-i.i.d., row-correlated) ensemble of product states and single-Pauli observables. The numerical examples (Figs. 2–3) show empirical success for two particular sparse Hamiltonians, but they do not substitute for a proof that δ_k remains below √2-1 after rescaling. If the rescaled matrix fails RIP for some k-sparse supports that arise in multi-qubit systems, the O(k log(4^N/k)) claim does not hold.","agreement_with_reader":"partial"},"referee_report":{"model":"grok-4.5","summary":"The paper develops a compressed-sensing approach for estimating a k-sparse N-qubit Hamiltonian in the Pauli-tensor basis. Starting from a first-order Dyson expansion of short-time expectation values, the authors obtain a linear system y = Φh whose sensing matrix is assembled from random product pure states and single-qubit Pauli observables. They observe that the condition number κ of E(Φ†Φ) grows with N and exceeds the sufficient threshold √2+1 already for N≥3, so that the usual concentration argument for the Restricted Isometry Property fails. Under moment conditions that make E(Φ†Φ) diagonal (Proposition 1, proved in the appendix), a diagonal scale transformation Λ restores κ=1 while preserving sparsity; standard ℓ1 recovery is then applied to the rescaled system. An optional second-order correction reduces the truncation error of the Dyson series. Numerical illustrations for a 6-qubit open time-dependent Hamiltonian (sparsity 26, 80 equations) and a 30-qubit closed Hamiltonian (sparsity 100, 700 equations) show that the relative ℓ1 error decreases with the number of measurement shots.","tokens_in":13334,"tokens_out":1154,"duration_ms":8906,"significance":"If the recovery guarantee holds after rescaling, the method reduces the number of distinct experiments from Ω(4^N) to O(k log(4^N/k)), which is practically relevant for multi-qubit devices whose Hamiltonians are known a priori to be sparse. The scale transformation is elementary, the moment conditions of Proposition 1 are natural for product-state ensembles, and the numerical examples reach N=30—well beyond previous CS Hamiltonian-estimation demonstrations. The paper also sketches a concrete application (Hamiltonian-aware dynamical decoupling for state preservation). These contributions are of clear interest to quantum characterization and control, provided the theoretical gap identified below is closed or clearly delimited.","major_comments":[{"comment":"Section III-A (after Eq. (17)) and III-B: the paper correctly notes that κ<√2+1 is only a sufficient condition for the concentration argument that yields RIP, and that it is 'by far not clear how to restore RIP when this condition is violated.' After the scale transformation one obtains κ=1 by construction, yet no new concentration bound, restricted-isometry constant, or recovery probability is derived for the concrete non-i.i.d., row-correlated ensemble of product states and single-Pauli observables. The O(k log(4^N/k)) claim therefore rests on an unverified transfer of the standard Candès argument. Either a rigorous RIP (or null-space) guarantee for the rescaled matrix should be supplied, or the claim should be weakened to an empirical observation supported by the numerics.","section":null},{"comment":"Section III-A and Algorithm 1: the recovery guarantee (Eq. (16)) and the algorithm both assume that the Hamiltonian is known a priori to be exactly k-sparse (or well-approximated by a k-sparse vector) in the Pauli basis. The paper states this assumption but does not discuss how k is chosen in practice, nor how the method degrades when the true support is denser or when weak multi-body terms are amplified by Λ^{-1} (as acknowledged in the error analysis of III-D). A brief sensitivity study or a clear statement of the failure mode would strengthen the central claim.","section":null}],"minor_comments":[{"comment":"Figure 1 caption and surrounding text: the two ensembles are described, but the precise sampling of the observables (uniform single-qubit Paulis) is stated only later; a short reminder in the caption would improve readability.","section":null},{"comment":"Equation (9) and the definition of φ_ij: the factor it multiplies every entry; after the scale transformation the same factor appears in both Φ and the data, so it cancels, but this is never stated explicitly and may confuse readers implementing Algorithm 1.","section":null},{"comment":"Section IV: the 6-qubit Hamiltonian is time-dependent and open, while the theory is developed for time-independent closed systems. A sentence clarifying that the numerics deliberately stress the method beyond its formal setting would be helpful.","section":null},{"comment":"Typographical: 'diagnal' in the appendix proof of Proposition 1; 'Schr ¨odinger' spacing; occasional missing spaces after commas in multi-line equations.","section":null}],"recommendation":"major_revision","confidential_remarks":"The core technical idea (diagonal rescaling to force κ=1) is simple and useful, but the manuscript currently overstates the theoretical guarantee. If the authors can either prove RIP for the rescaled ensemble or clearly relegate the recovery claim to an empirical status, the paper would be a solid contribution for a specialized quantum-control or quantum-information journal. Novelty relative to Shabani et al. (2011) is incremental but real; the scalability diagnosis and the N=30 demonstration are the main advances."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The new piece is not CS for Hamiltonians (Shabani et al. already did that). It is the concrete diagnosis that the usual product-state/Pauli ensembles make the condition number of E(Φ†Φ) grow past √2+1 once N≥3, so the standard sufficient condition for RIP fails, plus the elementary diagonal rescaling Λ that forces κ=1 by construction and restores the usual Candès recovery path. That is useful and cleanly done.\n\nProposition 1 is proved correctly under the stated moment conditions; once E(Φ†Φ) is diagonal the scale transform is just algebra and the sparsity of x=Λh is identical to that of h. The second-order correction for the Dyson remainder is optional but sensible, and the N=6 (open, noisy) and N=30 (closed, 100-sparse) simulations behave as advertised: error drops with shots and the correction helps once model error dominates. Citations are appropriate; no circularity.\n\nSoft spots are real but ordinary for a methods paper. The paper itself notes that κ<√2+1 is only sufficient, and after rescaling they do not re-prove concentration or bound δ_k for the concrete row-correlated ensemble. The O(k log(4^N/k)) claim therefore rests on the standard argument plus the restored κ, not a fresh RIP proof. Numerics for two particular sparse instances do not close that gap, but they also do not contradict it. The a-priori exact k-sparsity assumption is strong and stated as such; free parameters (k, t, ε) are the usual ones. No code is shipped.\n\nThis is for people who actually characterize or control multi-qubit devices and already think in Pauli frames. It deserves a serious referee. I would cite the scale-transform trick if I hit the same ill-conditioning, and I would bring it to reading group.","headline":"Solid, usable fix for a real RIP obstruction in multi-qubit CS Hamiltonian estimation; the math is elementary but the diagnosis and numerics up to N=30 make it worth reading.","tokens_in":13890,"tokens_out":480,"would_cite":true,"duration_ms":4618,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"A scale transformation restores compressed sensing so sparse multi-qubit Hamiltonians can be recovered from far fewer measurements than the full 4^N parameter count.","keywords":["Hamiltonian estimation","compressed sensing","Restricted Isometry Property","scale transformation","multi-qubit systems","sparse Pauli expansion","quantum process tomography"],"falsifier":"Generate random product states and local Pauli observables for N greater than or equal to 3, form the sensing matrix, apply the scale transformation, and check whether the condition number of the expected Gram matrix remains near 1 and whether basis-pursuit recovers a planted k-sparse Hamiltonian to the accuracy predicted by the RIP theorem; if either fails systematically, the central claim is false.","tokens_in":13938,"feed_emoji":"⚛️","tokens_out":928,"duration_ms":8056,"temperature":0.7,"pith_summary":"Estimating an N-qubit Hamiltonian normally requires an exponential number of experiments because the operator has 4^N-1 free parameters. When the Hamiltonian is known to be sparse in the Pauli tensor basis, compressed sensing could in principle cut that cost to roughly O(k log(4^N/k)). The paper shows that the usual random product-state and Pauli measurements stop satisfying a standard sufficient condition for recovery (the Restricted Isometry Property) once N reaches three or more. The authors introduce a simple diagonal rescaling of the sensing matrix that restores the condition number to one, recovers the RIP guarantee, and thereby makes the compressed-sensing recovery theorem applicable again. They also supply a second-order correction that reduces the truncation error of the short-time Dyson expansion. Numerical tests on 6-qubit open systems and 30-qubit closed systems confirm that the rescaled estimator recovers sparse Hamiltonians with a few hundred equations instead of thousands.","feed_headline":"Scale fix lets sparse Hamiltonians be recovered with far fewer shots","feed_subtitle":"A diagonal rescaling restores the RIP for N-qubit systems, cutting experiments from 4^N to O(k log(4^N/k))","key_machinery":"Scale transformation: given the sensing matrix Phi, form the diagonal matrix Lambda whose entries are the square roots of the diagonal of E(Phi dagger Phi), replace Phi by Phi Lambda inverse and the unknown vector h by Lambda h, then run ordinary ell-1 recovery on the rescaled problem.","core_discovery":"For random product initial states and local Pauli observables that make the expected Gram matrix of the sensing matrix diagonal, a diagonal scale transformation Lambda equal to the square-root of those diagonal entries produces an equivalent sensing matrix whose condition number is exactly one. Consequently the Restricted Isometry Property holds with high probability and a k-sparse N-qubit Hamiltonian can be recovered by basis-pursuit from only O(k log(4^N/k)) short-time expectation values.","pith_inferences":["If the method survives experimental noise on superconducting or trapped-ion platforms, it could become a routine calibration step for devices whose interaction graphs are known to be sparse.","The same rescaling may restore RIP for compressed sensing of sparse Lindblad generators or sparse process matrices, extending the technique beyond closed systems.","Failure of the zero-moment conditions (for example with highly mixed or correlated states) would force a different preconditioner, suggesting a natural next theoretical target."],"forward_implications":["Sparse multi-qubit Hamiltonians with N up to 30 can be estimated from a few hundred short-time expectation values rather than thousands of full-process measurements.","Once the Hamiltonian is recovered, specialized dynamical-decoupling sequences that cancel the estimated terms can be designed, outperforming generic sequences that ignore the structure.","The same scale-transformation idea can be applied to other quantum estimation tasks whose sensing matrices become ill-conditioned with system size.","Second-order Dyson correction keeps the approximation error from dominating even when the evolution time cannot be made arbitrarily small."],"fun_headline_variants":["Diagonal scaling restores RIP for sparse multi-qubit Hamiltonian recovery","Scale transform enables few-equation estimation of k-sparse Hamiltonians","Compressed sensing recovers sparse N-qubit Hamiltonians after rescaling","Scale fix cuts shots to O(k log(4^N/k)) for multi-qubit Hamiltonians","Restored RIP lets basis pursuit estimate sparse multi-qubit Hamiltonians"],"cache_read_input_tokens":128,"weakest_assumption_plain":"The Hamiltonian must be known in advance to be exactly k-sparse (or very nearly so) in the Pauli-tensor basis, and the random product states must satisfy the zero-moment conditions that make the expected Gram matrix diagonal.","fun_headline_variants_meta":{"raw":{"variants":["Diagonal scaling restores RIP for sparse multi-qubit Hamiltonian recovery","Scale transform enables few-equation estimation of k-sparse Hamiltonians","Compressed sensing recovers sparse N-qubit Hamiltonians after rescaling","Scale fix cuts shots to O(k log(4^N/k)) for multi-qubit Hamiltonians","Restored RIP lets basis pursuit estimate sparse multi-qubit Hamiltonians"]},"model":"grok-4.5","effort":"low","cost_usd":0.004252,"raw_usage":{"total_tokens":1268,"prompt_tokens":743,"num_sources_used":0,"completion_tokens":99,"cost_in_usd_ticks":42520000,"prompt_tokens_details":{"text_tokens":743,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":426,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":743,"tokens_out":99,"duration_ms":3424,"temperature":1.0,"reasoning_tokens":426,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-11T15:28:43.277038+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Generate random product states and local Pauli observables for N greater than or equal to 3, form the sensing matrix, apply the scale transformation, and check whether the condition number of the expected Gram matrix remains near 1 and whether basis-pursuit recovers a planted k-sparse Hamiltonian to the accuracy predicted by the RIP theorem; if either fails systematically, the central claim is false.","supporting_citations":[],"review_version":1}