Universal quantum computation with ideal Clifford gates and noisy ancillas

Sergey Bravyi, Alexei Kitaev · 2005 · Phys. Rev. A 71, 022316 (2005)

| 编号 QE296 | 主题 容错协议 | 链接 arXiv:quant-ph/0403025 |

摘要

摘要保留原文（英文）

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

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0⟩$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $\rho$, which should be regarded as a parameter of the model. Our goal is to determine for which $\rho$ universal quantum computation (UQC) can be effici

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