{"id":"c2b7c8c2-79d8-4c3c-a10b-1ce839243737","arxiv_id":"2607.08166","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.5,"correctness_risk":"low","formal_verification":"none","parameter_count":4,"one_line_summary":"Analytical Pauli-string coefficients plus multistage state refinement let tensor networks find low eigenstates of million-dimensional Laplacians with high fidelity on 20 qubits.","lead":"The paper gives a closed-form way to get Pauli coefficients of sparse differential operators and a coarse-to-fine start for imaginary-time evolution, so large Sturm–Liouville operators can be handled as compact matrix product operators. It is useful for anyone who wants classical tensor-network PDE eigensolvers without building the full matrix.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified beyond the paper's own stated scope limits.","rationale":"The paper's central technical contribution (binary-encoded closed-form Pauli matrix elements + multistage ITE initializer) is fully inspectable from Theorems 1–2, Props. 4–7, Alg. 1 and the numerical tables/figures. The smoothness assumption is load-bearing for the speedup claim but is correctly scoped and falsified by the authors themselves for disordered potentials; it does not invalidate the algorithmic claims inside the stated regime. The reader's CONDITIONAL verdict (accept technical claims, require code or fuller parameter study for definitive wall-clock numbers) already captures the only residual practical gap. No stronger internal concern lands, so the verdict remains unchanged.","tokens_in":22829,"tokens_out":416,"duration_ms":5058,"concrete_test":"Independently recompute the Pauli coefficients for the n=10 Laplacian via Eq. (3) (or Alg. 1) and compare against a dense-matrix reference (e.g., Qiskit Pauli decomposition); if coefficients match to machine precision and the subsequent multistage ITE recovers the first 8 analytical eigenstates with F≥0.99, the central construction is verified.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reader's weakest assumption (smoothness of low-lying modes for multistage refinement) is already the paper's own explicit limitation, demonstrated in §III.C for strong random potentials and stated in §II.E and the abstract. The strongest claim is algorithmic and scoped to sparse structured operators (tridiagonal Sturm–Liouville) whose low modes are smooth; Theorems 1–2 and Props. 1–7 give closed-form Pauli coefficients reducing memory to O(2n), and Figs. 3–4 plus Tables I–II show the claimed fidelities and Trotter-step reduction on the Laplacian. No internal inconsistency or unacknowledged failure mode is present that would undermine the scoped claim.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper develops two techniques to improve tensor-network (TN) solvers for Sturm–Liouville problems arising from PDEs. First, it derives closed-form expressions (Theorems 1–2, Eq. (2)) for the matrix elements of arbitrary n-qubit Pauli strings via binary structure number α and value number β; this yields Pauli coefficients (Eq. (3)) by a direct sum, reducing memory from O(2^{n+1}) (explicit Pauli matrices) to O(2n) and enabling efficient MPO construction for sparse structured operators such as tridiagonal discretizations (Props. 4–7, specialized sums in Appendix C). Second, it introduces a multistage state-refinement heuristic (linear interpolation map Û : H_n → H_{n+n′}, Eq. (11)) that seeds fine-grid imaginary-time evolution (ITE) from coarse-grid eigenstates, cutting the number of Trotter steps by up to two orders of magnitude. The framework is demonstrated on the Dirichlet Laplacian (first 32 eigenstates of dimension >10^6 at fidelity ≥0.95 with a 20-qubit MPO), the separable 2-D anharmonic oscillator (fidelity >0.99 vs exact diagonalization), and 1-D systems with quadratic/quartic/random potentials (accuracy degrades with disorder strength).","tokens_in":23031,"tokens_out":1217,"duration_ms":29900,"significance":"If the claims hold, the work supplies two reusable algorithmic primitives of independent interest: an analytical Pauli-string matrix-element formula that removes a memory bottleneck for any n-qubit operator (not only differential ones), and a simple coarse-to-fine MPS refinement that accelerates ITE for smooth low-lying modes. The induction proofs (Theorems 1–2, Props. 1–7) are machine-checkable in principle, the numerical benchmarks are external (closed-form Laplacian eigenfunctions, exact diagonalization), and the paper itself maps the failure mode (strong random potentials increase entanglement, rendering low-χ MPOs inaccurate). These contributions are useful both for classical TN PDE solvers and as classical simulators/preconditioners for quantum algorithms that rely on Pauli decompositions or imaginary-time evolution.","major_comments":[{"comment":"§II.B–C and abstract: The memory claim “O(2^{n+1}) → O(2n)” is correct for the evaluation of each Pauli coefficient once the operator matrix elements are known analytically, but for a completely general dense operator the sum in Eq. (3) still requires O(2^n) storage of those elements. The paper should state more sharply that the O(2n) figure applies only when the operator itself admits an O(n)- or O(poly(n))-space description (as the tridiagonal SL operators do via the functions a_i, b_i, c_i). Without that qualification the abstract overstates the generality.","section":"§II.B, Eq. (3) and abstract"},{"comment":"§II.E and Fig. 4: The multistage map Û is asserted to be representable as an MPO so that the whole pipeline stays inside the TN framework for large n. No explicit MPO construction, bond-dimension bound, or numerical verification of the MPO–MPS contraction cost is supplied. For the system sizes shown classical interpolation is used; a short appendix giving the MPO tensors of Û (or a reference to a standard linear-interpolation MPO) would make the scalability claim fully rigorous.","section":"§II.E, Eq. (11)"}],"minor_comments":[{"comment":"Fig. 2 caption and main text: the comparison libraries “qiskit” and “pauli_lcu” are cited only by name; full package versions and the precise API calls used would improve reproducibility.","section":"Fig. 2"},{"comment":"Table I vs Table II: wall-clock times are reported on the same hardware, yet the two tables measure different stages (Pauli expansion alone vs full MPO+Trotter). A single combined timing table for the end-to-end pipeline would clarify the relative cost of each component.","section":"Tables I–II"},{"comment":"§III.D and Fig. 9: truncation-error analysis is performed only up to n=10 because of the exponential growth of Pauli strings. A brief remark on how the observed error scales (or an extrapolation) would help readers judge reliability at the n=20 regime used for the main Laplacian results.","section":"§III.D"},{"comment":"Notation: the same symbol χ is used both for bond dimension and (in places) for the diffusion constant; a distinct symbol for the latter would avoid momentary confusion.","section":"§III.A"},{"comment":"Appendix C pseudocode: the functions C0/C1/C2 return un-normalized sums; the final division by 2^n and the phase factor appear only in the outer procedure. Adding a one-line comment that the returned values must still be scaled would prevent implementation errors.","section":"Appendix C"}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is a solid, self-contained contribution that fits quant-ph well. The two primitives are genuinely useful and the limitations are honestly stated. I see no citation or novelty issues. Minor revision is sufficient; the two major points are clarifications rather than conceptual flaws."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The two things worth knowing: they give an analytical formula for every matrix element of an n-qubit Pauli string from two binary numbers (structure α and value β), so Pauli coefficients for any matrix with known entries cost O(2n) memory instead of building sparse Pauli matrices; and they show that linear interpolation of coarse-grid MPS eigenstates into a finer grid cuts the Trotter steps needed for imaginary-time evolution by up to two orders of magnitude on smooth modes.\n\nWhat is new is Theorems 1–2 and the resulting coefficient formula (Eq. 2–3), plus the specialization to tridiagonal Sturm–Liouville operators (Props. 4–7) that drops the non-zero Pauli count to (n+1)2^n or better. That is not in the Koska / Arseniev / Georges Pauli-decomposition papers they cite. The multistage map Û is a clean linear-interpolation operator written as an MPO so it stays inside the TN framework. Numerics are honest: first 32 Laplacian eigenstates on >10^6 dimensions at fidelity ≥0.95 with 20 qubits (Fig. 3), clear Trotter-step reduction versus single-stage (Fig. 4), anharmonic oscillator matching exact diagonalization to 10^{-4} relative energy error, and an explicit failure mode for strong random potentials where entanglement kills the bond-dimension truncation.\n\nSoft spots are minor and already owned by the authors. The multistage speedup assumes low-lying modes are smooth; they demonstrate the breakdown themselves in §III.C. No public code, free parameters (χ, Δt, refinement schedule) are stated but not exhaustively scanned, and wall-clock tables are single-machine. None of that undercuts the scoped algorithmic claim.\n\nThis is for people who build TN or quantum-inspired PDE solvers and need practical primitives for sparse structured operators. Math is proved by induction, baselines are external, citations are appropriate. I would send it to referees; a serious editor should not desk-reject it. Worth engaging if you work in this niche.","headline":"Solid methods paper: closed-form Pauli matrix elements via binary encoding plus a multistage ITE initializer that actually cuts Trotter steps on smooth Sturm–Liouville modes.","tokens_in":23693,"tokens_out":514,"would_cite":true,"duration_ms":6646,"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":"An analytical Pauli formula and multistage refinement let tensor networks find the first 32 eigenstates of a million-by-million Laplacian on 20 qubits with fidelity above 0.95.","keywords":["tensor networks","matrix product operators","Pauli decomposition","imaginary time evolution","Sturm–Liouville","multistage refinement","differential operators"],"falsifier":"Run the same 20-qubit pipeline on a Laplacian plus a random potential whose strength is large enough that the ground-state fidelity falls below 0.95 (or the relative energy error exceeds the paper’s 10^{-4} threshold) while keeping bond dimension fixed; if the multistage refinement still converges in far fewer Trotter steps than direct evolution, the smoothness premise is false.","tokens_in":23721,"feed_emoji":"🧮","tokens_out":758,"duration_ms":7803,"temperature":0.7,"pith_summary":"Discretizing a differential equation on a fine grid produces huge matrices whose eigenvalues and eigenfunctions are expensive to obtain by classical linear algebra. For Sturm–Liouville operators the authors show that those matrices can be written as matrix product operators on only n = log2(N) qubits, provided two bottlenecks are removed. First they derive a closed-form expression for every Pauli-string coefficient that uses only the binary structure and value numbers of the string, cutting memory from exponential in n to linear. Second they evolve the system first on a coarse grid, linearly interpolate the resulting low-lying states onto a finer grid, and finish the imaginary-time evolution there; because those states are smooth, the interpolation starts the fine-grid calculation near the target and cuts the number of Trotter steps by up to two orders of magnitude. The combined pipeline recovers the first 32 eigenstates of a Laplacian larger than 10^6 with fidelity greater than 0.95, works for a two-dimensional anharmonic oscillator, and fails gracefully only when disorder becomes strong enough to destroy smoothness.","feed_headline":"20 qubits recover 32 eigenstates of a million-point Laplacian","feed_subtitle":"Analytic Pauli formula plus coarse-to-fine refinement cuts Trotter steps by two orders of magnitude","key_machinery":"The Structure and Value Theorems: every Pauli string’s sole nonzero entry in row j sits at column α ⊕ j and equals (−i)^K(α∧β) (−1)^Π(β∧j), where α and β are the binary structure and value numbers of the string. This identity turns the Pauli decomposition of any matrix with known entries into a direct sum of length 2^n, and for tridiagonal operators collapses further to (n+1)2^n or fewer terms.","core_discovery":"For sparse, structured differential operators that become tridiagonal after discretization, an analytic formula for Pauli-string matrix elements (built from two n-bit binary numbers that encode column location and phase) yields every expansion coefficient with O(2n) memory; the resulting compact MPO, together with a coarse-to-fine state-refinement map, makes imaginary-time evolution converge fast enough to extract dozens of accurate low-lying eigenpairs on grids that exceed a million points.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Analytic Pauli formula builds O(n)-memory MPO for million-point Laplacians","Multistage refinement cuts ITE Trotter steps 100x on 20-qubit MPO solvers","Pauli coeffs plus coarse-to-fine map extract 32 modes past 10^6 grid points","Sparse structured operators yield compact MPOs for Sturm-Liouville eigenpairs","20-qubit Pauli MPO recovers 32 accurate eigenstates of Laplacian >1M"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The low-lying eigenfunctions must be smooth enough that linear interpolation of a coarse-grid solution already lies close to the true fine-grid solution; otherwise the multistage speedup and the reported fidelities disappear.","fun_headline_variants_meta":{"raw":{"variants":["Analytic Pauli formula builds O(n)-memory MPO for million-point Laplacians","Multistage refinement cuts ITE Trotter steps 100x on 20-qubit MPO solvers","Pauli coeffs plus coarse-to-fine map extract 32 modes past 10^6 grid points","Sparse structured operators yield compact MPOs for Sturm-Liouville eigenpairs","20-qubit Pauli MPO recovers 32 accurate eigenstates of Laplacian >1M"]},"model":"grok-4.5","effort":"low","cost_usd":0.006192,"raw_usage":{"total_tokens":1678,"prompt_tokens":873,"num_sources_used":0,"completion_tokens":101,"cost_in_usd_ticks":61920000,"prompt_tokens_details":{"text_tokens":873,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":704,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":873,"tokens_out":101,"duration_ms":7533,"temperature":1.0,"reasoning_tokens":704,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T12:00:37.263379+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Run the same 20-qubit pipeline on a Laplacian plus a random potential whose strength is large enough that the ground-state fidelity falls below 0.95 (or the relative energy error exceeds the paper’s 10^{-4} threshold) while keeping bond dimension fixed; if the multistage refinement still converges in far fewer Trotter steps than direct evolution, the smoothness premise is false.","supporting_citations":[],"review_version":1}