{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CSWLOS4CXHSG2WG5KOUV2CVI6A","short_pith_number":"pith:CSWLOS4C","schema_version":"1.0","canonical_sha256":"14acb74b82b9e46d58dd53a95d0aa8f02acd16f7c0bc6adf4e3ac2b9a63ae69b","source":{"kind":"arxiv","id":"2407.09609","version":2},"attestation_state":"computed","paper":{"title":"Chebyshev approximation and composition of functions in matrix product states for quantum-inspired numerical analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Juan Jos\\'e Garc\\'ia-Ripoll, Juan Jos\\'e Rodr\\'iguez-Aldavero, Luca Tagliacozzo, Paula Garc\\'ia-Molina","submitted_at":"2024-07-12T18:00:06Z","abstract_excerpt":"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) a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2407.09609","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-12T18:00:06Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"002253f91bc671755ca90adffbfbf2f457c32d5c23f11717b27f1907cb5b9443","abstract_canon_sha256":"23bfed1e4590bc13da9c18c7874cefddf58daeca918eb6a2778fce385fd79b4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:11.361353Z","signature_b64":"JJfJw9Tb58eSANy143ir1IIWMb5BfDqeRxKnFo+wktWCF1V6vvSfYnOaduVsfryPLJMkYRkUV/gVJhxdSLs4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14acb74b82b9e46d58dd53a95d0aa8f02acd16f7c0bc6adf4e3ac2b9a63ae69b","last_reissued_at":"2026-07-05T10:16:11.360812Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:11.360812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chebyshev approximation and composition of functions in matrix product states for quantum-inspired numerical analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Juan Jos\\'e Garc\\'ia-Ripoll, Juan Jos\\'e Rodr\\'iguez-Aldavero, Luca Tagliacozzo, Paula Garc\\'ia-Molina","submitted_at":"2024-07-12T18:00:06Z","abstract_excerpt":"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) a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09609","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.09609/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.09609","created_at":"2026-07-05T10:16:11.360869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09609v2","created_at":"2026-07-05T10:16:11.360869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09609","created_at":"2026-07-05T10:16:11.360869+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSWLOS4CXHSG","created_at":"2026-07-05T10:16:11.360869+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSWLOS4CXHSG2WG5","created_at":"2026-07-05T10:16:11.360869+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSWLOS4C","created_at":"2026-07-05T10:16:11.360869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.05202","citing_title":"Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2507.04262","citing_title":"Solving the Gross-Pitaevskii equation on multiple different scales using the quantics tensor train representation","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25631","citing_title":"Local tensor-train surrogates for quantum learning models","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A","json":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A.json","graph_json":"https://pith.science/api/pith-number/CSWLOS4CXHSG2WG5KOUV2CVI6A/graph.json","events_json":"https://pith.science/api/pith-number/CSWLOS4CXHSG2WG5KOUV2CVI6A/events.json","paper":"https://pith.science/paper/CSWLOS4C"},"agent_actions":{"view_html":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A","download_json":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A.json","view_paper":"https://pith.science/paper/CSWLOS4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09609&json=true","fetch_graph":"https://pith.science/api/pith-number/CSWLOS4CXHSG2WG5KOUV2CVI6A/graph.json","fetch_events":"https://pith.science/api/pith-number/CSWLOS4CXHSG2WG5KOUV2CVI6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A/action/storage_attestation","attest_author":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A/action/author_attestation","sign_citation":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A/action/citation_signature","submit_replication":"https://pith.science/pith/CSWLOS4CXHSG2WG5KOUV2CVI6A/action/replication_record"}},"created_at":"2026-07-05T10:16:11.360869+00:00","updated_at":"2026-07-05T10:16:11.360869+00:00"}