Some Notes on Parallel Quantum Computation

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

[1]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[2]  DiVincenzo,et al.  Fault-Tolerant Error Correction with Efficient Quantum Codes. , 1996, Physical review letters.

[3]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[4]  Griffiths,et al.  Semiclassical Fourier transform for quantum computation. , 1995, Physical review letters.

[5]  D. Coppersmith An approximate Fourier transform useful in quantum factoring , 2002, quant-ph/0201067.

[6]  James P. Crutchfield,et al.  Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..