arXiv (All)
open access
Approximation and composition of functions in quantized tensor trains via orthogonal polynomial expansions
This work explores the representation of univariate and multivariate functions as quantized tensor trains (QTT). It develops a constructive algorithm that employs expansions in orthogonal polynomial bases and Clenshaw evaluations to represent analytic and highly differentiable functions as QTT appro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Multivariate quantum state preparation with optimized tensor networks#987066
- Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms#189172
- Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms#189122
- Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms#189072
- Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms#189022
Record · ID 1013382
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive