REVIEW 4 cited by
Chebyshev approximation and composition of functions in matrix product states for quantum-inspired numerical analysis
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
read the original abstract
This work explores the representation of univariate and multivariate functions as matrix product states (MPS), also known as quantized tensor-trains (QTT). It proposes an algorithm that employs iterative Chebyshev expansions and Clenshaw evaluations to represent analytic and highly differentiable functions as MPS Chebyshev interpolants. It demonstrates rapid convergence for highly-differentiable functions, aligning with theoretical predictions, and generalizes efficiently to multidimensional scenarios. The performance of the algorithm is compared with that of tensor cross-interpolation (TCI) and multiscale interpolative constructions through a comprehensive comparative study. When function evaluation is inexpensive or when the function is not analytical, TCI is generally more efficient for function loading. However, the proposed method shows competitive performance, outperforming TCI in certain multivariate scenarios. Moreover, it shows advantageous scaling rates and generalizes to a wider range of tasks by providing a framework for function composition in MPS, which is useful for non-linear problems and many-body statistical physics.
Forward citations
Cited by 4 Pith papers
-
Quantics Tensor Train for solving Gross-Pitaevskii equation
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.
-
Inchworm tensor train hybridization expansion quantum impurity solver
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.
-
Tensor-network approach to quantum optical state evolution beyond the Fock basis
A tensor-network (MPS/MPO) solver simulates SPDC quantum dynamics directly in the continuous quadrature representation, compressing the state >3,000× at α=100.
-
SeeMPS: A Python-based Matrix Product State and Tensor Train Library
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.
Discussion (0). Continue with ORCID to comment.