Quantum Circuits with Unbounded Fan-out (2003)
| Venue: | 20th STACS Conference, 2003, LNCS 2607 |
| Citations: | 13 - 1 self |
BibTeX
@INPROCEEDINGS{Høyer03quantumcircuits,
author = {Peter Høyer and Robert ˇ Spalek},
title = {Quantum Circuits with Unbounded Fan-out},
booktitle = {20th STACS Conference, 2003, LNCS 2607},
year = {2003},
pages = {234--246}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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 QNC 0 f) 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 can also be approximated in constant depth. 1
