{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ULL6FADINTW6WPKLM3G55URISL","short_pith_number":"pith:ULL6FADI","schema_version":"1.0","canonical_sha256":"a2d7e280686cedeb3d4b66cdded22892dd35fb85e69aa3c2c4fe8f8485aed501","source":{"kind":"arxiv","id":"1602.04145","version":1},"attestation_state":"computed","paper":{"title":"Complexity classification of two-qubit commuting hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Adam Bouland, Laura Man\\v{c}inska, Xue Zhang","submitted_at":"2016-02-12T18:17:26Z","abstract_excerpt":"We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubits, starting in a computational basis state. We prove a dichotomy theorem: either this model is efficiently classically simulable or it allows one to sample from probability distributions which cannot be sampled from classically unless the polynomial hierarchy collapses. Furthermore, the only simulable Hamiltonians are those which fail to generate entanglement. This shows that generic two-qubit commuting Hamiltonians"},"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":"1602.04145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-12T18:17:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"deafbb582dd15ec462af9894dc12f4d1953124f68f6bf8fa886779cfb1b49f0d","abstract_canon_sha256":"ca7790e27f4f397379613bb53d71efc76eb6b5bddf8555cbaefa0b5b202a21cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:54.442401Z","signature_b64":"Db+UHpDkNmOCCqPeW6ipEB7IYNUsh6MZSU5E/3TS5woWkH8PoEtStrNxqQ78tYfuPjSrI3Hq66cCQP2+rbj6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2d7e280686cedeb3d4b66cdded22892dd35fb85e69aa3c2c4fe8f8485aed501","last_reissued_at":"2026-05-18T01:20:54.441724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:54.441724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity classification of two-qubit commuting hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Adam Bouland, Laura Man\\v{c}inska, Xue Zhang","submitted_at":"2016-02-12T18:17:26Z","abstract_excerpt":"We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubits, starting in a computational basis state. We prove a dichotomy theorem: either this model is efficiently classically simulable or it allows one to sample from probability distributions which cannot be sampled from classically unless the polynomial hierarchy collapses. Furthermore, the only simulable Hamiltonians are those which fail to generate entanglement. This shows that generic two-qubit commuting Hamiltonians"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04145","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":""},"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":"1602.04145","created_at":"2026-05-18T01:20:54.441813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04145v1","created_at":"2026-05-18T01:20:54.441813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04145","created_at":"2026-05-18T01:20:54.441813+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULL6FADINTW6","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULL6FADINTW6WPKL","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULL6FADI","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18448","citing_title":"Kernel-Preserving Dynamics and Symmetry Classification for Synchronization Subspaces","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL","json":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL.json","graph_json":"https://pith.science/api/pith-number/ULL6FADINTW6WPKLM3G55URISL/graph.json","events_json":"https://pith.science/api/pith-number/ULL6FADINTW6WPKLM3G55URISL/events.json","paper":"https://pith.science/paper/ULL6FADI"},"agent_actions":{"view_html":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL","download_json":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL.json","view_paper":"https://pith.science/paper/ULL6FADI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04145&json=true","fetch_graph":"https://pith.science/api/pith-number/ULL6FADINTW6WPKLM3G55URISL/graph.json","fetch_events":"https://pith.science/api/pith-number/ULL6FADINTW6WPKLM3G55URISL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL/action/storage_attestation","attest_author":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL/action/author_attestation","sign_citation":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL/action/citation_signature","submit_replication":"https://pith.science/pith/ULL6FADINTW6WPKLM3G55URISL/action/replication_record"}},"created_at":"2026-05-18T01:20:54.441813+00:00","updated_at":"2026-05-18T01:20:54.441813+00:00"}