{"id":"6be58a08-6853-4675-92ea-9af7a9bc30c5","arxiv_id":"2508.17606","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"Nonlinear equilibrium problems can be solved on quantum computers by simulating a gradient-flow ODE linearized by Carleman or Pivot Switching Carleman methods.","lead":"This paper turns nonlinear equilibrium equations into a linear dynamical system using gradient flow and Carleman linearization, so quantum computers can simulate them. The method is tested on small spring and truss models, with claimed memory savings and system-size-independent query counts.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"N-independent complexity in Eq. (23) omits both the convergence time T and a truncation-error bound; the paper's own examples show Carleman truncation can diverge or miss equilibrium.","rationale":"Reader's conditional verdict is sound; my concern refines it. The weakest point is not any single equation in Appendix A (the gradient-flow convergence proof is correct) but the absence of any approximation theorem for the truncated linear dynamics over the finite horizon T. The query bound (Eq. 23) is a simulation cost for a fixed linear ODE, not a cost for solving f(u)=0. Since T is chosen ad hoc (T=1) and P is fixed to 5, the reported 'good agreement' is anecdotal. The paper itself flags the T issue in §III.B, and the Carleman divergence in Fig. 2(d) demonstrates that truncation can change even the qualitative behavior (stable equilibrium vs. divergence). PSC helps in one example but is imported from a self-cited preprint with no error analysis, and its success depends on a pivot chosen without prior knowledge. Therefore the claim 'quantum acceleration ... independent of system size' is premature; it could become true if a theorem bounding ||y1(T)−u*|| in terms of P, T, and the modulus of U is supplied. The proposed test would immediately reveal whether such a bound is plausible: if finite-P error does not shrink with P or T_ε grows steeply, the central claim is not supported. I keep the reader's CONDITIONAL verdict rather than moving to REJECT because the underlying gradient-flow idea is valid and the failures are concrete, identifiable, and potentially fixable by adding a rigorous convergence/truncation analysis.","tokens_in":14002,"tokens_out":7293,"duration_ms":78142,"concrete_test":"Re-run the single-spring and truss experiments with the following protocol: for each parameter set (b or F), first integrate the exact gradient flow (untruncated, high-accuracy classical ODE) and define T_ε = inf{t ≥ 0 : ||f(u(t))|| ≤ ε} with ε=1e-6. Then simulate the Carleman and PSC-truncated linear systems for that same T_ε at P=5, 10, 20, 40 and report ||y1(T_ε) − u*||_2 as a function of (P, b, F). The central claim requires this error to tend to 0 as P increases for every tested b/F, and requires T_ε to be small enough that O(P^{3/2}(...)T_ε) remains competitive; if either fails, the complexity claim omits a parameter-dependent cost.","verdict_should_be":"UNCHANGED","load_bearing_attack":"For the central claim to hold, the two approximations introduced by the algorithm must be controlled: (i) the finite truncation order P of Carleman/PSC and (ii) the finite evolution time T at which y1(T) is read as the equilibrium displacement. The paper provides no error bound for either. Eq. (23) reports O(P^{3/2}(||b||+k+a)t + ln(1/ε)), treating t as an input; but t is actually the time needed for du/dt=-f(u) to approach u*, and this time is never analyzed. All examples use T=1 ('sufficiently large'), and §III.B explicitly states 'further investigation is required to estimate preferred length of time evolution t.' For U satisfying only the stated assumptions (coercive, locally Lipschitz), convergence can be arbitrarily slow; for U(u)=u^4, T=O(ε^{-2}). Moreover, truncation is not a benign approximation: the Carleman truncation for the single spring (k=10, a=3000) diverges for b≥1.2 (Fig. 2d), even though the true gradient flow converges, and the truss result at F=0.9 visibly underestimates the exact displacement (Fig. 4e). Thus the advertised 'truncated linearized dynamics accurately reproduce nonlinear equilibrium states' is not just unproven; it is false for the Carleman variant in the paper's own parameter regimes. The PSC variant repairs the numerics for the single spring, but only for the chosen pivot s=0.01 and with no supporting derivation in this paper. The load-bearing gap is therefore the missing joint control of (P,T): without it, the N-independent query count does not describe the cost of solving the nonlinear problem.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a quantum algorithm for solving nonlinear equilibrium equations of the form f(u)=∇U(u)=0 by first converting the problem into the gradient-flow dynamics du/dt=-f(u), then applying Carleman or Pivot Switching Carleman (PSC) linearization to obtain an infinite-dimensional linear system, truncating it, and simulating the result with a quantum linear-dynamics solver. The method is demonstrated on a single nonlinear spring, a one-dimensional chain of springs, and a two-dimensional truss, with numerical results compared against exact solutions. The central advertised claim is that truncated linearized dynamics accurately reproduce the equilibrium states and that the query complexity, Eq. (23), is O(P^{3/2}(‖b‖+k+a)t + ln(1/ε)), independent of the system size N. The paper also gives a complexity analysis based on the spectral norm of the linearized matrix and a convergence proof for the gradient flow in Appendix A.","tokens_in":14311,"tokens_out":5867,"duration_ms":64567,"significance":"If the advertised claims could be made rigorous, the paper would contribute a simple and potentially useful connection between variational equilibrium problems and quantum linear-dynamics simulation, with asymptotic memory savings in N. The paper is also honest in places: the authors explicitly call for further investigation of the evolution time t (§III.B) and acknowledge that Carleman linearization diverges in some regimes (§III.A). The numerical benchmarks are validated against externally computed exact solutions, not against the algorithm's own output, and no fitted parameters are used to force agreement. However, the central claims—that truncated linearized dynamics 'accurately reproduce' the equilibrium and that the complexity is N-independent—are not backed by any truncation-error or convergence-time bound. The paper's own Fig. 2(d) shows Carleman truncation diverging for b≥1.2, contradicting the general accuracy claim. Because the missing pieces are precisely the ones needed to convert a heuristic numerical scheme into a quantum algorithm with a stated complexity, the current version does not establish the main advertised result.","major_comments":[{"comment":"The paper states that truncated linearized dynamics 'accurately reproduce nonlinear equilibrium states,' but Fig. 2(d) shows that the Carleman-truncated system diverges for b≥1.2, while the true gradient flow converges. The authors attribute this to positive eigenvalues of the system matrix in Eq. (10) and note that the divergence persists for larger truncation order P. This directly contradicts the general claim in the abstract and conclusion that the truncated dynamics successfully capture the nonlinear equilibrium. The PSC variant repairs the numerics only for the chosen pivot s=0.01, and no error bound is provided for PSC either.","section":"§III.A, Eq. (10) and Fig. 2(d)"},{"comment":"The query-complexity estimate O(P^{3/2}(||b||+k+a)t + ln(1/ε)) treats t as an input parameter, but t is actually the time required for the gradient flow (3) to approach the equilibrium state. The paper itself notes, just after Eq. (23), that 'further investigation is required to estimate preferred length of time evolution t.' Under the stated assumptions (coercive, locally Lipschitz U), convergence can be arbitrarily slow; for example, for U(u)=u^4 one has u'~-u^3, giving ||u(t)||~t^{-1/2} and hence t=O(ε^{-2}) for error ε. Without a bound on T in terms of the problem data, the claimed N-independent complexity is not established, and the numerical choice T=1 in all examples is not justified.","section":"§III.B, Eq. (23)"},{"comment":"Eq. (23) is justified by citing Hamiltonian-simulation results, specifically Low and Chuang's qubitization (refs [47,48]), which apply to unitary (Hermitian) evolution. The linearized Carleman matrix A in Eq. (22) is not Hermitian or necessarily normal. Simulating non-unitary linear dynamics with QLSA or with dilation-based Hamiltonian simulation incurs additional costs related to the condition number, the non-normality, or the norm of the dilated operator. The paper does not provide the end-to-end query complexity for the actual non-unitary simulation, so Eq. (23) as stated is not a demonstrated complexity bound for the proposed algorithm.","section":"§III.B, references [47,48]"},{"comment":"The PSC linearization is the method that actually works in the paper's examples, but it is not derived or analyzed here; it is only cited to the authors' prior preprint [41]. The matrix in Eq. (11) is given without explanation of how the pivot state s enters the truncation, and the paper states that s=0.01 is chosen without a priori analysis. There is no proof that choosing a small positive s yields an accurate or stable approximation for general problems. Since the central numerical success of the paper rests on this imported construction, a self-contained derivation or a clear statement of its conditions of validity is needed.","section":"§III.A, Eq. (11)"}],"minor_comments":[{"comment":"The equation as printed reads du_i/dt = -k[(ui-u_{i-1})+(ui-u_{i-1})] - a[(ui-u_{i-1})^3+(ui-u_{i-1})^3] + b_i, with the index i-1 repeated in both terms. This is presumably a typo for terms involving u_{i+1} and u_{i-1}, as in Appendix B, Eq. (B3). Please correct.","section":"§III.B, Eq. (13)"},{"comment":"The matrix entries such as '4as6' and '−175as6' are notationally ambiguous; they should be typeset as 4a s^6, -175a s^6, etc. The same applies to other entries in the PSC matrix.","section":"§III.A, Eq. (11)"},{"comment":"The proof claims that finiteness of ∫_0^∞ ||∇U||^2 dt implies lim_{t→∞} ||∇U|| = 0. This is not true for a general integrable function. The desired conclusion can be obtained by a standard LaSalle invariance argument using the boundedness of the trajectory, but the written proof is incomplete.","section":"Appendix A"},{"comment":"The text defines l2 = x^2 + y^2, but Eq. (27) uses l2 as if it denotes u^2 + v^2 (the squared displacement difference). Please clarify the definition to avoid confusing the reader.","section":"Appendix D"},{"comment":"The abbreviation 'HS' is used in Fig. 1 but is not defined at that point in the text; please introduce it explicitly (Hamiltonian simulation) before first use in the caption or the text.","section":"Fig. 1 and §II.B"}],"recommendation":"major_revision","confidential_remarks":"The paper leans heavily on the PSC method from the authors' prior preprint [41] without deriving or proving it here. If the current manuscript is intended as a standalone contribution, the reliance on an unpublished/non-peer-reviewed construction should be addressed, either by including the derivation or by clearly framing the paper as a numerical demonstration of an existing linearization technique. The central complexity claim needs a rigorous treatment of truncation error and convergence time before the paper can be accepted in a quantum-computation venue."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This paper has a genuinely new trick—mapping nonlinear equilibrium equations to gradient flow, then Carleman/PSC linearization—but the advertised accuracy is not supported by its own numerics. Worth a serious referee, but not in current form.\n\nThe gradient-flow reformulation is clean and correct: under the stated coercive, locally Lipschitz assumptions, U decreases along du/dt=-f(u), so f(u*)=0 at t→∞. Appendix A proves this. The single-spring PSC results are convincing, the chain example works, and the polynomial truss approximation is derived carefully. The complexity bound O(P^{3/2}(||b||+k+a)t + ln(1/ε)) is clearly stated, and the N-dependence is genuinely absent from the query count. Those are real strengths.\n\nThe paper's own examples, though, contradict the abstract's claim that \"truncated linearized dynamics accurately reproduce nonlinear equilibrium states.\" Carleman diverges for the single spring at b≥1.2 (Fig. 2d), and the truss displacement at F=0.9 is visibly underestimated (Fig. 4e). The body admits both, but the abstract and conclusion do not. That overclaim is the first problem.\n\nThe bigger gap is the missing joint control of truncation order P and simulation time T. The query complexity treats t as a free parameter, but t is the gradient-flow convergence time, never analyzed here. All examples set T=1 without justification. For a quartic potential, convergence scales like t∼ε^{-2}; for flatter potentials it can be slower. So the N-independent query count does not yet describe the cost of solving the nonlinear problem. Also, PSC is imported from a self-cited preprint with no derivation in this paper, and the pivot s=0.01 is chosen ad hoc.\n\nThese are addressable, but they are load-bearing for the central claim. A serious referee would want error bounds for truncation, a convergence-time estimate, and a fair comparison with classical nonlinear solvers. The citation pattern is fine, and the self-citation is legitimate.\n\nFor who: quantum algorithm researchers and curious computational mechanics folks. The idea is worth publishing in a suitably qualified form, after major revision. I'd send it to peer review, not desk reject. I wouldn't rely on its current claims in my own work, but I'd keep it on the radar.","headline":"Genuinely new gradient-flow linearization trick for nonlinear equilibrium, but the paper's accuracy claims are contradicted by its own numerics and the missing error analysis leaves the advantage unproven.","tokens_in":14871,"tokens_out":4382,"would_cite":true,"duration_ms":46879,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Recasting $f(u)=\\nabla U(u)=0$ as a gradient flow lets this paper solve nonlinear equilibria on a quantum computer via Carleman or pivot-switching linearization, with query cost independent of system size.","keywords":["nonlinear equilibrium equations","variational principle","gradient flow","Carleman linearization","Pivot Switching Carleman","quantum linear dynamical simulation","nonlinear elasticity","fault-tolerant quantum computing"],"falsifier":"For a chain of $N$ nonlinear springs with increasing nonlinearity, measure the smallest truncation order $P$ that keeps the truncated Carleman or PSC solution within a fixed tolerance of the exact equilibrium, and the time $T$ needed to get there; if either $P$ or $T$ grows with $N$, the claimed system-size independence collapses. Concretely, plot $T(\\epsilon,N)=\\min\\{t:\\|u(t)-u^*\\|<\\epsilon\\}$ for $N=8,16,32,\\dots$ and check whether $T$ remains bounded.","tokens_in":13744,"feed_emoji":"⚛️","tokens_out":13221,"duration_ms":123201,"temperature":0.7,"pith_summary":"The paper is trying to establish that a broad class of nonlinear equilibrium problems of the form $f(u)=\\nabla U(u)=0$ can be handed to a fault-tolerant quantum computer, provided the potential $U$ grows at infinity and has a locally Lipschitz gradient. The key step is to view the static equation as the long-time limit of the gradient flow $du/dt=-f(u)$, whose energy decreases monotonically, and then to linearize that flow exactly with Carleman or Pivot Switching Carleman (PSC) expansion before truncating it for simulation by quantum linear-dynamics algorithms. Numerical experiments on a single nonlinear spring, a chain of nonlinear springs, and a two-dimensional truss reproduce the nonlinear equilibrium states, including regimes where plain Carleman linearization diverges and PSC restores convergence. If correct, the construction opens the first practical route from variational principles to quantum acceleration of nonlinear equilibrium analysis, with query complexity independent of the number of degrees of freedom $N$.","feed_headline":"Nonlinear equilibrium equations become linear flows for quantum","feed_subtitle":"Linearized energy-minimizing flow solves nonlinear spring and truss equilibria, with query cost independent of size.","key_machinery":"The load-bearing mechanism is the gradient-flow reformulation $du/dt=-f(u)=-\\nabla U(u)$, which converts a static nonlinear algebraic problem into a dynamical one whose Lyapunov decrease guarantees arrival at equilibrium. Carleman linearization then turns that flow into an infinite-dimensional linear system by promoting each tensor power $y_p=u^{\\otimes p}$ to an independent variable; truncating the hierarchy at order $P$ gives a finite matrix that can be block-encoded and simulated with Hamiltonian-simulation or quantum linear-system algorithms. Pivot Switching Carleman (PSC) is the same construction with the highest-order rows expanded around a pivot state $s$ rather than around zero, which stabilizes the truncated system when the plain Carleman matrix develops positive real-part eigenvalues. The spectral norm of the block-encoded matrix is what fixes the query complexity, and the tensor-product structure is what makes the qubit count logarithmic in $N$.","core_discovery":"The central claim is that any equilibrium equation expressible as the gradient of a coercive, locally Lipschitz potential can be solved by simulating its own energy descent: starting from any initial state, the flow $du/dt=-\\nabla U(u)$ reaches a point with $\\nabla U=0$ in the limit $t\\to\\infty$. The authors embed this nonlinear flow into an infinite-dimensional linear system by Carleman linearization, in which the variables are tensor powers $u^{\\otimes p}$, or by the Pivot Switching Carleman (PSC) variant, which expands the highest-order truncation rows around a pivot state to suppress divergence. Truncating at order $P$ and block-encoding the resulting matrix $A$ yields a quantum linear-dynamics problem with query complexity $O(P^{3/2}(\\|b\\|+k+a)t+\\ln(1/\\epsilon))$, independent of the number of masses $N$. The spring, chain, and truss experiments show the truncated linearized dynamics quantitatively reproduce the exact nonlinear equilibria, with PSC widening the stable parameter range.","pith_inferences":["An implication the paper leaves implicit: if the time $T$ needed to reach equilibrium grows with $N$ or with nonlinearity, the $N$-independence of the per-query cost would not translate into an end-to-end advantage; the paper sets $T=1$ in its examples and never analyzes how $T$ scales.","A natural extension not pursued in the paper: update the PSC pivot state adaptively during the flow so it tracks the evolving solution, which could stabilize the truncation in regimes where the fixed heuristic pivot (such as $s=0.01$) fails.","The gradient-flow viewpoint also suggests a preconditioning-style initialization: start the Carleman system from a cheap classical approximation of the equilibrium rather than from zero, shortening the simulation time and reducing truncation error in the same way preconditioning accelerates quantum linear-system solvers.","One could stress-test the claim by running the truncated system for a large chain or truss in classical simulation and asking whether the minimal truncation order $P$ needed for fixed accuracy stays bounded as $N$ grows; the paper reports only small examples ($N=8$ for the chain)."],"forward_implications":["Any equilibrium problem of the form $\\nabla U(u)=0$ with coercive, locally Lipschitz $U$ becomes, in principle, a quantum linear-dynamics task, so the pipeline is not tied to elasticity.","The query complexity $O(P^{3/2}(\\|b\\|+k+a)t+\\ln(1/\\epsilon))$ contains no factor of $N$, so the cost is set by the potential's coefficients, the truncation order, and the evolution time rather than by the number of degrees of freedom.","The truncated moment vector has dimension at most $2N^P$, implying a qubit count of $O(P\\log N)$ and an exponential memory saving relative to storing the state classically.","The choice of linearization is decisive: plain Carleman truncation diverges in strongly nonlinear regimes, while PSC with a well-chosen pivot restores convergence, so pivot selection directly governs which nonlinearity strengths are solvable.","The same variational-to-linear-flow construction is claimed to extend to other equilibrium problems in fluids, electromagnetics, and chemical kinetics whenever the potential satisfies the two structural conditions."],"supporting_citations":[{"why":"Supplies the Carleman linearization construction that embeds nonlinear ODE dynamics into an infinite-dimensional linear system, the basis of the proposed algorithm.","marker":"[34]"},{"why":"Introduces the Pivot Switching Carleman linearization used to stabilize the truncated flow in strongly nonlinear regimes.","marker":"[41]"},{"why":"Provides the Hamiltonian-simulation query complexity bound that underlies the $O(\\alpha t+\\ln(1/\\epsilon))$ estimate.","marker":"[47]"},{"why":"Provides the qubitization block-encoding framework used to justify the query-complexity scaling with the matrix norm.","marker":"[48]"},{"why":"Supplies the standard ordinary-differential-equation existence and uniqueness theorem used in Appendix A to prove the gradient flow reaches equilibrium.","marker":"[49]"}],"fun_headline_variants":["Quantum linearization solves nonlinear equilibrium equations","From nonlinear to linear: quantum algorithm for equilibria","Gradient-flow linearization enables quantum nonlinear solving","Quantum simulation of nonlinear systems via Carleman flow"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole argument rests on the truncated linear equations continuing to track the true energy-decreasing motion for the full time needed to reach equilibrium, and on that time not growing rapidly with system size or nonlinearity.","fun_headline_variants_meta":{"raw":{"variants":["Quantum linearization solves nonlinear equilibrium equations","From nonlinear to linear: quantum algorithm for equilibria","Gradient-flow linearization enables quantum nonlinear solving","Quantum simulation of nonlinear systems via Carleman flow"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000253,"raw_usage":{"total_tokens":1580,"prompt_tokens":977,"completion_tokens":603,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":593,"completion_tokens_details":{"reasoning_tokens":544}},"tokens_in":593,"tokens_out":603,"duration_ms":6475,"temperature":1.0,"reasoning_tokens":544,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T17:02:46.934982+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a chain of $N$ nonlinear springs with increasing nonlinearity, measure the smallest truncation order $P$ that keeps the truncated Carleman or PSC solution within a fixed tolerance of the exact equilibrium, and the time $T$ needed to get there; if either $P$ or $T$ grows with $N$, the claimed system-size independence collapses. Concretely, plot $T(\\epsilon,N)=\\min\\{t:\\|u(t)-u^*\\|<\\epsilon\\}$ for $N=8,16,32,\\dots$ and check whether $T$ remains bounded.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Carleman linearization construction that embeds nonlinear ODE dynamics into an infinite-dimensional linear system, the basis of the proposed algorithm."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the Hamiltonian-simulation query complexity bound that underlies the $O(\\alpha t+\\ln(1/\\epsilon))$ estimate."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the standard ordinary-differential-equation existence and uniqueness theorem used in Appendix A to prove the gradient flow reaches equilibrium."}],"review_version":1}