Quantum Circuits with Unbounded Fan-out

Peter Høyer, Robert Špalek · 2003 · STACS 2003, Lecture Notes in Computer Science 234-246

| 编号 QAPP007 | 主题 应用 | 链接 arXiv:quant-ph/0208043 |

摘要

摘要保留原文（英文）

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

We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denoted by QNCf^0) can approximate with polynomially small error the following gates: parity, mod[q], And, Or, majority, threshold[t], exact[q], and Counting. Classically, we need logarithmic depth even if we can use unbounded fan-in gates. If we allow arbitrary one-qubit gates instead of a fixed basis, then these circuits can also be made exact in log-star depth. Sorting, arithmetical operations, phase estimation, and the quantum Fourier transform with arbitrary moduli can also be approximated in constant depth. 20 pages, 9 figures, STACS’2003.

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