{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VWCZGYP3YC34A7ZYQ7MBR3OS4X","short_pith_number":"pith:VWCZGYP3","schema_version":"1.0","canonical_sha256":"ad859361fbc0b7c07f3887d818edd2e5f91fd7f6c5cc48d02ae9c7bc77b5178d","source":{"kind":"arxiv","id":"2004.07266","version":1},"attestation_state":"computed","paper":{"title":"Sample-efficient learning of quantum many-body systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, Mehdi Soleimanifar, Srinivasan Arunachalam, Tomotaka Kuwahara","submitted_at":"2020-04-15T18:01:59Z","abstract_excerpt":"We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs (thermal) state. The classical analog of this problem, known as learning graphical models or Boltzmann machines, is a well-studied question in machine learning and statistics. In this work, we give the first sample-efficient algorithm for the quantum Hamiltonian learning problem. In particular, we prove that polynomially many samples in the number of particles (qudits) are necessary and sufficient for learning the parameters of a spatially local Hamiltonian in l_2-norm.\n  Our main contri"},"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":"2004.07266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-15T18:01:59Z","cross_cats_sorted":["cond-mat.stat-mech","cs.LG","math.OC"],"title_canon_sha256":"aca1696eeecd774774f75ed70107e0864cf0c8914194ef239c89cdd2e020bf5d","abstract_canon_sha256":"d6d5822034448f4ad124cd86f288c0f64bcee34fff9572008c04e6be8695ebce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:41.243123Z","signature_b64":"FiiP3utydje6lMyIkHEHwVf8z9Z0H4LLpcP06vqolpc7/OY1X03eC3OpSGw1VlgHXv5qayTubJCi5O+TLrRMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad859361fbc0b7c07f3887d818edd2e5f91fd7f6c5cc48d02ae9c7bc77b5178d","last_reissued_at":"2026-07-05T02:42:41.242653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:41.242653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample-efficient learning of quantum many-body systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, Mehdi Soleimanifar, Srinivasan Arunachalam, Tomotaka Kuwahara","submitted_at":"2020-04-15T18:01:59Z","abstract_excerpt":"We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs (thermal) state. The classical analog of this problem, known as learning graphical models or Boltzmann machines, is a well-studied question in machine learning and statistics. In this work, we give the first sample-efficient algorithm for the quantum Hamiltonian learning problem. In particular, we prove that polynomially many samples in the number of particles (qudits) are necessary and sufficient for learning the parameters of a spatially local Hamiltonian in l_2-norm.\n  Our main contri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07266","kind":"arxiv","version":1},"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/2004.07266/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":"2004.07266","created_at":"2026-07-05T02:42:41.242709+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.07266v1","created_at":"2026-07-05T02:42:41.242709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07266","created_at":"2026-07-05T02:42:41.242709+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWCZGYP3YC34","created_at":"2026-07-05T02:42:41.242709+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWCZGYP3YC34A7ZY","created_at":"2026-07-05T02:42:41.242709+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWCZGYP3","created_at":"2026-07-05T02:42:41.242709+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.18500","citing_title":"Conditional Independence of 1D Gibbs States with Applications to Efficient Learning","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X","json":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X.json","graph_json":"https://pith.science/api/pith-number/VWCZGYP3YC34A7ZYQ7MBR3OS4X/graph.json","events_json":"https://pith.science/api/pith-number/VWCZGYP3YC34A7ZYQ7MBR3OS4X/events.json","paper":"https://pith.science/paper/VWCZGYP3"},"agent_actions":{"view_html":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X","download_json":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X.json","view_paper":"https://pith.science/paper/VWCZGYP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.07266&json=true","fetch_graph":"https://pith.science/api/pith-number/VWCZGYP3YC34A7ZYQ7MBR3OS4X/graph.json","fetch_events":"https://pith.science/api/pith-number/VWCZGYP3YC34A7ZYQ7MBR3OS4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X/action/storage_attestation","attest_author":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X/action/author_attestation","sign_citation":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X/action/citation_signature","submit_replication":"https://pith.science/pith/VWCZGYP3YC34A7ZYQ7MBR3OS4X/action/replication_record"}},"created_at":"2026-07-05T02:42:41.242709+00:00","updated_at":"2026-07-05T02:42:41.242709+00:00"}