{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WDHCA7EFZLIEOEB5LLMLQ5HAKY","short_pith_number":"pith:WDHCA7EF","schema_version":"1.0","canonical_sha256":"b0ce207c85cad047103d5ad8b874e0562df21be5eefb43f7c796c9e5eab33e3d","source":{"kind":"arxiv","id":"1906.08800","version":2},"attestation_state":"computed","paper":{"title":"Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara Terhal, Itay Hen, Joel Klassen, Marios Ioannou, Milad Marvian, Stephen Piddock","submitted_at":"2019-06-20T18:26:35Z","abstract_excerpt":"We examine the problem of determining whether a multi-qubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamiltonian contains one-local terms, then this task can be NP-hard. This is shown by constructing a class of Hamiltonians for which performing this task is equivalent to deciding $3$-SAT. In contrast, we show that when such a Hamiltonian contains no one-local terms then this task is easy, namely we present an algorithm which decides, in a number of arithmetic operations over $\\mathbb{R}$ which is polynomial in the number of"},"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":"1906.08800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-20T18:26:35Z","cross_cats_sorted":[],"title_canon_sha256":"78daec6851bfc6e614bab50aa84bbdbe9a539e953cc93f5495078e6b2ffc8dbf","abstract_canon_sha256":"484d54f3c550fec0fd69336e66c18162966ab05d8ddb44bec02b9ea29418a0c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:46.547130Z","signature_b64":"jYmXL4UCPJiDtzONwLv2O3Hmny/O3TO7jYFCNLLe7AEcw0561xKBbetLFYbXjqsIfqtObIy+snt3JSO9TLUeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0ce207c85cad047103d5ad8b874e0562df21be5eefb43f7c796c9e5eab33e3d","last_reissued_at":"2026-07-05T00:52:46.546667Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:46.546667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara Terhal, Itay Hen, Joel Klassen, Marios Ioannou, Milad Marvian, Stephen Piddock","submitted_at":"2019-06-20T18:26:35Z","abstract_excerpt":"We examine the problem of determining whether a multi-qubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamiltonian contains one-local terms, then this task can be NP-hard. This is shown by constructing a class of Hamiltonians for which performing this task is equivalent to deciding $3$-SAT. In contrast, we show that when such a Hamiltonian contains no one-local terms then this task is easy, namely we present an algorithm which decides, in a number of arithmetic operations over $\\mathbb{R}$ which is polynomial in the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08800","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/1906.08800/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":"1906.08800","created_at":"2026-07-05T00:52:46.546730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08800v2","created_at":"2026-07-05T00:52:46.546730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08800","created_at":"2026-07-05T00:52:46.546730+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDHCA7EFZLIE","created_at":"2026-07-05T00:52:46.546730+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDHCA7EFZLIEOEB5","created_at":"2026-07-05T00:52:46.546730+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDHCA7EF","created_at":"2026-07-05T00:52:46.546730+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY","json":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY.json","graph_json":"https://pith.science/api/pith-number/WDHCA7EFZLIEOEB5LLMLQ5HAKY/graph.json","events_json":"https://pith.science/api/pith-number/WDHCA7EFZLIEOEB5LLMLQ5HAKY/events.json","paper":"https://pith.science/paper/WDHCA7EF"},"agent_actions":{"view_html":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY","download_json":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY.json","view_paper":"https://pith.science/paper/WDHCA7EF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08800&json=true","fetch_graph":"https://pith.science/api/pith-number/WDHCA7EFZLIEOEB5LLMLQ5HAKY/graph.json","fetch_events":"https://pith.science/api/pith-number/WDHCA7EFZLIEOEB5LLMLQ5HAKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY/action/storage_attestation","attest_author":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY/action/author_attestation","sign_citation":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY/action/citation_signature","submit_replication":"https://pith.science/pith/WDHCA7EFZLIEOEB5LLMLQ5HAKY/action/replication_record"}},"created_at":"2026-07-05T00:52:46.546730+00:00","updated_at":"2026-07-05T00:52:46.546730+00:00"}