Quantum computing with rotation-symmetric bosonic codes

Arne L. Grimsmo, Joshua Combes, Ben Q. Baragiola · 2020 · Phys. Rev. X 10, 011058 (2020)

| 编号 QE178 | 主题 玻色子码 | 链接 arXiv:1901.08071 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class—number-phase codes—which includes the well-known cat and binomial codes, among many others. The entangling gate in our scheme is code-agnostic and can be used to interface different rotation-symmetric encodings. In addition to a universal set of operations, we propose a teleportation-based error correction scheme that allows recoveries to be tracked entirely in software. Focusing on cat and binomial codes as examples, we compute average gate fidelities for error correction under simultaneous loss and dephasing noise and show numerically that the error-correction scheme is close to optimal for error-free ancillae and ideal measurements. Finally, we present a scheme for fault-tolerant, universal quantum computing based on concatenation of number-phase codes and Bacon-Shor subsystem codes.

本站词条在引用该文献时，会以 wikilink（sources/QE178）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。