{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MSEXKPFYKIV3AFC3TIHAJMWNWY","short_pith_number":"pith:MSEXKPFY","schema_version":"1.0","canonical_sha256":"6489753cb8522bb0145b9a0e04b2cdb6263b416027f3c2ee691fd80c6ebb07c2","source":{"kind":"arxiv","id":"2504.06433","version":1},"attestation_state":"computed","paper":{"title":"Tight bounds on depth-2 QAC-circuits computing parity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Daniel Grier, Daniel Pad\\'e, Stephen Fenner, Thomas Thierauf","submitted_at":"2025-04-08T21:05:39Z","abstract_excerpt":"We show that the parity of more than three non-target input bits cannot be computed by QAC-circuits of depth-2, not even uncleanly, regardless of the number of ancilla qubits. This result is incomparable with other recent lower bounds on constant-depth QAC-circuits by Rosenthal [ICTS~2021,arXiv:2008.07470] and uses different techniques which may be of independent interest:\n  1. We show that all members of a certain class of multivariate polynomials are irreducible. The proof applies a technique of Shpilka & Volkovich [STOC 2008]. 2. We give a tight-in-some-sense characterization of when a mult"},"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":"2504.06433","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-08T21:05:39Z","cross_cats_sorted":["cs.CC","math-ph","math.MP"],"title_canon_sha256":"4ffea82bec22b9ecc8028044134537ceefb7a11a93c37b61c6140d119acb62dc","abstract_canon_sha256":"873ca0adb3feae0b564b31d2cae7d7ad967a61efc7acac4a8db08da3a3b22572"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:26.736370Z","signature_b64":"Bc+EHtqEwFxQ7W5d1DqZ3FSa4/pj7IJaE3UggFYirCLVT9FCCHInHbkbGH2Ny94n+yMOM7euylzwVHv4wtnkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6489753cb8522bb0145b9a0e04b2cdb6263b416027f3c2ee691fd80c6ebb07c2","last_reissued_at":"2026-07-05T10:46:26.735880Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:26.735880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight bounds on depth-2 QAC-circuits computing parity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Daniel Grier, Daniel Pad\\'e, Stephen Fenner, Thomas Thierauf","submitted_at":"2025-04-08T21:05:39Z","abstract_excerpt":"We show that the parity of more than three non-target input bits cannot be computed by QAC-circuits of depth-2, not even uncleanly, regardless of the number of ancilla qubits. This result is incomparable with other recent lower bounds on constant-depth QAC-circuits by Rosenthal [ICTS~2021,arXiv:2008.07470] and uses different techniques which may be of independent interest:\n  1. We show that all members of a certain class of multivariate polynomials are irreducible. The proof applies a technique of Shpilka & Volkovich [STOC 2008]. 2. We give a tight-in-some-sense characterization of when a mult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06433","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.06433/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":"2504.06433","created_at":"2026-07-05T10:46:26.735937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.06433v1","created_at":"2026-07-05T10:46:26.735937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06433","created_at":"2026-07-05T10:46:26.735937+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSEXKPFYKIV3","created_at":"2026-07-05T10:46:26.735937+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSEXKPFYKIV3AFC3","created_at":"2026-07-05T10:46:26.735937+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSEXKPFY","created_at":"2026-07-05T10:46:26.735937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26180","citing_title":"Evergreen: Efficient Claim Verification for Semantic Aggregates","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07178","citing_title":"On the Computational Complexity of Geometrically Local QAC0 circuits","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26179","citing_title":"Hard-to-Sample Distributions from Robust Extractors","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY","json":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY.json","graph_json":"https://pith.science/api/pith-number/MSEXKPFYKIV3AFC3TIHAJMWNWY/graph.json","events_json":"https://pith.science/api/pith-number/MSEXKPFYKIV3AFC3TIHAJMWNWY/events.json","paper":"https://pith.science/paper/MSEXKPFY"},"agent_actions":{"view_html":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY","download_json":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY.json","view_paper":"https://pith.science/paper/MSEXKPFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.06433&json=true","fetch_graph":"https://pith.science/api/pith-number/MSEXKPFYKIV3AFC3TIHAJMWNWY/graph.json","fetch_events":"https://pith.science/api/pith-number/MSEXKPFYKIV3AFC3TIHAJMWNWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY/action/storage_attestation","attest_author":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY/action/author_attestation","sign_citation":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY/action/citation_signature","submit_replication":"https://pith.science/pith/MSEXKPFYKIV3AFC3TIHAJMWNWY/action/replication_record"}},"created_at":"2026-07-05T10:46:26.735937+00:00","updated_at":"2026-07-05T10:46:26.735937+00:00"}