{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:DY357IC4ZUN3WARU4E7N4KVTJK","short_pith_number":"pith:DY357IC4","schema_version":"1.0","canonical_sha256":"1e37dfa05ccd1bbb0234e13ede2ab34a8c41389175473ba6d5ed4be3af6b2468","source":{"kind":"arxiv","id":"quant-ph/0106017","version":1},"attestation_state":"computed","paper":{"title":"Counting, Fanout, and the Complexity of Quantum ACC","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher Pollett, Cristopher Moore, Frederic Green, Steven Homer","submitted_at":"2001-06-04T20:45:31Z","abstract_excerpt":"We propose definitions of $\\QAC^0$, the quantum analog of the classical class $\\AC^0$ of constant-depth circuits with AND and OR gates of arbitrary fan-in, and $\\QACC[q]$, the analog of the class $\\ACC[q]$ where $\\Mod_q$ gates are also allowed. We prove that parity or fanout allows us to construct quantum $\\MOD_q$ gates in constant depth for any $q$, so $\\QACC[2] = \\QACC$. More generally, we show that for any $q,p > 1$, $\\MOD_q$ is equivalent to $\\MOD_p$ (up to constant depth). This implies that $\\QAC^0$ with unbounded fanout gates, denoted $\\QACwf^0$, is the same as $\\QACC[q]$ and $\\QACC$ for"},"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":"quant-ph/0106017","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-06-04T20:45:31Z","cross_cats_sorted":[],"title_canon_sha256":"9953460e72e6cc21dbb3dcc7a598b0a74457ebff870152359d1906b286e59890","abstract_canon_sha256":"9ecb19906a7d514312bbb0a52febf0ad8ae09828b893489a5edf1d25734332eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:04.964598Z","signature_b64":"/5eGW/UNIVS/QawpJ8PTjl72dmNZNerQZvyqgJRue4vjVQYkEAopbnvOCJJ6zwSItCcI8ZSkr6Y62hkGJxVUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e37dfa05ccd1bbb0234e13ede2ab34a8c41389175473ba6d5ed4be3af6b2468","last_reissued_at":"2026-05-18T01:05:04.963942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:04.963942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting, Fanout, and the Complexity of Quantum ACC","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher Pollett, Cristopher Moore, Frederic Green, Steven Homer","submitted_at":"2001-06-04T20:45:31Z","abstract_excerpt":"We propose definitions of $\\QAC^0$, the quantum analog of the classical class $\\AC^0$ of constant-depth circuits with AND and OR gates of arbitrary fan-in, and $\\QACC[q]$, the analog of the class $\\ACC[q]$ where $\\Mod_q$ gates are also allowed. We prove that parity or fanout allows us to construct quantum $\\MOD_q$ gates in constant depth for any $q$, so $\\QACC[2] = \\QACC$. More generally, we show that for any $q,p > 1$, $\\MOD_q$ is equivalent to $\\MOD_p$ (up to constant depth). This implies that $\\QAC^0$ with unbounded fanout gates, denoted $\\QACwf^0$, is the same as $\\QACC[q]$ and $\\QACC$ for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0106017","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":"quant-ph/0106017","created_at":"2026-05-18T01:05:04.964037+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0106017v1","created_at":"2026-05-18T01:05:04.964037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0106017","created_at":"2026-05-18T01:05:04.964037+00:00"},{"alias_kind":"pith_short_12","alias_value":"DY357IC4ZUN3","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"DY357IC4ZUN3WARU","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"DY357IC4","created_at":"2026-05-18T12:25:50.254431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2111.07992","citing_title":"Query and Depth Upper Bounds for Quantum Unitaries via Grover Search","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK","json":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK.json","graph_json":"https://pith.science/api/pith-number/DY357IC4ZUN3WARU4E7N4KVTJK/graph.json","events_json":"https://pith.science/api/pith-number/DY357IC4ZUN3WARU4E7N4KVTJK/events.json","paper":"https://pith.science/paper/DY357IC4"},"agent_actions":{"view_html":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK","download_json":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK.json","view_paper":"https://pith.science/paper/DY357IC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0106017&json=true","fetch_graph":"https://pith.science/api/pith-number/DY357IC4ZUN3WARU4E7N4KVTJK/graph.json","fetch_events":"https://pith.science/api/pith-number/DY357IC4ZUN3WARU4E7N4KVTJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK/action/storage_attestation","attest_author":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK/action/author_attestation","sign_citation":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK/action/citation_signature","submit_replication":"https://pith.science/pith/DY357IC4ZUN3WARU4E7N4KVTJK/action/replication_record"}},"created_at":"2026-05-18T01:05:04.964037+00:00","updated_at":"2026-05-18T01:05:04.964037+00:00"}