Computation at a distance
| dc.creator | Kutin, Samuel A. | |
| dc.creator | Moulton, David Petrie | |
| dc.creator | Smithline, Lawren M. | |
| dc.date | 2007-01-26 | |
| dc.date.accessioned | 2026-07-07T07:43:22Z | |
| dc.date.available | 2026-07-07T07:43:22Z | |
| dc.description | 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. | |
| dc.description | 19 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0701194 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0701194 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/122799 | |
| dc.subject | Quantum Physics | |
| dc.title | Computation at a distance | |
| dc.type | text |