{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B26574MJ72V37FYECCDHUL4L2A","short_pith_number":"pith:B26574MJ","schema_version":"1.0","canonical_sha256":"0ebddff189feabbf970410867a2f8bd030a7f2d65482da208232e0a54dd890f2","source":{"kind":"arxiv","id":"2510.06796","version":3},"attestation_state":"computed","paper":{"title":"On the complexity of estimating ground state entanglement and free energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Jonas Kamminga, Sevag Gharibian","submitted_at":"2025-10-08T09:26:57Z","abstract_excerpt":"Understanding the entanglement structure of local Hamiltonian ground spaces is a physically motivated problem, with applications ranging from tensor network design to quantum error-correcting codes. To this end, we study the complexity of estimating ground state entanglement, and more generally entropy estimation for low energy states and Gibbs states. We find, in particular, that the classes qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum analogue of public-coin AM) and QMA(2) (QMA with unentangled proofs) play a crucial role for such problems, showing: (1) Detecting a high-ent"},"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.06796","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-08T09:26:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"59f07be5fbd4edf0a32b21fc6d3949d493d295377e81aad3ca828063c7ecd8a7","abstract_canon_sha256":"c0ec1d8309704ef4ec5db4ec50f8f2e5b908f83105a2c59f1230bb1bbd827acb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:36.839742Z","signature_b64":"BQIOJDgZILbCndFUNeVTOD21V4Kw01f776V3Ykw6xlbr8VsLpwA4RntH/X3Y1byVHRCn8gYtBvX9A/0h4BntBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ebddff189feabbf970410867a2f8bd030a7f2d65482da208232e0a54dd890f2","last_reissued_at":"2026-05-29T02:05:36.839305Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:36.839305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of estimating ground state entanglement and free energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Jonas Kamminga, Sevag Gharibian","submitted_at":"2025-10-08T09:26:57Z","abstract_excerpt":"Understanding the entanglement structure of local Hamiltonian ground spaces is a physically motivated problem, with applications ranging from tensor network design to quantum error-correcting codes. To this end, we study the complexity of estimating ground state entanglement, and more generally entropy estimation for low energy states and Gibbs states. We find, in particular, that the classes qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum analogue of public-coin AM) and QMA(2) (QMA with unentangled proofs) play a crucial role for such problems, showing: (1) Detecting a high-ent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.06796","kind":"arxiv","version":3},"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.06796/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.06796","created_at":"2026-05-29T02:05:36.839377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.06796v3","created_at":"2026-05-29T02:05:36.839377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.06796","created_at":"2026-05-29T02:05:36.839377+00:00"},{"alias_kind":"pith_short_12","alias_value":"B26574MJ72V3","created_at":"2026-05-29T02:05:36.839377+00:00"},{"alias_kind":"pith_short_16","alias_value":"B26574MJ72V37FYE","created_at":"2026-05-29T02:05:36.839377+00:00"},{"alias_kind":"pith_short_8","alias_value":"B26574MJ","created_at":"2026-05-29T02:05:36.839377+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27886","citing_title":"Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A","json":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A.json","graph_json":"https://pith.science/api/pith-number/B26574MJ72V37FYECCDHUL4L2A/graph.json","events_json":"https://pith.science/api/pith-number/B26574MJ72V37FYECCDHUL4L2A/events.json","paper":"https://pith.science/paper/B26574MJ"},"agent_actions":{"view_html":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A","download_json":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A.json","view_paper":"https://pith.science/paper/B26574MJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.06796&json=true","fetch_graph":"https://pith.science/api/pith-number/B26574MJ72V37FYECCDHUL4L2A/graph.json","fetch_events":"https://pith.science/api/pith-number/B26574MJ72V37FYECCDHUL4L2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A/action/storage_attestation","attest_author":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A/action/author_attestation","sign_citation":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A/action/citation_signature","submit_replication":"https://pith.science/pith/B26574MJ72V37FYECCDHUL4L2A/action/replication_record"}},"created_at":"2026-05-29T02:05:36.839377+00:00","updated_at":"2026-05-29T02:05:36.839377+00:00"}