关于并行量子计算的几点注记
Some Notes on Parallel Quantum Computation
摘要：
我们展示了一些简单的小工具，在设计量子算法的浅并行电路有用。我们证明了任何完全由受控非门或对角门组成的量子线路都可以被并行化到对数深度，而由两者组成的电路则不能。最后，虽然我们注意到量子傅里叶变换可以并行化到线性深度，但我们展示了一个与之相关的简单量子线路，我们认为它不能并行化到小于线性深度，因此可以用来证明QNC < QP。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
