{"id":"https://openalex.org/W4417474187","doi":"https://doi.org/10.1145/3798129.3800922","title":"Improved Lower Bounds for QAC0","display_name":"Improved Lower Bounds for QAC0","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4417474187","doi":"https://doi.org/10.1145/3798129.3800922"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800922","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800922","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800922","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120848348","display_name":"Malvika Raj Joshi","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Malvika Raj Joshi","raw_affiliation_strings":["University of California, Berkeley, USA"],"raw_orcid":"https://orcid.org/0009-0008-6146-3064","affiliations":[{"raw_affiliation_string":"University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049425955","display_name":"Avishay Tal","orcid":"https://orcid.org/0000-0002-0375-6554"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Avishay Tal","raw_affiliation_strings":["University of California, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0002-0375-6554","affiliations":[{"raw_affiliation_string":"University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120848350","display_name":"Francisca Vasconcelos","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francisca Vasconcelos","raw_affiliation_strings":["University of California, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0003-4758-2944","affiliations":[{"raw_affiliation_string":"University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120848351","display_name":"John Wright","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Wright","raw_affiliation_strings":["University of California, Berkeley, USA"],"raw_orcid":"https://orcid.org/0009-0006-4071-3488","affiliations":[{"raw_affiliation_string":"University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0152522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2199","last_page":"2209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.7332000136375427,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.7332000136375427,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.23330000042915344,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0035000001080334187,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.66839998960495},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6500999927520752},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.6154999732971191},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6100999712944031},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5946999788284302},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5414000153541565},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5058000087738037},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4350000023841858}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7019000053405762},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.66839998960495},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6500999927520752},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.6154999732971191},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6100999712944031},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5946999788284302},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5414000153541565},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5058000087738037},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49300000071525574},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4350000023841858},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4140999913215637},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.41130000352859497},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3898000121116638},{"id":"https://openalex.org/C124148022","wikidata":"https://www.wikidata.org/wiki/Q2122210","display_name":"Quantum circuit","level":5,"score":0.3817000091075897},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.3605000078678131},{"id":"https://openalex.org/C7720571","wikidata":"https://www.wikidata.org/wiki/Q1136880","display_name":"Power of two","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3100000023841858},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26269999146461487},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.26089999079704285}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800922","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800922","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2512.14643","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.14643","pdf_url":"https://arxiv.org/pdf/2512.14643","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2512.14643","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.14643","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800922","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800922","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5458084689","display_name":"CAREER: An Analytical Lens on Quantum Advantage and Pseudorandomness","funder_award_id":"2145474","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5662364344","display_name":null,"funder_award_id":"DE-SC0024124","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7456145480","display_name":null,"funder_award_id":"DE-SC0024124","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G775851081","display_name":null,"funder_award_id":"CCF-2145474","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3],"establish":[4],"the":[5],"strongest":[6],"known":[7],"lower":[8],"bounds":[9],"against":[10],"QAC0,":[11],"while":[12],"allowing":[13],"its":[14],"full":[15],"power":[16],"of":[17,38,65],"polynomially":[18],"many":[19,45],"ancillae":[20],"and":[21,40],"gates.":[22],"Our":[23],"two":[24],"main":[25],"results":[26],"show":[27],"that:":[28],"(1)":[29],"Depth":[30,51],"3":[31],"QAC0":[32],"circuits":[33,53],"cannot":[34,54],"compute":[35,48],"PARITY":[36],"regardless":[37,64],"size,":[39],"require":[41],"at":[42],"least":[43],"\u03a9(exp(\u221an))":[44],"gates":[46],"to":[47],"MAJORITY.":[49],"(2)":[50],"2":[52],"approximate":[55],"high-influence":[56],"Boolean":[57],"functions":[58],"(e.g.,":[59],"PARITY)":[60],"with":[61],"non-negligible":[62],"advantage,":[63],"size.":[66]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-18T00:00:00"}