远距离计算
Computation at a distance
摘要：
我们考虑一个由量子计算机可能的局限性激发的计算模型。我们有一个n根线的线性阵列，我们可以只对相邻的线对执行操作。我们的目标是建立一个电路，执行指定的操作跨越所有n线。我们表明，自然的下限n-1电路深度几乎是紧的各种问题，我们证明了线性上限额外的问题。特别地，仅使用将线（mod 2）添加到相邻线的门，我们可以将GL_n（2）中的任何线性运算实现为深度为5 n的电路。我们证明了一些线性运算至少需要2n+1的深度。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
