Most quantum computing architectures can be realized as two-dimensional lattices of qubits that interact with each other. We take transmon qubits and transmission line resonators as promising candidates for qubits and couplers; we use them as basic building elements of a quantum code. We then propose a simple framework to determine the optimal experimental layout to realize quantum codes. We show that this engineering optimization problem can be reduced to the solution of standard binary linear programs. While solving such programs is a NP-hard problem, we propose a way to find scalable optimal architectures that require solving the linear program for a restricted number of qubits and couplers. We apply our methods to two celebrated quantum codes, namely the surface code and the Fibonacci code.

中文翻译：

---

拓扑量子纠错码的总线布局方法

大多数量子计算架构可以实现为相互交互的量子比特的二维晶格。我们将transmon量子位和传输线谐振器作为量子位和耦合器的有前途的候选对象。我们将它们用作量子代码的基本构建元素。然后，我们提出一个简单的框架来确定实现量子代码的最佳实验布局。我们表明，该工程优化问题可以简化为标准二进制线性程序的解决方案。虽然解决此类程序是一个NP难题，但我们提出了一种方法，该方法可以找到可伸缩的最佳体系结构，这些体系结构需要为有限数量的qubit和耦合器求解线性程序。我们将我们的方法应用于两个著名的量子代码，即表面代码和斐波那契代码。