论文标题
解码合并的颜色表面代码，并使用求解器找到可满足理论的易耐故障的Clifford电路
Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
论文作者
论文摘要
通用易于故障的量子计算机将需要使用有效的协议来实现执行算法所必需的编码操作。在这项工作中，我们展示了如何使用具有某些故障耐受性属性的Clifford电路的求解器（SMT求解器）来自动化Clifford电路的构建，并且我们将技术应用于容忍缺陷的魔术状态备件方案。协议的一部分需要将颜色代码中编码的魔术状态转换为表面代码中编码的魔法状态。由于传送步骤涉及解码与表面代码合并的颜色代码，因此我们开发了适用于此类代码的解码算法。
Universal fault-tolerant quantum computers will require the use of efficient protocols to implement encoded operations necessary in the execution of algorithms. In this work, we show how solvers for satisfiability modulo theories (SMT solvers) can be used to automate the construction of Clifford circuits with certain fault-tolerance properties and we apply our techniques to a fault-tolerant magic-state-preparation protocol. Part of the protocol requires converting magic states encoded in the color code to magic states encoded in the surface code. Since the teleportation step involves decoding a color code merged with a surface code, we develop a decoding algorithm that is applicable to such codes.
