{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6RWVB5JK5632YW5R6L3BKNOFCJ","short_pith_number":"pith:6RWVB5JK","schema_version":"1.0","canonical_sha256":"f46d50f52aefb7ac5bb1f2f61535c5125a408e360f47d41d4d9cb627dc054047","source":{"kind":"arxiv","id":"2101.08381","version":3},"attestation_state":"computed","paper":{"title":"Quantum Constraint Problems can be complete for $\\mathsf{BQP}$, $\\mathsf{QCMA}$, and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Alex Meiburg","submitted_at":"2021-01-21T01:08:04Z","abstract_excerpt":"A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems can be in P, NP-complete, MA-complete, or QMA_1-complete, but this list has not been shown to be exhaustive. We present three quantum constraint problems, that are (1) BQP_1-complete (also known as coRQP), (2) QCMA_1-complete and (3) coRP-complete. This provides the first natural complete problem for BQP_1. We also show that all quantum constraint problems can"},"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":"2101.08381","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-01-21T01:08:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"40af327792a030fe8e9ad808c109e9012d2f7340fe2bee638eb9009310118889","abstract_canon_sha256":"1ace4b9f1566da5123c9a458c56cb8cf5e62c0be506a842bbcecaa144b59a3d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:59:36.227437Z","signature_b64":"x3V/jx6pN6J0/U3UoUlfz9E4eC2mSIJwshwbEE3Iiwcc1aYHXTheLH2eQ75Mcz27KUM4owxrBRujqHyZJ9TZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f46d50f52aefb7ac5bb1f2f61535c5125a408e360f47d41d4d9cb627dc054047","last_reissued_at":"2026-07-05T02:59:36.227061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:59:36.227061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Constraint Problems can be complete for $\\mathsf{BQP}$, $\\mathsf{QCMA}$, and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Alex Meiburg","submitted_at":"2021-01-21T01:08:04Z","abstract_excerpt":"A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems can be in P, NP-complete, MA-complete, or QMA_1-complete, but this list has not been shown to be exhaustive. We present three quantum constraint problems, that are (1) BQP_1-complete (also known as coRQP), (2) QCMA_1-complete and (3) coRP-complete. This provides the first natural complete problem for BQP_1. We also show that all quantum constraint problems can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.08381","kind":"arxiv","version":3},"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/2101.08381/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":"2101.08381","created_at":"2026-07-05T02:59:36.227115+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.08381v3","created_at":"2026-07-05T02:59:36.227115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.08381","created_at":"2026-07-05T02:59:36.227115+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RWVB5JK5632","created_at":"2026-07-05T02:59:36.227115+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RWVB5JK5632YW5R","created_at":"2026-07-05T02:59:36.227115+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RWVB5JK","created_at":"2026-07-05T02:59:36.227115+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07244","citing_title":"Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ","json":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ.json","graph_json":"https://pith.science/api/pith-number/6RWVB5JK5632YW5R6L3BKNOFCJ/graph.json","events_json":"https://pith.science/api/pith-number/6RWVB5JK5632YW5R6L3BKNOFCJ/events.json","paper":"https://pith.science/paper/6RWVB5JK"},"agent_actions":{"view_html":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ","download_json":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ.json","view_paper":"https://pith.science/paper/6RWVB5JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.08381&json=true","fetch_graph":"https://pith.science/api/pith-number/6RWVB5JK5632YW5R6L3BKNOFCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6RWVB5JK5632YW5R6L3BKNOFCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ/action/storage_attestation","attest_author":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ/action/author_attestation","sign_citation":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ/action/citation_signature","submit_replication":"https://pith.science/pith/6RWVB5JK5632YW5R6L3BKNOFCJ/action/replication_record"}},"created_at":"2026-07-05T02:59:36.227115+00:00","updated_at":"2026-07-05T02:59:36.227115+00:00"}