Some Notes on Parallel Quantum Computation
Quantum Physics
2009-09-25 v2
Abstract
We exhibit some simple gadgets useful in designing shallow parallel circuits for quantum algorithms. We prove that any quantum circuit composed entirely of controlled-not gates or of diagonal gates can be parallelized to logarithmic depth, while circuits composed of both cannot. Finally, while we note the Quantum Fourier Transform can be parallelized to linear depth, we exhibit a simple quantum circuit related to it that we believe cannot be parallelized to less than linear depth, and therefore might be used to prove that QNC < QP.
Cite
@article{arxiv.quant-ph/9804034,
title = {Some Notes on Parallel Quantum Computation},
author = {Cristopher Moore and Martin Nilsson},
journal= {arXiv preprint arXiv:quant-ph/9804034},
year = {2009}
}