Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
Andrew J. Landahl, Chris Cesare
备注：
13 pages, 4 figures. Resource metric now non-Clifford states. Comparison now to Meier-Eastin-Knill distillation and (optimal) Selinger compiling. Minor tweaks made to concatenated teleportation analysis
我们提出的量子协议执行任意精确的$π/2^k$旋转的量子位围绕其$Z$轴。精简指令集计算（\textsc{risc}）体系结构通常将指令集限制为稳定器操作和单个非稳定器操作，诸如准备“魔术”状态，从该状态可以传送$T = Z(π/4)$门。尽管提取该神奇状态的高保真副本所需的开销很高，但是在\textsc{risc}架构中实现$Z$旋转的后续量子编译开销可能大得多。我们开发了一个复杂的指令集计算（\textsc{cisc}）的架构，其指令集包括稳定器操作和准备的魔术状态，$Z(π/2^k)$门可以传送，为$2 \leq k \leq k_{\text{max}}$。这导致实现$Z$旋转的期望门精度所需的门数量的显著总体减少。我们构造的关键是一族长度为$2^{k+2}-1$的缩短量子Reed-Muller码，其魔态蒸馏阈值随着$k$而缩小，但对于$k \leq 6$则大于0.85%。
英文摘要：
We present quantum protocols for executing arbitrarily accurate $π/2^k$ rotations of a qubit about its $Z$ axis. Reduced instruction set computing (\textsc{risc}) architectures typically restrict the instruction set to stabilizer operations and a single non-stabilizer operation, such as preparation of a "magic" state from which $T = Z(π/4)$ gates can be teleported. Although the overhead required to distill high-fidelity copies of this magic state is high, the subsequent quantum compiling overhead to realize $Z$ rotations in a \textsc{risc} architecture can be much greater. We develop a complex instruction set computing (\textsc{cisc}) architecture whose instruction set includes stabilizer operations and preparation of magic states from which $Z(π/2^k)$ gates can be teleported, for $2 \leq k \leq k_{\text{max}}$. This results in a substantial overall reduction in the number of gates required to achieve a desired gate accuracy for $Z$ rotations. The key to our construction is a family of shortened quantum Reed-Muller codes of length $2^{k+2}-1$, whose magic-state distillation threshold shrinks with $k$ but is greater than 0.85% for $k \leq 6$.
Laboratoire de Physique Théorique et Modélisation, CNRS UMR 8089, CY Cergy Paris Université（CY塞吉-巴黎大学理论物理与建模实验室）；Dipartimento di Ingegneria Industriale, Università degli Studi di Salerno（萨莱诺大学工业工程系）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；TCM Group, Cavendish Laboratory, University of Cambridge（剑桥大学卡文迪许实验室TCM小组）；Institut für Theoretische Physik, Universität zu Köln（科隆大学理论物理研究所）
Bridging Superconducting and Neutral-Atom Platforms for Efficient Fault-Tolerant Quantum Architectures
University of California, San Diego（加州大学圣地亚哥分校）；Pacific Northwest National Laboratory（太平洋西北国家实验室）；University of Washington（华盛顿大学）；Quantum Science Center, Oak Ridge National Laboratory（橡树岭国家实验室量子科学中心）
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
The University of Tokyo（东京大学）；NTT Computer and Data Science Laboratories, NTT Corporation（日本电信电话公司计算机与数据科学实验室）；JST, PRESTO（日本科学技术振兴机构 PRESTO 项目）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）；Faculty of Information Science and Technology, Hokkaido University（北海道大学信息科学技术学院）
eQASM: An Executable Quantum Instruction Set Architecture
QuTech, Delft University of Technology（代尔夫特理工大学 QuTech）；Quantum Computer Architecture Lab, Delft University of Technology（代尔夫特理工大学量子计算机架构实验室）；Kavli Institute of Nanoscience, Delft University of Technology（代尔夫特理工大学卡弗里纳米科学研究所）；Computer Engineering Lab, Delft University of Technology（代尔夫特理工大学计算机工程实验室）；Netherlands Organisation for Applied Scientific Research (TNO)（荷兰应用科学研究组织（TNO））；Topic Embedded Systems B.V.（Topic 嵌入式系统有限公司）
