{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XIF34SOPDKMFBSEIEYBZ4T3BWQ","short_pith_number":"pith:XIF34SOP","schema_version":"1.0","canonical_sha256":"ba0bbe49cf1a9850c88826039e4f61b428808869e81cd79cb0eccf498ed84d10","source":{"kind":"arxiv","id":"2411.00082","version":2},"attestation_state":"computed","paper":{"title":"Testing and learning structured quantum Hamiltonians","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Arkopal Dutt, Francisco Escudero Guti\\'errez, Srinivasan Arunachalam","submitted_at":"2024-10-31T17:54:13Z","abstract_excerpt":"We consider the problems of testing and learning an unknown $n$-qubit Hamiltonian $H$ from queries to its evolution operator $e^{-iHt}$ under the normalized Frobenius norm. We prove:\n  1. Local Hamiltonians: We give a tolerant testing protocol to decide if $H$ is $\\epsilon_1$-close to $k$-local or $\\epsilon_2$-far from $k$-local, with $O(1/(\\epsilon_2-\\epsilon_1)^{4})$ queries, solving open questions posed in a recent work by Bluhm et al. For learning a $k$-local $H$ up to error $\\epsilon$, we give a protocol with query complexity $\\exp(O(k^2+k\\log(1/\\epsilon)))$ independent of $n$, by leverag"},"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":"2411.00082","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-31T17:54:13Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"4fa55fc31faa93304b8683c2512157f33b242bda17d3203aec7334552d004e89","abstract_canon_sha256":"b2fc1383be86d98814e8b2acc6ab8e9e8c10530125a019fea70940024632f8f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:52.391044Z","signature_b64":"FOl9AOdSQ+a5e15AZyidZYwHAtCo/uAMOMtaSd/czoh0JqxaAJmxN1HMo8nQp6y5M6jcrjKepShxSe48nN9wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba0bbe49cf1a9850c88826039e4f61b428808869e81cd79cb0eccf498ed84d10","last_reissued_at":"2026-07-05T11:16:52.390597Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:52.390597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing and learning structured quantum Hamiltonians","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Arkopal Dutt, Francisco Escudero Guti\\'errez, Srinivasan Arunachalam","submitted_at":"2024-10-31T17:54:13Z","abstract_excerpt":"We consider the problems of testing and learning an unknown $n$-qubit Hamiltonian $H$ from queries to its evolution operator $e^{-iHt}$ under the normalized Frobenius norm. We prove:\n  1. Local Hamiltonians: We give a tolerant testing protocol to decide if $H$ is $\\epsilon_1$-close to $k$-local or $\\epsilon_2$-far from $k$-local, with $O(1/(\\epsilon_2-\\epsilon_1)^{4})$ queries, solving open questions posed in a recent work by Bluhm et al. For learning a $k$-local $H$ up to error $\\epsilon$, we give a protocol with query complexity $\\exp(O(k^2+k\\log(1/\\epsilon)))$ independent of $n$, by leverag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00082","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/2411.00082/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":"2411.00082","created_at":"2026-07-05T11:16:52.390654+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.00082v2","created_at":"2026-07-05T11:16:52.390654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00082","created_at":"2026-07-05T11:16:52.390654+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIF34SOPDKMF","created_at":"2026-07-05T11:16:52.390654+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIF34SOPDKMFBSEI","created_at":"2026-07-05T11:16:52.390654+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIF34SOP","created_at":"2026-07-05T11:16:52.390654+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06472","citing_title":"Provable learning separation for predicting time-evolution of quantum many-body systems","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ","json":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ.json","graph_json":"https://pith.science/api/pith-number/XIF34SOPDKMFBSEIEYBZ4T3BWQ/graph.json","events_json":"https://pith.science/api/pith-number/XIF34SOPDKMFBSEIEYBZ4T3BWQ/events.json","paper":"https://pith.science/paper/XIF34SOP"},"agent_actions":{"view_html":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ","download_json":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ.json","view_paper":"https://pith.science/paper/XIF34SOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.00082&json=true","fetch_graph":"https://pith.science/api/pith-number/XIF34SOPDKMFBSEIEYBZ4T3BWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XIF34SOPDKMFBSEIEYBZ4T3BWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ/action/storage_attestation","attest_author":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ/action/author_attestation","sign_citation":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ/action/citation_signature","submit_replication":"https://pith.science/pith/XIF34SOPDKMFBSEIEYBZ4T3BWQ/action/replication_record"}},"created_at":"2026-07-05T11:16:52.390654+00:00","updated_at":"2026-07-05T11:16:52.390654+00:00"}