用“分段链”进行一维量子计算在今天的门级上是可行的
One-dimensional quantum computing with a 'segmented chain' is feasible with today's gate fidelities
摘要：
原则上，最近邻链接量子位的1D阵列与容错量子计算兼容。然而，这种受限的拓扑结构需要大量的开销来重排量子位，因此容错阈值远低于2D架构。在这里，我们确定了一个中间立场：一个1D分段链，它是一个线性的片段阵列，每个片段都是一个具有全对全连接性的良好连接区域。该架构与离子阱和固态系统都相关。我们建立的容错可以实现单独的表面码，或通过一个额外的级联四量子比特规范码。我们发现，容错阈值为0.12%的15量子位段，而更大的段是优越的。对于每段35个或更多量子位，可以在不使用上级联层的情况下，利用当今最先进的并行性实现有意义的规模上的计算，从而最小化整体设备尺寸。
英文摘要：
In principle a 1D array of nearest-neighbour linked qubits is compatible with fault tolerant quantum computing. However such a restricted topology necessitates a large overhead for shuffling qubits and consequently the fault tolerance threshold is far lower than in 2D architectures. Here we identify a middle ground: a 1D segmented chain which is a linear array of segments, each of which is a well-connected zone with all-to-all connectivity. The architecture is relevant to both ion trap and solid-state systems. We establish that fault tolerance can be achieved either by a surface code alone, or via an additional concatenated four-qubit gauge code. We find that the fault tolerance threshold is 0.12% for 15-qubit segments, while larger segments are superior. For 35 or more qubits per segment one can achieve computation on a meaningful scale with today's state-of-the-art fidelities without the use of the upper concatenation layer, thus minimising the overall device size.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
