{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H6NPGMMKTZH5IBEMZ3YBJOE2II","short_pith_number":"pith:H6NPGMMK","schema_version":"1.0","canonical_sha256":"3f9af3318a9e4fd4048ccef014b89a422228e247c584bd3cec4485412233df8f","source":{"kind":"arxiv","id":"2410.21833","version":3},"attestation_state":"computed","paper":{"title":"Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall","submitted_at":"2024-10-29T07:56:38Z","abstract_excerpt":"We construct classical algorithms computing an approximation of the ground state energy of an arbitrary $k$-local Hamiltonian acting on $n$ qubits.\n  We first consider the setting where a good ``guiding state'' is available, which is the main setting where quantum algorithms are expected to achieve an exponential speedup over classical methods. We show that a constant approximation (i.e., an approximation with constant relative accuracy) of the ground state energy can be computed classically in $\\mathrm{poly}\\left(1/\\chi,n\\right)$ time and $\\mathrm{poly}(n)$ space, where $\\chi$ denotes the ove"},"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.21833","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-29T07:56:38Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"65b2620ea223d8ffa1f4d50fb4690cc55f3c4f05a9e08827273ce92f62f9c7a8","abstract_canon_sha256":"b1ddcad314403940876fa84c23fade79afa1402ea02ad7f299f9ace3b7ed3be5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:40.825472Z","signature_b64":"H4xrBu9l7VlHFU6bJY+5VUHdmKhZOEk2DSZR9aFMuK/CJeoLM1rWYG0q4x7lCl5gHrDhXnI/S2cbaQnFNiqmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f9af3318a9e4fd4048ccef014b89a422228e247c584bd3cec4485412233df8f","last_reissued_at":"2026-07-05T11:31:40.824944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:40.824944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall","submitted_at":"2024-10-29T07:56:38Z","abstract_excerpt":"We construct classical algorithms computing an approximation of the ground state energy of an arbitrary $k$-local Hamiltonian acting on $n$ qubits.\n  We first consider the setting where a good ``guiding state'' is available, which is the main setting where quantum algorithms are expected to achieve an exponential speedup over classical methods. We show that a constant approximation (i.e., an approximation with constant relative accuracy) of the ground state energy can be computed classically in $\\mathrm{poly}\\left(1/\\chi,n\\right)$ time and $\\mathrm{poly}(n)$ space, where $\\chi$ denotes the ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21833","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/2410.21833/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.21833","created_at":"2026-07-05T11:31:40.825004+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.21833v3","created_at":"2026-07-05T11:31:40.825004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21833","created_at":"2026-07-05T11:31:40.825004+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6NPGMMKTZH5","created_at":"2026-07-05T11:31:40.825004+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6NPGMMKTZH5IBEM","created_at":"2026-07-05T11:31:40.825004+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6NPGMMK","created_at":"2026-07-05T11:31:40.825004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27886","citing_title":"The power of unentanglement without destructive interference","ref_index":72,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II","json":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II.json","graph_json":"https://pith.science/api/pith-number/H6NPGMMKTZH5IBEMZ3YBJOE2II/graph.json","events_json":"https://pith.science/api/pith-number/H6NPGMMKTZH5IBEMZ3YBJOE2II/events.json","paper":"https://pith.science/paper/H6NPGMMK"},"agent_actions":{"view_html":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II","download_json":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II.json","view_paper":"https://pith.science/paper/H6NPGMMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.21833&json=true","fetch_graph":"https://pith.science/api/pith-number/H6NPGMMKTZH5IBEMZ3YBJOE2II/graph.json","fetch_events":"https://pith.science/api/pith-number/H6NPGMMKTZH5IBEMZ3YBJOE2II/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II/action/storage_attestation","attest_author":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II/action/author_attestation","sign_citation":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II/action/citation_signature","submit_replication":"https://pith.science/pith/H6NPGMMKTZH5IBEMZ3YBJOE2II/action/replication_record"}},"created_at":"2026-07-05T11:31:40.825004+00:00","updated_at":"2026-07-05T11:31:40.825004+00:00"}