{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PDSR3T2KEAAS3LJ4P6RBZ7WRB5","short_pith_number":"pith:PDSR3T2K","schema_version":"1.0","canonical_sha256":"78e51dcf4a20012dad3c7fa21cfed10f7050d9ebd90f50292d072513c7ef6bec","source":{"kind":"arxiv","id":"1703.08118","version":1},"attestation_state":"computed","paper":{"title":"Non-Unitary Quantum Computation in the Ground Space of Local Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan E. Browne, Matty J. Hoban, Na\\\"iri Usher","submitted_at":"2017-03-23T15:55:25Z","abstract_excerpt":"A central result in the study of Quantum Hamiltonian Complexity is that the k-Local hamiltonian problem is QMA-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above another, promised one of these is true. Given the ground state of the Hamiltonian, a quantum computer can determine this question, even if the ground state itself may not be efficiently quantum preparable. Kitaev's proof of QMA-completeness encodes a unitary quantum circuit in QMA into the ground space of a Hamiltonian. However, we now have quantum computing models"},"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":"1703.08118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-23T15:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"7283a8b619d3f56e8d12916fe39345db8921d1eefb291ee2cee59b6b911e4604","abstract_canon_sha256":"723847d61e6f0f41607bffc263b4875e7040c4ef5db56098019232478d207848"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:51.584167Z","signature_b64":"2Zl3YJ2pNN/AANckGvnIM1di0s36hC1N8K5JaNAfrasJ8w/eawuDkLiCqNYVBiRf7TDITxf1LHjkieJ5wVkyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78e51dcf4a20012dad3c7fa21cfed10f7050d9ebd90f50292d072513c7ef6bec","last_reissued_at":"2026-05-18T00:34:51.583436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:51.583436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Unitary Quantum Computation in the Ground Space of Local Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan E. Browne, Matty J. Hoban, Na\\\"iri Usher","submitted_at":"2017-03-23T15:55:25Z","abstract_excerpt":"A central result in the study of Quantum Hamiltonian Complexity is that the k-Local hamiltonian problem is QMA-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above another, promised one of these is true. Given the ground state of the Hamiltonian, a quantum computer can determine this question, even if the ground state itself may not be efficiently quantum preparable. Kitaev's proof of QMA-completeness encodes a unitary quantum circuit in QMA into the ground space of a Hamiltonian. However, we now have quantum computing models"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08118","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":"1703.08118","created_at":"2026-05-18T00:34:51.583556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08118v1","created_at":"2026-05-18T00:34:51.583556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08118","created_at":"2026-05-18T00:34:51.583556+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDSR3T2KEAAS","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDSR3T2KEAAS3LJ4","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDSR3T2K","created_at":"2026-05-18T12:31:37.085036+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/PDSR3T2KEAAS3LJ4P6RBZ7WRB5","json":"https://pith.science/pith/PDSR3T2KEAAS3LJ4P6RBZ7WRB5.json","graph_json":"https://pith.science/api/pith-number/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/graph.json","events_json":"https://pith.science/api/pith-number/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/events.json","paper":"https://pith.science/paper/PDSR3T2K"},"agent_actions":{"view_html":"https://pith.science/pith/PDSR3T2KEAAS3LJ4P6RBZ7WRB5","download_json":"https://pith.science/pith/PDSR3T2KEAAS3LJ4P6RBZ7WRB5.json","view_paper":"https://pith.science/paper/PDSR3T2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08118&json=true","fetch_graph":"https://pith.science/api/pith-number/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/graph.json","fetch_events":"https://pith.science/api/pith-number/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/action/storage_attestation","attest_author":"https://pith.science/pith/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/action/author_attestation","sign_citation":"https://pith.science/pith/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/action/citation_signature","submit_replication":"https://pith.science/pith/PDSR3T2KEAAS3LJ4P6RBZ7WRB5/action/replication_record"}},"created_at":"2026-05-18T00:34:51.583556+00:00","updated_at":"2026-05-18T00:34:51.583556+00:00"}