An algorithm classifies visibly pushdown languages as AC^0, ACC^0-hard, or constant-depth equivalent to unions of newly defined intermediate VPLs.
Almost optimal lower bounds for small depth circuits
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Any n-qubit unitary can be implemented approximately with Õ(2^{n/2}) oracle queries or exactly with Õ(2^{n/2}) circuit depth via Grover search reductions, with matching lower bounds for certain implementations.
citing papers explorer
-
The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
An algorithm classifies visibly pushdown languages as AC^0, ACC^0-hard, or constant-depth equivalent to unions of newly defined intermediate VPLs.
-
Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
Any n-qubit unitary can be implemented approximately with Õ(2^{n/2}) oracle queries or exactly with Õ(2^{n/2}) circuit depth via Grover search reductions, with matching lower bounds for certain implementations.