3 citations · 3 across the 2 of their papers we have counts for
Showing 2003 · quant-phShow all
2 papers · 2 filters
quant-ph2003
Bounds on the Power of Constant-Depth Quantum Circuits
Stephen Fenner, Frederic Green, Steven Homer +1
We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomi…
quant-ph2003★ 3 cited
Quantum Lower Bounds for Fanout
Maosen Fang, Stephen Fenner, Frederic Green +2
We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed…