Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Quantum-Inspired Solver for Simulating Material Deformations

T0 review · 3 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that a tensor-network finite-element solver can handle 2D linear elasticity problems with billions of degrees of freedom while memory and runtime grow only logarithmically in the grid size.

desk verdict A clean QTT-FEM application to 2D linear elasticity with honest comparisons, but the exponential-savings claim rests on unverified ranks and the novelty is undercut by a concurrent preprint. read the letter →

arxiv 2501.12151 v2 pith:XUHINLE4 submitted 2025-01-21 quant-ph cs.NAmath.NA

Mazen Ali , Aser Cortines , Siddhartha Morales , Samuel Mugel , Mireia Olave , Roman Orus , Samuel Palmer , Hodei Usabiaga This is my paper · ORCID
classification quant-phcs.NAmath.NA MSC 65N3074S0515A69 PACS 02.70.Dh
keywords tensornetworkstrainsquanticstrainfiniteelementmethodlinearelasticitymaterialdeformationsimulationquantum-inspiredalgorithmslow-rankPDEsolvers
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that linear elasticity simulations, the standard finite-element workload of structural mechanics, can be reformulated so that the stiffness matrix, force vector, and displacement solution are stored and operated on as tensor trains. On a two-dimensional aluminum cantilever-beam benchmark it reports close agreement with a classical finite-element solver and with the analytic tip displacement, while memory and runtime scale logarithmically with the number of grid points. If those scaling results hold, finite-element elasticity becomes practical at hundreds of millions to billions of degrees of freedom on ordinary hardware, in contrast to classical FEM, whose memory and time grow at least linearly with the mesh. The practical significance is a path from quantum-inspired tensor-network algorithms to industrially relevant material-deformation analysis.

What carries the argument

The central object is the quantics tensor train (QTT), a chain of small tensors that encodes a vector of length $2^d$ or a $2^d \times 2^d$ matrix in $O(r^2 d)$ storage, where $r$ is the largest bond dimension (rank). The argument is carried by three tensorized components: mesh-grid TTs $\mathbf{X}$, $\mathbf{Y}$ of rank 2 that make every element Jacobian an affine-linear TT; a TT-cross step that approximates the inverse determinant $(\det \mathbf{J})^{-1}$; and the $\mathrm{AMEn}$ iterative solver, which finds $\mathbf{u}$ from $\mathbf{A}\mathbf{u} = \mathbf{f}$ without forming the full matrix. All costs are therefore linear in $d$ and polynomial in the ranks, not linear in $N$.

What would settle it

Run the cantilever-beam benchmark for increasing $d$ (for example $d=5$ through $d=12$), record the largest TT bond dimension and the wall-clock time and memory for $\mathbf{A}$, $\mathbf{f}$, and $\mathbf{u}$, and compare the slopes against $d$; any rank growing like a power of $d$, or any runtime growing faster than logarithmic in $N=4^d$, would falsify the exponential-savings claim.

Watch

Extended reading notes

Core claim

The central claim is that a finite-element solver for 2D linear elasticity can be assembled and solved entirely in tensor-train format, and that the data compression is so strong that storage and time grow only logarithmically with the number of degrees of freedom. On a plane-stress aluminum cantilever beam, the paper reports solutions matching a classical reference FEM solver and the analytic maximum deflection, while $N = 4^d$ degrees of freedom are handled with memory and solve times that scale with $d$ rather than $N$. The conclusion the authors draw is an exponential reduction in both memory usage and computational time compared with classical FEM.

Load-bearing premise

The logarithmic-scaling claim depends entirely on the tensor-train ranks of the stiffness operator, the force vector, and the solution staying small as the grid grows; the paper relies on this assumption without proving it or reporting the rank values.

Editorial extensions

If this is right

  • The reported scaling means that a $4^d$-point elasticity mesh, with $2\cdot 4^d$ degrees of freedom, can be stored and solved with memory that stays essentially flat as $d$ grows, where classical FEM would need memory linear in $N$.
  • The displacement and energy outputs agree with the classical reference solver and with the analytic maximum-deflection formula, so the compressed representation is not just a compact object but a faithful solution.
  • Total time to solution crosses the classical solver around $10^6$–$10^7$ degrees of freedom, and beyond that point the advantage grows without bound under the stated scaling.
  • The same assembly logic extends to 3D, more complex domains, and non-homogeneous or non-isotropic materials, with the clear caveat that the achievable compression then depends on the ranks introduced by the material tensor.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper's strongest untested premise is rank stability; a natural extension is to instrument the solver to output the bond dimensions of $\mathbf{A}$, $\mathbf{f}$, and $\mathbf{u}$ at each $d$, since the entire exponential claim reduces to this measurement.
  • For engineering practice, the relevant next test is not another 2D isotropic beam but a problem with a material interface or a non-Cartesian mesh, where the affine Jacobian trick no longer holds and rank growth determines whether the advantage survives.
  • If rank growth stays benign, the same tensorized assembly could be applied to other elliptic boundary-value problems with tensor-product grids, such as thermoelasticity or structural vibration, giving a general low-rank substitution for sparse matrix assembly.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The manuscript develops a tensor-network finite-element (TN-FEM) solver for two-dimensional linear elasticity. The stiffness and mass operators and the load vector are assembled directly in quantics tensor-train (QTT) format, the inverse Jacobian determinant is approximated with TT-cross, and the resulting linear system is solved with the AMEn algorithm. The solver is demonstrated on a two-dimensional cantilever beam under gravity, with results compared against FEniCS and against an analytical formula for the maximum deflection. The authors report logarithmic memory and runtime scaling with the number of degrees of freedom and claim that the method solves linear elasticity problems with billions of degrees of freedom and achieves exponential reductions in memory and time.

Significance. If the central claim is correct, this is a practically relevant step toward quantum-inspired solvers for continuum mechanics and would complement the existing QTT-based Poisson and Navier--Stokes solvers. The validation is appropriately non-circular: the solver is checked against an independent analytical beam-deflection formula and against a classical FEM package, and the paper clearly explains the assembly procedure and the algorithm. The main limitation is that the claimed exponential advantage rests on an unverified rank-boundedness assumption. The paper does not report tensor-train ranks, truncation tolerances, AMEn stopping criteria, or the largest problem size actually solved, so the abstract's 'billions of degrees of freedom' and the conclusion's 'exponential advantages' are stronger than the evidence presented. Because the missing measurements are straightforward to supply, the central idea is defensible and the manuscript merits a major revision rather than rejection.

major comments (3)
  1. [Section 4; Section 6, Figs. 6-7] Section 4 states that the storage cost is O(r^2 d) = O(r^2 log N) 'assuming the ranks r remain small', and Section 6 reports only memory and time scaling without reporting the TT ranks of A, M, f, and u. The exponential-savings claim in the Abstract and Section 7 is therefore conditional on an unmeasured rank-boundedness. If the ranks grow with the grid exponent d, the observed logarithmic scaling in Figures 6 and 7 could be an artifact of the implemented truncation tolerances and of the limited range of d tested. Please report TT ranks of A, M, f, and u as functions of d, the TT-cross and AMEn tolerances, the maximum bond dimensions allowed, and the largest d actually solved; in addition, state explicitly whether any run reached or exceeded 10^9 degrees of freedom.
  2. [Section 5.1; Section 6] Section 5.1 introduces TT-cross as an efficient approximation of (det J)^{-1} for general quadrilateral meshes, but the only numerical demonstration is a rectangular cantilever beam for which det J is constant and its inverse is exactly representable with low rank. This sidesteps the potentially rank-increasing step that the method would need for genuinely non-rectangular quadrilaterals. To support the 'any quadrilateral' statement in Section 5 and the generality implied by the conclusions, the authors should test a non-rectangular or distorted quadrilateral mesh and report the TT-cross approximation error and the ranks of (det J)^{-1} as d increases.
  3. [Algorithm 2; Section 6] The accuracy of the AMEn solve is not quantified: no residuals, stopping tolerance, or maximum rank are reported, and the numerical validation in Section 6 rests mainly on one scalar quantity, the maximum displacement, plus visual comparison in Figures 4 and 8. Please report the AMEn stopping criterion and residual, the relative error in the displacement field and in the energy for each d, and the resulting rank of the solution TT; without this, the reader cannot judge whether the observed agreement persists at the largest d or only for the plotted cases.
minor comments (5)
  1. [Section 5.3; Algorithm 1] The heading 'Force V ector' contains a typo, and Algorithm 1's line 7 writes 'stiffnes' instead of 'stiffness'.
  2. [Results, figures] Figure 8 is referenced and displayed before Figures 4-7 in the current layout; please reorder the figures and their references so that the presentation is sequential.
  3. [Section 6] The statement 'For this plot, we used 48 grid points' is unclear because 48 is not a power of 4; please specify the grid exponent d and the implied number of grid points and degrees of freedom.
  4. [Figures 5 and 7] The captions of Figures 5 and 7 should define the error metric (which norm or which scalar), the legend entries, and how the three timing quantities in Figure 7 are measured, since 'the exact values are less informative' is not a substitute for this information.
  5. [Section 6] The break-even statement of 10^6 to 10^7 degrees of freedom for total time should be accompanied by the concrete AMEn and TT-cross settings used, because the runtime is sensitive to tolerances and maximum ranks.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the TN-FEM derivation is benchmarked against an external analytic formula and FEniCS, and its algorithmic ingredients come from non-overlapping prior work.

full rationale

I walked the claimed derivation chain and found no step where a prediction reduces by construction to an input. The central mechanism is the QTT complexity formula O(r^2 d) = O(r^2 log N), which is a definitional fact about tensor trains rather than a fitted result; the paper's genuine claim is that this low-rank structure persists for the elasticity stiffness operator, force vector, and solution. That claim is checked against two independent external references: the analytic cantilever deflection formula in Eq. (10) and the classical FEniCS solver. No constant is fitted from these comparisons, and no closely related quantity is predicted from a fitted subset. The only self-citation is Orus [2014], a general tutorial review of tensor networks, which is not load-bearing. The method's prior-art ingredients (Markeeva et al., Bachmayr and Kazeev, Dolgov and Savostyanov, Oseledets, Oseledets and Tyrtyshnikov) have no author overlap with the present paper, and the similar concurrent preprint by Benvenuti et al. is acknowledged. The weakest point is that TT ranks and TT-cross approximation errors are never reported, so the 'billions of degrees of freedom' and exponential-scaling claims rest on an unverified rank-boundedness assumption; however, that is a correctness and evidence concern, not a circularity. The paper does not use any target result as an input, and its validation is external, so the circularity score is 0.

Assumptions & free parameters 3 free parameters · 6 assumptions · 0 invented entities

The paper introduces no new physical entities. Its contribution rests on the standard FEM/QTT machinery and on the unstated assumption that all relevant tensors have small ranks. The free parameters are the numerical tolerances and rank controls that are never reported. This ledger shows that the exponential scaling claim is essentially one big assumption (small ranks) plus a set of undisclosed hyperparameters.

free parameters (3)
  • TT-cross rank truncation tolerance
    Used to approximate (det J)^{-1} in Section 5.1; the tolerance is not reported, so the accuracy and cost of the assembly cannot be reproduced.
  • AMEn solver tolerance and maximum rank
    The linear solve in Algorithm 2 requires stopping tolerances and rank control; neither is reported, and these affect solution accuracy and the observed scaling.
  • Maximum bond dimension allowed during assembly
    The ranks of the assembled stiffness operator and RHS are implicitly bounded by implementation choices; no values are given, and rank growth is central to the scaling claim.
assumptions (6)
  • domain assumption Linear elasticity constitutive equations (Eq. 2) with homogeneous isotropic material
    Standard small-strain elasticity model; used to build the weak form and the stiffness operator.
  • domain assumption Affine dependence of Jacobians on element indices (Eq. 8)
    Taken from Markeeva et al. [2021]; this is what makes the Jacobian TTs have rank at most 2. It only holds for a tensor-product quadrilateral grid.
  • ad hoc to paper TT ranks of A, f, and u remain small as N grows
    The logarithmic scaling result depends on rank-boundedness; the paper neither proves nor reports the ranks, so this is a load-bearing assumption.
  • ad hoc to paper TT-cross approximation of (det J)^{-1} is sufficiently accurate
    Section 5.1 says this 'cannot be done efficiently and exactly in general' and uses TT-cross; the approximation error is not analyzed, yet it enters every stiffness entry.
  • ad hoc to paper AMEn solver converges for the assembled elasticity operator
    Algorithm 2 relies on the AMEn method of Dolgov and Savostyanov [2014]; no convergence analysis is given for this specific stiffness matrix.
  • standard math Analytical cantilever deflection formula (Eq. 10)
    Euler-Bernoulli beam theory result used as ground truth for the relative error check.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum-Inspired Solver for Simulating Material Deformations." pith.science (2026). https://pith.science/paper/XUHINLE4

@misc{pith2026250112151,
  author       = {Pith},
  title        = {Pith review of: Quantum-Inspired Solver for Simulating Material Deformations},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XUHINLE4}},
  note         = {Machine review of arXiv:2501.12151}
}
read the original abstract

This paper explores the application of tensor networks (TNs) to the simulation of material deformations within the framework of linear elasticity. Material simulations are essential computational tools extensively used in both academic research and industrial applications. TNs, originally developed in quantum mechanics, have recently shown promise in solving partial differential equations (PDEs) due to their potential for exponential speedups over classical algorithms. Our study successfully employs TNs to solve linear elasticity equations with billions of degrees of freedom, achieving exponential reductions in both memory usage and computational time. These results demonstrate the practical viability of TNs as a powerful classical backend for executing quantum-inspired algorithms with significant efficiency gains. This work is based on our research conducted with IKERLAN.

Figures

Figures reproduced from arXiv: 2501.12151 by the authors.

Figure 1
Figure 1. QR-decomposition of matrix A. In the above figure, tensors are represented by shapes, indices are represented by lines, and contracted indices correspond to lines shared by tensors. There are numerous other possible TN structures; for a comprehensive introduction, see Orús [2014], Biamonte and Bergholm [2017]. For the purposes of this work, tensor trains (TTs), also known as Matrix Product States (MPS), as shown in … view at source ↗
Figure 2
Figure 2. Tensor network diagrams. Thus, we can express a vector v ∈ R 2 d of size 2 d as a tensor v ∈ R 2×···×2 via v(i) = v(i0, . . . , id−1), and apply TN methods to this representation. The same approach can be used for matrices. In principle, this method can be applied to vectors and matrices of any size by factoring them into primes, but it is simpler to work with sizes that are powers of 2. The TN compression rate has … view at source ↗
Figure 3
Figure 3. Quadrilateral discretization in powers of 4. As an example we show a [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (5 more)
Figure 8
Figure 8. Figure 8: Displacement and energy comparison. The main advantage of the TN-solver is its logarithmic scaling with the number of d.o.f., representing an exponential speed-up compared to classical FEM. We illustrate this in [PITH_FULL_IMAGE:figures/full_fig_p008_8.png]
Figure 4
Figure 4. Figure 4: Deformation of the bar. For this plot, we used [PITH_FULL_IMAGE:figures/full_fig_p009_4.png]
Figure 5
Figure 5. Figure 5: The FEniCS and the TN-FEM solver relative error for the maximum displacement [PITH_FULL_IMAGE:figures/full_fig_p010_5.png]
Figure 6
Figure 6. Figure 6: Memory needed to store the stiffness matrix, the force vector and the displacement vector. Both axes are on a [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]
Figure 7
Figure 7. Figure 7: The FEniCS and the TN-FEM solver time required for constructing the FEM system of linear equations, solving time and the total time. computations were performed on a personal MacBook Pro with an Apple M3 Pro chip and 18 GB of RAM. The exact values are less informative …

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient upsampling for tensor-network and quantum-state encoded functions

    math.NA 2026-01 conditional novelty 5.0 of 10

    Tensor-Train Interpolation (TTI) refines a coarse QTT to arbitrary resolution by appending constant-rank polynomial-kernel cores, with error controlled by the coarse grid spacing.

Reference graph

Works this paper leans on

13 extracted references · 4 canonical work pages · cited by 1 Pith paper

  1. [1]

    Finite Elements: Theory, Fast Solvers, and Applications in Solid Mechanics

    Dietrich Braess. Finite Elements: Theory, Fast Solvers, and Applications in Solid Mechanics. Cambridge University Press, 3 edition, 2007

    work page 2007

  2. [2]

    Low-rank tensor methods for partial differential equations

    Markus Bachmayr. Low-rank tensor methods for partial differential equations. Acta Numerica, 32: 0 1–121, 2023. doi:10.1017/S0962492922000125

    doi:10.1017/s0962492922000125 2023

  3. [3]

    A practical introduction to tensor networks: Matrix product states and projected entangled pair states

    Román Orús. A practical introduction to tensor networks: Matrix product states and projected entangled pair states. Annals of Physics, 349: 0 117--158, 2014. ISSN 0003-4916. doi:https://doi.org/10.1016/j.aop.2014.06.013. URL https://www.sciencedirect.com/science/article/pii/S0003491614001596

    doi:10.1016/j.aop.2014.06.013 2014

  4. [4]

    Tensor networks in a nutshell, 2017

    Jacob Biamonte and Ville Bergholm. Tensor networks in a nutshell, 2017. URL https://arxiv.org/abs/1708.00006

    arXiv 2017

  5. [5]

    Markeeva, I

    L. Markeeva, I. Tsybulin, and I. Oseledets. Qtt-isogeometric solver in two dimensions. Journal of Computational Physics, 424: 0 109835, 2021. ISSN 0021-9991. doi:https://doi.org/10.1016/j.jcp.2020.109835. URL https://www.sciencedirect.com/science/article/pii/S0021999120306094

    arXiv 2021

  6. [6]

    Stability of low-rank tensor representations and structured multilevel preconditioning for elliptic pdes

    Markus Bachmayr and Vladimir Kazeev. Stability of low-rank tensor representations and structured multilevel preconditioning for elliptic pdes. Foundations of Computational Mathematics, 20 0 (5): 0 1175--1236, Oct 2020. ISSN 1615-3383. doi:10.1007/s10208-020-09446-z. URL https://doi.org/10.1007/s10208-020-09446-z

    work page doi:10.1007/s10208-020-09446-z 2020

  7. [7]

    Numerical solution of the incompressible navier-stokes equations for chemical mixers via quantum-inspired tensor train finite element method, 2023

    Egor Kornev, Sergey Dolgov, Karan Pinto, Markus Pflitsch, Michael Perelshtein, and Artem Melnikov. Numerical solution of the incompressible navier-stokes equations for chemical mixers via quantum-inspired tensor train finite element method, 2023. URL https://arxiv.org/abs/2305.10784

    arXiv 2023

  8. [8]

    Tetrafem: Numerical solution of partial differential equations using tensor train finite element method

    Egor Kornev, Sergey Dolgov, Michael Perelshtein, and Artem Melnikov. Tetrafem: Numerical solution of partial differential equations using tensor train finite element method. Mathematics, 12 0 (20), 2024. ISSN 2227-7390. doi:10.3390/math12203277. URL https://www.mdpi.com/2227-7390/12/20/3277

    work page doi:10.3390/math12203277 2024

Show all 13 references
  1. [9]

    A low-rank qtt-based finite element method for elasticity problems, 2025

    Elena Benvenuti, Gianmarco Manzini, Marco Nale, and Simone Pizzolato. A low-rank qtt-based finite element method for elasticity problems, 2025. URL https://arxiv.org/abs/2501.07778

    2025 arXiv

  2. [10]

    I. V. Oseledets. Tensor-train decomposition. SIAM Journal on Scientific Computing, 33 0 (5): 0 2295--2317, 2011. doi:10.1137/090752286. URL https://doi.org/10.1137/090752286

    2011 doi

  3. [11]

    I. V. Oseledets. Approximation of 2^d 2^d matrices using tensor decomposition. SIAM Journal on Matrix Analysis and Applications, 31 0 (4): 0 2130--2145, 2010. doi:10.1137/090757861. URL https://doi.org/10.1137/090757861

    2010 doi

  4. [12]

    Tt-cross approximation for multidimensional arrays

    Ivan Oseledets and Eugene Tyrtyshnikov. Tt-cross approximation for multidimensional arrays. Linear Algebra and its Applications, 432 0 (1): 0 70--88, 2010. ISSN 0024-3795. doi:https://doi.org/10.1016/j.laa.2009.07.024. URL https://www.sciencedirect.com/science/article/pii/S002...

    2010 doi

  5. [13]

    Dolgov and Dmitry V

    Sergey V. Dolgov and Dmitry V. Savostyanov. Alternating minimal energy methods for linear systems in higher dimensions. SIAM Journal on Scientific Computing, 36 0 (5): 0 A2248--A2271, 2014. doi:10.1137/140953289. URL https://doi.org/10.1137/140953289

    2014 doi

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.