论文标题
活动体积：有限的非本地连接的有效耐故障量子计算机的体系结构
Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections
论文作者
论文摘要
在用于基于表面代码的易于故障量子计算机的现有通用架构中，量子计算的成本由电路量（即量子数量）确定，即乘以乘以非clifford门的数量。我们使用非2D-Local连接介绍了一个体系结构，其中成本不会随量子数的数量而扩展，而仅与逻辑操作的数量相比。每个逻辑操作都有相关的活动量，因此量子计算的成本可以量化为所有操作的活动量之和。对于具有数千个逻辑Qubits的量子计算，活动体积可能比电路体积低的数量级。重要的是，该体系结构不需要N逻辑Qubits之间的全部连接。取而代之的是，每个逻辑量子位连接到其他站点O（log n）。例如，我们表明，使用相同数量的逻辑Qubits，可以在没有非本地连接的通用架构上执行2048位保理算法的44倍。使用光子Qubits，可以使用远程连接，我们显示如何使用光子组件来构建基于融合的活动体积量子计算机。
In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations. Each logical operation has an associated active volume, such that the cost of a quantum computation can be quantified as a sum of active volumes of all operations. For quantum computations with thousands of logical qubits, the active volume can be orders of magnitude lower than the circuit volume. Importantly, the architecture does not require all-to-all connectivity between N logical qubits. Instead, each logical qubit is connected to O(log N) other sites. As an example, we show that, using the same number of logical qubits, a 2048-bit factoring algorithm can be executed 44 times faster than on a general-purpose architecture without non-local connections. With photonic qubits, long-range connections are available and we show how photonic components can be used to construct a fusion-based active-volume quantum computer.
