Computation at a distance

Details Computation at a distance Computation at a distance

2007-01-26

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

Physics

Quantum Physics

19 pages

Scientific paper

We consider a model of computation motivated by possible limitations on quantum computers. We have a linear array of n wires, and we may perform operations only on pairs of adjacent wires. Our goal is to build a circuits that perform specified operations spanning all n wires. We show that the natural lower bound of n-1 on circuit depth is nearly tight for a variety of problems, and we prove linear upper bounds for additional problems. In particular, using only gates adding a wire (mod 2) into an adjacent wire, we can realize any linear operation in GL_n(2) as a circuit of depth 5n. We show that some linear operations require depth at least 2n+1.

Affiliated with

Also associated with

No associations

Rating

Computation at a distance 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 Computation at a distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation at a distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568622