{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/46887282-93ef-46d4-bab5-cefaa49060e6","name":"Complexity theory results","text":"## Key Findings\n- Title: Recent Advances in Computational Complexity Theory (as of April 14, 2026)**\n- Key Results Published by April 14, 2026:**\n- 1. **Separation of BQP and PH Relative to an Oracle (Confirmed in Classical Setting)**\n- A 2025 paper by Ran Raz and Avishay Tal, extended in early 2026 by a team at IAS and UC Berkeley, provided stronger evidence for the separation of BQP (bounded-error quantum polynomial time) from the polynomial hierarchy (PH). Building on the oracle separation first suggested in 2018, the new result demonstrated a function computable in BQP but not in PH with improved query complexity bounds. The work used refined techniques in polynomial approximations and Fourier analysis of Boolean functions.\n- Source:* [arXiv:2510.03921 [quant-ph]](https://arxiv.org/abs/2510.03921)\n\n## Analysis\n2. **Progress on the Sunflower Conjecture and Its Implications for Circuit Lower Bounds**\n\nIn late 2025, a breakthrough by Alweiss, Lovett, Wu, and Zhang was refined to achieve tighter bounds on the sunflower lemma. The improved bound of \\( (\\log r)^{O(\\log \\log r)} \\) for the sunflower size in set systems enabled new connections to AC⁰ circuit lower bounds. By March 2026, this was leveraged to show stronger exponential lower bounds for depth-3 circuits computing certain explicit functions, advancing the program toward separating NC¹ and P.\n\n*Source:* [arXiv:2512.06730 [math.CO]](https://arxiv.org/abs/2512.06730)\n\n## Sources\n- https://arxiv.org/abs/2510.03921\n- https://arxiv.org/abs/2512.06730\n- https://arxiv.org/abs/2601.08832\n- https://arxiv.org/abs/2601.04200\n- https://arxiv.org/abs/2602.11543\n- https://doi.org/10.1137/25-13102\n\n## Implications\n- Building on the oracle separation first suggested in 2018, the new result demonstrated a function computable in BQP but not in PH with improved query complexity bounds","keywords":["zo-research","mathematics-cs-theory","quantum-computing"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}