{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J5GH32WVTU4MW4GUI5O4XSJHWL","short_pith_number":"pith:J5GH32WV","schema_version":"1.0","canonical_sha256":"4f4c7dead59d38cb70d4475dcbc927b2c4aad0986820cb71c97a74e876b09abe","source":{"kind":"arxiv","id":"1603.06985","version":1},"attestation_state":"computed","paper":{"title":"A Quantum Version of Sch\\\"oning's Algorithm Applied to Quantum 2-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Edward Farhi, Kristan Temme, Shelby Kimmel","submitted_at":"2016-03-22T21:14:37Z","abstract_excerpt":"We study a quantum algorithm that consists of a simple quantum Markov process, and we analyze its behavior on restricted versions of Quantum 2-SAT. We prove that the algorithm solves this decision problem with high probability for n qubits, L clauses, and promise gap c in time O(n^2 L^2 c^{-2}). If the Hamiltonian is additionally polynomially gapped, our algorithm efficiently produces a state that has high overlap with the satisfying subspace. The Markov process we study is a quantum analogue of Sch\\\"oning's probabilistic algorithm for k-SAT."},"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":"1603.06985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-22T21:14:37Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"8dd21950bf1963d680543628fa0cda2dbaa8e334e3d81d9c4ed6aee48a3766e3","abstract_canon_sha256":"f7927df3e5bf6d92895145e8307b5a3d65d1d153ea415784dbc398c1a092a417"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:24.750206Z","signature_b64":"IzCx5DcuTMsEGmTj+Kypt7vpN/MwWO3sgd2x7ifitB2gxrsezZwXTj/9bT96itIQ54DoEZMs6k3U/Is5sL0VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f4c7dead59d38cb70d4475dcbc927b2c4aad0986820cb71c97a74e876b09abe","last_reissued_at":"2026-05-18T01:18:24.749406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:24.749406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Version of Sch\\\"oning's Algorithm Applied to Quantum 2-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Edward Farhi, Kristan Temme, Shelby Kimmel","submitted_at":"2016-03-22T21:14:37Z","abstract_excerpt":"We study a quantum algorithm that consists of a simple quantum Markov process, and we analyze its behavior on restricted versions of Quantum 2-SAT. We prove that the algorithm solves this decision problem with high probability for n qubits, L clauses, and promise gap c in time O(n^2 L^2 c^{-2}). If the Hamiltonian is additionally polynomially gapped, our algorithm efficiently produces a state that has high overlap with the satisfying subspace. The Markov process we study is a quantum analogue of Sch\\\"oning's probabilistic algorithm for k-SAT."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06985","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":"1603.06985","created_at":"2026-05-18T01:18:24.749518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06985v1","created_at":"2026-05-18T01:18:24.749518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06985","created_at":"2026-05-18T01:18:24.749518+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5GH32WVTU4M","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5GH32WVTU4MW4GU","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5GH32WV","created_at":"2026-05-18T12:30:22.444734+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/J5GH32WVTU4MW4GUI5O4XSJHWL","json":"https://pith.science/pith/J5GH32WVTU4MW4GUI5O4XSJHWL.json","graph_json":"https://pith.science/api/pith-number/J5GH32WVTU4MW4GUI5O4XSJHWL/graph.json","events_json":"https://pith.science/api/pith-number/J5GH32WVTU4MW4GUI5O4XSJHWL/events.json","paper":"https://pith.science/paper/J5GH32WV"},"agent_actions":{"view_html":"https://pith.science/pith/J5GH32WVTU4MW4GUI5O4XSJHWL","download_json":"https://pith.science/pith/J5GH32WVTU4MW4GUI5O4XSJHWL.json","view_paper":"https://pith.science/paper/J5GH32WV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06985&json=true","fetch_graph":"https://pith.science/api/pith-number/J5GH32WVTU4MW4GUI5O4XSJHWL/graph.json","fetch_events":"https://pith.science/api/pith-number/J5GH32WVTU4MW4GUI5O4XSJHWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5GH32WVTU4MW4GUI5O4XSJHWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5GH32WVTU4MW4GUI5O4XSJHWL/action/storage_attestation","attest_author":"https://pith.science/pith/J5GH32WVTU4MW4GUI5O4XSJHWL/action/author_attestation","sign_citation":"https://pith.science/pith/J5GH32WVTU4MW4GUI5O4XSJHWL/action/citation_signature","submit_replication":"https://pith.science/pith/J5GH32WVTU4MW4GUI5O4XSJHWL/action/replication_record"}},"created_at":"2026-05-18T01:18:24.749518+00:00","updated_at":"2026-05-18T01:18:24.749518+00:00"}