{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:VYNMPUKMDGOQF4ZPPU4IPC7IBA","short_pith_number":"pith:VYNMPUKM","schema_version":"1.0","canonical_sha256":"ae1ac7d14c199d02f32f7d38878be8082c2a3ccee2d8d551629ca712afe5ca6b","source":{"kind":"arxiv","id":"quant-ph/0406180","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of the Local Hamiltonian Problem","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Alexei Kitaev, Julia Kempe, Oded Regev","submitted_at":"2004-06-24T19:23:16Z","abstract_excerpt":"The k-local Hamiltonian problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NP-complete for k<=2. It was known that the problem is QMA-complete for any k <= 3. On the other hand 1-local Hamiltonian is in P, and hence not believed to be QMA-complete. The complexity of the 2-local Hamiltonian problem has long been outstanding. Here we settle the question and show that it is QMA-complete. We provide two independent proofs; our first proof uses only elementary linear algebra. Our second proof uses a powerful t"},"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":"quant-ph/0406180","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-06-24T19:23:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7e4d6cebd26e87999977bc5acfdb872914797df9b569c0732ac7ec3d81546155","abstract_canon_sha256":"6765d632966958efb87f2c4e32eb27d963729ec2366c97bf664d01996cd25d97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:48:38.789533Z","signature_b64":"BCtuKDMtuWuTgi+drLgsFcpXds8f/QUpC9pqmOv2MM2r9jajLS2aKusVz/k8bvomCMmM9vs/ISK1DPYqON+bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae1ac7d14c199d02f32f7d38878be8082c2a3ccee2d8d551629ca712afe5ca6b","last_reissued_at":"2026-07-04T14:48:38.789185Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:48:38.789185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of the Local Hamiltonian Problem","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Alexei Kitaev, Julia Kempe, Oded Regev","submitted_at":"2004-06-24T19:23:16Z","abstract_excerpt":"The k-local Hamiltonian problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NP-complete for k<=2. It was known that the problem is QMA-complete for any k <= 3. On the other hand 1-local Hamiltonian is in P, and hence not believed to be QMA-complete. The complexity of the 2-local Hamiltonian problem has long been outstanding. Here we settle the question and show that it is QMA-complete. We provide two independent proofs; our first proof uses only elementary linear algebra. Our second proof uses a powerful t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0406180","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/quant-ph/0406180/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":"quant-ph/0406180","created_at":"2026-07-04T14:48:38.789240+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0406180v2","created_at":"2026-07-04T14:48:38.789240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0406180","created_at":"2026-07-04T14:48:38.789240+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYNMPUKMDGOQ","created_at":"2026-07-04T14:48:38.789240+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYNMPUKMDGOQF4ZP","created_at":"2026-07-04T14:48:38.789240+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYNMPUKM","created_at":"2026-07-04T14:48:38.789240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.04940","citing_title":"Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2509.25821","citing_title":"On the Complexity of the Succinct State Local Hamiltonian Problem","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2509.25829","citing_title":"The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00979","citing_title":"Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA","json":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA.json","graph_json":"https://pith.science/api/pith-number/VYNMPUKMDGOQF4ZPPU4IPC7IBA/graph.json","events_json":"https://pith.science/api/pith-number/VYNMPUKMDGOQF4ZPPU4IPC7IBA/events.json","paper":"https://pith.science/paper/VYNMPUKM"},"agent_actions":{"view_html":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA","download_json":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA.json","view_paper":"https://pith.science/paper/VYNMPUKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0406180&json=true","fetch_graph":"https://pith.science/api/pith-number/VYNMPUKMDGOQF4ZPPU4IPC7IBA/graph.json","fetch_events":"https://pith.science/api/pith-number/VYNMPUKMDGOQF4ZPPU4IPC7IBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA/action/storage_attestation","attest_author":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA/action/author_attestation","sign_citation":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA/action/citation_signature","submit_replication":"https://pith.science/pith/VYNMPUKMDGOQF4ZPPU4IPC7IBA/action/replication_record"}},"created_at":"2026-07-04T14:48:38.789240+00:00","updated_at":"2026-07-04T14:48:38.789240+00:00"}