scientific article

zbMath1258.81021arXiv1008.2422MaRDI QIDQ2906797

Widad MacHmouchi, P. W. Beame

Publication date: 5 September 2012

Full work available at URL: https://arxiv.org/abs/1008.2422

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsconstant-depth circuitsquantum query complexityquantum adversary method

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Approximate Degree in Classical and Quantum Computing, The Power of Asymmetry in Constant-Depth Circuits, Unnamed Item, A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$, Unnamed Item, Algorithmic Polynomials, Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$, Unnamed Item, Unnamed Item, Dual lower bounds for approximate degree and Markov-Bernstein inequalities