Quantum Circuits with Unbounded Fan-out

Details Quantum Circuits with Unbounded Fan-out Quantum Circuits with Unbounded Fan-out

2002-08-07

arxiv.org/abs/quant-ph/0208043v4

Theory of Computing, 1(5):81-103, 2005

Physics

Quantum Physics

20 pages, 9 figures, STACS'2003. v3: rewritten from scratch, new co-author, everything put into constant depth (including quan

Scientific paper

We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denoted by QNCf^0) can approximate with polynomially small error the following gates: parity, mod[q], And, Or, majority, threshold[t], exact[q], and Counting. Classically, we need logarithmic depth even if we can use unbounded fan-in gates. If we allow arbitrary one-qubit gates instead of a fixed basis, then these circuits can also be made exact in log-star depth. Sorting, arithmetical operations, phase estimation, and the quantum Fourier transform with arbitrary moduli can also be approximated in constant depth.

Affiliated with

Also associated with

No associations

Rating

Quantum Circuits with Unbounded Fan-out 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 Circuits with Unbounded Fan-out, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Circuits with Unbounded Fan-out will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-539158