{"record":{"author":{"account_ref":null,"orcid":null},"builds_on":[],"content_schema":"pubphys.content.topic/1","content_sha256":"1c271f7d485587ec5325a30ec890247c7457c8f7fe22102f63aa6b6f939567ac","created":"2026-10-03T07:17:52Z","files":[],"origin":{"assisted_by":[],"kind":"seed"},"parents":[],"salt":"9e0c1b52b7c9fd737920f8f27ba68dc42017b83c29b5bcd7242c2310faa0166f","schema":"pubphys.record/2","site":"pubphys.com","target":null,"type":"topic"},"content":{"external_id":"qi.hamiltonian-complexity","field":"qi","n":"1","review_cite":"D. Aharonov, I. Arad and T. Vidick, The Quantum PCP Conjecture, SIGACT News (arXiv), 2013","review_link":"https://arxiv.org/abs/1309.7495","review_verified":"true","summary":"Finding the lowest energy of a system of many interacting quantum parts is, in the worst case, hard even for a quantum computer. The quantum PCP question asks whether even a rough estimate stays hard, and related questions ask how complex low-energy states must be.","title":"Quantum PCP and Hamiltonian complexity","topic_ref":null,"why":"It ties the limits of quantum computing to the structure of entanglement in physical ground states."},"attested":{"attestation":{"batch":null,"client_id":null,"id_token_sha256":null,"kind":"platform"},"record_hash":"14e3082cf422607e299e3fd37b22598ee6075130731880be56919fb2cecab4a9","schema":"pubphys.attested/1"},"envelope":{"attested_hash":"5e1dfb562f6fd93bfe7a70cc6eee77741f626697bd51ada1b9a814448a50ce8c","platform_signature":{"key_id":"c6afc19b31429869751f06879c75cd64ea92654423d15b44be775bf1310a60da","sig":"mDVGv4oRGpPtr27RLoGo5SkZPOybimCVYwhA1Vi5xRpRo7FXgUdOQNA1ZDIFUuVjSMvXzKYp5qY5dgJHhCj4DQ"},"schema":"pubphys.envelope/1"},"record_hash":"14e3082cf422607e299e3fd37b22598ee6075130731880be56919fb2cecab4a9","leaf_index":335}