Quantum Circuits with Unbounded Fan-out
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Architectural implications of quantum computing technologies
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Computing with highly mixed states
Journal of the ACM (JACM)
Parallelizing quantum circuits
Theoretical Computer Science
Computational depth complexity of measurement-based quantum computation
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Circuit for Shor's algorithm using 2n+3 qubits
Quantum Information & Computation
The quantum fourier transform on a linear nearest neighbor architecture
Quantum Information & Computation
Bounds on the power of constant-depth quantum circuits
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Depth-optimized reversible circuit synthesis
Quantum Information Processing
| Hi-index | 0.00 |
We study the class QNC of efficient parallel quantum circuits, the quantum analog of NC. We exhibit several useful gadgets and prove that various classes of circuits can be parallelized to logarithmic depth, including circuits for encoding and decoding standard quantum error-correcting codes, or, more generally, any circuit consisting of controlled-not gates, controlled $\pi$-shifts, and Hadamard gates. Finally, while we note the exact quantum Fourier transform can be parallelized to linear depth, we conjecture that neither it nor a simpler "staircase" circuit can be parallelized to less than this.