{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YHQ3SCL6IJIKFOMC6DVIU6DWP4","short_pith_number":"pith:YHQ3SCL6","schema_version":"1.0","canonical_sha256":"c1e1b9097e4250a2b982f0ea8a78767f39d7451a0ad3fd2023f3138666da0512","source":{"kind":"arxiv","id":"2410.13937","version":2},"attestation_state":"computed","paper":{"title":"Quantum computational complexity of matrix functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Leandro Aolita, Mario Berta, Samson Wang, Santiago Cifuentes, Thais L. Silva","submitted_at":"2024-10-17T18:00:03Z","abstract_excerpt":"We investigate the dividing line between classical and quantum computational power in estimating properties of matrix functions. More precisely, we study the computational complexity of two primitive problems: given a function $f$ and a Hermitian matrix $A$, compute a matrix element of $f(A)$ or compute a local measurement on $f(A)|0\\rangle^{\\otimes n}$, with $|0\\rangle^{\\otimes n}$ an $n$-qubit reference state vector, in both cases up to additive approximation error. We consider four functions -- monomials, Chebyshev polynomials, the time evolution function, and the inverse function -- and pr"},"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":"2410.13937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-17T18:00:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"227d2904f508c62eb0fb822891713d57eaed2549f57f03dd50b9a62238c441c1","abstract_canon_sha256":"81ce29ea19e09b76b4083aa85b7e08c4d4d814f1967bc4ebf81a8f5e91d8ca0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:37.995065Z","signature_b64":"LvpGdb9lyVzcBeJ+VmbjqC45vyVT2YnDrA9fwhoLvoGw/CRgZsSxkb3sUcWunNsnaJ8PWscOBxsEQWLhG+skAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e1b9097e4250a2b982f0ea8a78767f39d7451a0ad3fd2023f3138666da0512","last_reissued_at":"2026-07-05T10:52:37.994580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:37.994580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum computational complexity of matrix functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Leandro Aolita, Mario Berta, Samson Wang, Santiago Cifuentes, Thais L. Silva","submitted_at":"2024-10-17T18:00:03Z","abstract_excerpt":"We investigate the dividing line between classical and quantum computational power in estimating properties of matrix functions. More precisely, we study the computational complexity of two primitive problems: given a function $f$ and a Hermitian matrix $A$, compute a matrix element of $f(A)$ or compute a local measurement on $f(A)|0\\rangle^{\\otimes n}$, with $|0\\rangle^{\\otimes n}$ an $n$-qubit reference state vector, in both cases up to additive approximation error. We consider four functions -- monomials, Chebyshev polynomials, the time evolution function, and the inverse function -- and pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13937","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/2410.13937/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":"2410.13937","created_at":"2026-07-05T10:52:37.994639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.13937v2","created_at":"2026-07-05T10:52:37.994639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13937","created_at":"2026-07-05T10:52:37.994639+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHQ3SCL6IJIK","created_at":"2026-07-05T10:52:37.994639+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHQ3SCL6IJIKFOMC","created_at":"2026-07-05T10:52:37.994639+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHQ3SCL6","created_at":"2026-07-05T10:52:37.994639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14789","citing_title":"Solving MNIST with a globally trained Mixture of Quantum Experts","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4","json":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4.json","graph_json":"https://pith.science/api/pith-number/YHQ3SCL6IJIKFOMC6DVIU6DWP4/graph.json","events_json":"https://pith.science/api/pith-number/YHQ3SCL6IJIKFOMC6DVIU6DWP4/events.json","paper":"https://pith.science/paper/YHQ3SCL6"},"agent_actions":{"view_html":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4","download_json":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4.json","view_paper":"https://pith.science/paper/YHQ3SCL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.13937&json=true","fetch_graph":"https://pith.science/api/pith-number/YHQ3SCL6IJIKFOMC6DVIU6DWP4/graph.json","fetch_events":"https://pith.science/api/pith-number/YHQ3SCL6IJIKFOMC6DVIU6DWP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4/action/storage_attestation","attest_author":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4/action/author_attestation","sign_citation":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4/action/citation_signature","submit_replication":"https://pith.science/pith/YHQ3SCL6IJIKFOMC6DVIU6DWP4/action/replication_record"}},"created_at":"2026-07-05T10:52:37.994639+00:00","updated_at":"2026-07-05T10:52:37.994639+00:00"}