{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YSGCDWAHMZCJUOW3NAFLB6IFXQ","short_pith_number":"pith:YSGCDWAH","schema_version":"1.0","canonical_sha256":"c48c21d80766449a3adb680ab0f905bc1c8310987c785ffbcde6ec6f09b084d8","source":{"kind":"arxiv","id":"2411.02681","version":2},"attestation_state":"computed","paper":{"title":"Towards a universal gateset for $\\mathsf{QMA}_1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Dorian Rudolph","submitted_at":"2024-11-04T23:39:27Z","abstract_excerpt":"$\\mathsf{QMA}_1$ is $\\mathsf{QMA}$ with perfect completeness, i.e., the prover must accept with a probability of exactly $1$ in the YES-case. Whether $\\mathsf{QMA}_1$ and $\\mathsf{QMA}$ are equal is still a major open problem. It is not even known whether $\\mathsf{QMA}_1$ has a universal gateset; Solovay-Kitaev does not apply due to perfect completeness. Hence, we do not generally know whether $\\mathsf{QMA}_1^G=\\mathsf{QMA}_1^{G'}$ (superscript denoting gateset), given two universal gatesets $G,G'$. In this paper, we make progress towards the gateset question by proving that for all $k\\in\\math"},"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":"2411.02681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-04T23:39:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2550c5f209f486f4287c6b07cc462e33cac06897de458241d5e9e42aeed161dc","abstract_canon_sha256":"cc117ac0a0ae4c67e2b1361d3f48521103f177750a15f8a364237424cb035c07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:32.896978Z","signature_b64":"UkedWqAmZMsH737MHcQWkaQI0Ucnho1hSQ1rCZ9VVW4ffd4hwUHuwUGmR1a8kMHTxwdvlKfYVp8vgBsTpX0CDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c48c21d80766449a3adb680ab0f905bc1c8310987c785ffbcde6ec6f09b084d8","last_reissued_at":"2026-07-05T10:47:32.896528Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:32.896528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a universal gateset for $\\mathsf{QMA}_1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Dorian Rudolph","submitted_at":"2024-11-04T23:39:27Z","abstract_excerpt":"$\\mathsf{QMA}_1$ is $\\mathsf{QMA}$ with perfect completeness, i.e., the prover must accept with a probability of exactly $1$ in the YES-case. Whether $\\mathsf{QMA}_1$ and $\\mathsf{QMA}$ are equal is still a major open problem. It is not even known whether $\\mathsf{QMA}_1$ has a universal gateset; Solovay-Kitaev does not apply due to perfect completeness. Hence, we do not generally know whether $\\mathsf{QMA}_1^G=\\mathsf{QMA}_1^{G'}$ (superscript denoting gateset), given two universal gatesets $G,G'$. In this paper, we make progress towards the gateset question by proving that for all $k\\in\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02681","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/2411.02681/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":"2411.02681","created_at":"2026-07-05T10:47:32.896584+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02681v2","created_at":"2026-07-05T10:47:32.896584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02681","created_at":"2026-07-05T10:47:32.896584+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSGCDWAHMZCJ","created_at":"2026-07-05T10:47:32.896584+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSGCDWAHMZCJUOW3","created_at":"2026-07-05T10:47:32.896584+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSGCDWAH","created_at":"2026-07-05T10:47:32.896584+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.01432","citing_title":"New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2509.25821","citing_title":"On the Complexity of the Succinct State Local Hamiltonian Problem","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ","json":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ.json","graph_json":"https://pith.science/api/pith-number/YSGCDWAHMZCJUOW3NAFLB6IFXQ/graph.json","events_json":"https://pith.science/api/pith-number/YSGCDWAHMZCJUOW3NAFLB6IFXQ/events.json","paper":"https://pith.science/paper/YSGCDWAH"},"agent_actions":{"view_html":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ","download_json":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ.json","view_paper":"https://pith.science/paper/YSGCDWAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02681&json=true","fetch_graph":"https://pith.science/api/pith-number/YSGCDWAHMZCJUOW3NAFLB6IFXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YSGCDWAHMZCJUOW3NAFLB6IFXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ/action/storage_attestation","attest_author":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ/action/author_attestation","sign_citation":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ/action/citation_signature","submit_replication":"https://pith.science/pith/YSGCDWAHMZCJUOW3NAFLB6IFXQ/action/replication_record"}},"created_at":"2026-07-05T10:47:32.896584+00:00","updated_at":"2026-07-05T10:47:32.896584+00:00"}