CSS 码的错误容忍逻辑门网络
量子物理
2013-05-29 v3
摘要
本文讨论了由 CSS 码编码的量子比特的错误容忍逻辑操作，重点放在适用于高码率码的方法上，即每个码块编码 k 个量子比特且 k>1。研究表明，给定码块内的逻辑量子比特可通过单次恢复操作制备到任意其稳定子生成元可分离为 X 与 Z 部分的状态。文中讨论了移动逻辑量子比特以及实现受控非门和 Toffoli 门的优化方法。研究发现，当 k>1 时完成一次错误容忍量子计算所需的时间步数与 k=1 时相同。
引用
@article{arxiv.quant-ph/0311014,
title = {Fault-Tolerant Logical Gate Networks for CSS Codes},
author = {Andrew M. Steane and Ben Ibinson},
journal= {arXiv preprint arXiv:quant-ph/0311014},
year = {2013}
}
备注
13 pages, 16 figures. The material in the appendix was included in a previous quant-ph eprint, but not yet published; it has been corrected and clarified. The rest is new. Replacement version: various small corrections and clarifications