Error Rates and Resource Overheads of Repetition Cat Qubits

Jérémie Guillaud, Mazyar Mirrahimi · 2020 · arXiv

| 编号 QE176 | 主题 玻色子码 | 链接 arXiv:2009.10756 |

摘要

摘要保留原文（英文）

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

We estimate and analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation. The cat qubits stabilized by two-photon dissipation exhibit an extremely biased noise where the bit-flip error rate is exponentially suppressed with the mean number of photons. In a recent work, we suggested that the remaining phase-flip error channel could be suppressed using a 1D repetition code. Indeed, using only bias-preserving gates on the cat-qubits, it is possible to build a universal set of fault-tolerant logical gates at the level of the repetition cat qubit. In this paper, we perform Monte-Carlo simulations of all the circuits implementing the protected logical gates, using a circuit-level error model. Furthermore, we analyze two different approaches to implement a fault-tolerant Toffoli gate on repetition cat qubits. These numerical simulations indicate that very low logical error rates could be achieved with a reasonable resource overhead, and with parameters that are within the reach of near-term circuit QED experiments.

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