Pith. sign in

REVIEW 7 cited by

Multiscale interpolative construction of quantized tensor trains

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.12554 v3 pith:7YPDRF2H submitted 2023-11-21 math.NA cs.NA

classification math.NAcs.NA
keywords qttsconstructionfunctionfunctionsmultiscalenumericalperspectivequantized
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantized tensor trains (QTTs) have recently emerged as a framework for the numerical discretization of continuous functions, with the potential for widespread applications in numerical analysis. However, the theory of QTT approximation is not fully understood. In this work, we advance this theory from the point of view of multiscale polynomial interpolation. This perspective clarifies why QTT ranks decay with increasing depth, quantitatively controls QTT rank in terms of smoothness of the target function, and explains why certain functions with sharp features and poor quantitative smoothness can still be well approximated by QTTs. The perspective also motivates new practical and efficient algorithms for the construction of QTTs from function evaluations on multiresolution grids.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 7 Pith papers

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

  1. Linear-Scaling Tensor Train Sketching

    math.NA 2026-03 accept novelty 7.0 of 10

    TTStack achieves oblivious subspace embedding and injection for tensor trains with sample complexity linear in order d and subspace dimension r, yielding quasi-optimal randomized TT rounding.

  2. Quantics Tensor Train for solving Gross-Pitaevskii equation

    cond-mat.quant-gas 2025-07 conditional novelty 6.0 of 10

    A quantics tensor train framework solves the 1D Gross-Pitaevskii equation, including multi-species and long-range interactions, with polylogarithmic scaling of storage and operations.

  3. Inchworm tensor train hybridization expansion quantum impurity solver

    cond-mat.str-el 2025-05 conditional novelty 6.0 of 10

    A tensor-train inchworm hybridization-expansion solver is benchmarked against exact solutions, but its multi-orbital results bypass the inchworm propagation step by substituting the exact diagonalization propagator.

  4. 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.

  5. Tensor-network approach to quantum optical state evolution beyond the Fock basis

    quant-ph 2025-11 conditional novelty 5.0 of 10

    A tensor-network (MPS/MPO) solver simulates SPDC quantum dynamics directly in the continuous quadrature representation, compressing the state >3,000× at α=100.

  6. Technical report on a quantum-inspired solver for simulating compressible flows

    physics.flu-dyn 2025-06 reject novelty 5.0 of 10

    A tensor-network solver for compressible flows is proposed with polylog scaling claims, but the 2D implementation does not converge and only the 1D Sod shock tube case matches the reference solution.

  7. SeeMPS: A Python-based Matrix Product State and Tensor Train Library

    quant-ph 2026-01 conditional novelty 4.0 of 10

    SeeMPS is a Python MPS/TT library offering a BLAS/LAPACK-style API for compressed linear algebra, from DMRG and time evolution to PDE solving and Fourier transforms.

Pith tools