{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TX6ALRGIJMMFJFUQYJNIK3PKHT","short_pith_number":"pith:TX6ALRGI","schema_version":"1.0","canonical_sha256":"9dfc05c4c84b18549690c25a856dea3ce33b1ea44acef1ecea776a5c674dbde0","source":{"kind":"arxiv","id":"2510.07798","version":2},"attestation_state":"computed","paper":{"title":"Efficient Matrix Product State Learning in Logarithmic Depth","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Chia-Ying Lin, Nai-Hui Chia, Shih-Han Hung","submitted_at":"2025-10-09T05:25:00Z","abstract_excerpt":"Learning the closest matrix product state (MPS) representation of a quantum state enables useful tools for quantum machine learning and analysis of complex quantum systems. In this work, we study the problem of learning MPS in the following setting: given many copies of an input MPS, the task is to recover a classical description of the state. The best known polynomial-time algorithm, introduced by [LCLP10, CPF+10], requires linear circuit depth and $\\widetilde O(n^5)$ samples, and has seen no improvement in over a decade. These costs, neither known to be optimal, renders existing algorithms i"},"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":"2510.07798","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-09T05:25:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fa610764d33c0c5870cea23119b0c8be32f088c123e32aca52ce02fd09d8ac2b","abstract_canon_sha256":"1540bad0ee24999311b3fde113e62d0f8dec7d1a3f3157ad933c5345c20d1364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:17.600245Z","signature_b64":"GnIWXPlFlzPRjV26NQWBcUAEvP8TnAGHvIohVZzqgnjdOicLjbhA8wRAnmc+qercZ1U31+rr+EnlTa6UoL8LCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dfc05c4c84b18549690c25a856dea3ce33b1ea44acef1ecea776a5c674dbde0","last_reissued_at":"2026-05-21T01:04:17.599538Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:17.599538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Matrix Product State Learning in Logarithmic Depth","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Chia-Ying Lin, Nai-Hui Chia, Shih-Han Hung","submitted_at":"2025-10-09T05:25:00Z","abstract_excerpt":"Learning the closest matrix product state (MPS) representation of a quantum state enables useful tools for quantum machine learning and analysis of complex quantum systems. In this work, we study the problem of learning MPS in the following setting: given many copies of an input MPS, the task is to recover a classical description of the state. The best known polynomial-time algorithm, introduced by [LCLP10, CPF+10], requires linear circuit depth and $\\widetilde O(n^5)$ samples, and has seen no improvement in over a decade. These costs, neither known to be optimal, renders existing algorithms i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.07798","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/2510.07798/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":"2510.07798","created_at":"2026-05-21T01:04:17.599623+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.07798v2","created_at":"2026-05-21T01:04:17.599623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.07798","created_at":"2026-05-21T01:04:17.599623+00:00"},{"alias_kind":"pith_short_12","alias_value":"TX6ALRGIJMMF","created_at":"2026-05-21T01:04:17.599623+00:00"},{"alias_kind":"pith_short_16","alias_value":"TX6ALRGIJMMFJFUQ","created_at":"2026-05-21T01:04:17.599623+00:00"},{"alias_kind":"pith_short_8","alias_value":"TX6ALRGI","created_at":"2026-05-21T01:04:17.599623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT","json":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT.json","graph_json":"https://pith.science/api/pith-number/TX6ALRGIJMMFJFUQYJNIK3PKHT/graph.json","events_json":"https://pith.science/api/pith-number/TX6ALRGIJMMFJFUQYJNIK3PKHT/events.json","paper":"https://pith.science/paper/TX6ALRGI"},"agent_actions":{"view_html":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT","download_json":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT.json","view_paper":"https://pith.science/paper/TX6ALRGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.07798&json=true","fetch_graph":"https://pith.science/api/pith-number/TX6ALRGIJMMFJFUQYJNIK3PKHT/graph.json","fetch_events":"https://pith.science/api/pith-number/TX6ALRGIJMMFJFUQYJNIK3PKHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT/action/storage_attestation","attest_author":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT/action/author_attestation","sign_citation":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT/action/citation_signature","submit_replication":"https://pith.science/pith/TX6ALRGIJMMFJFUQYJNIK3PKHT/action/replication_record"}},"created_at":"2026-05-21T01:04:17.599623+00:00","updated_at":"2026-05-21T01:04:17.599623+00:00"}