Quantum Lower Bounds for Fanout

Details Quantum Lower Bounds for Fanout Quantum Lower Bounds for Fanout

2003-12-28

arxiv.org/abs/quant-ph/0312208v1

Physics

Quantum Physics

Scientific paper

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 of single qubit and arbitrary size Toffoli gates, and when they use only constantly many ancill\ae. Under this constraint, this bound is close to optimal. In the case of a non-constant number $a$ of ancillae, we give a tradeoff between $a$ and the required depth, that results in a non-trivial lower bound for fanout when $a = n^{1-o(1)}$.

Affiliated with

Also associated with

No associations

Rating

Quantum Lower Bounds for Fanout does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Lower Bounds for Fanout, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Lower Bounds for Fanout will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717744