Chebyshev approximation and composition of functions in matrix product states for quantum-inspired numerical analysis
<|reference_start|>Chebyshev approximation and composition of functions in matrix product states for quantum-inspired numerical analysis: 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.<|reference_end|>
@article{rodríguez-aldavero2024chebyshev,
    title={Chebyshev approximation and composition of functions in matrix product
  states for quantum-inspired numerical analysis},
    author={Juan Jos'e Rodr'iguez-Aldavero, Paula Garc'ia-Molina, Luca
  Tagliacozzo, Juan Jos'e Garc'ia-Ripoll},
    journal={arXiv preprint arXiv:2407.09609},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.09609},
    primaryClass={quant-ph cs.NA math.NA}
}