SIAM Journal on Computing · 2001 · 176 citations · 22 references
ComputingComputer SciencePhysicsParallel ComputingQuantum ComputingQuantum MechanicsQuantum BitsQuantum CircuitsQuantum ComputationQuantum Fourier TransformQuantum GatesQuantum Hardware ArchitecturesControlled GatesHadamard GateNc Complexity ClassQuantum Circuit Implementations Of Fourier TransformQuantum Error-correcting CodesQuantum Fourier Transform Circuits
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 itnor a simpler "staircase" circuit can be parallelized to less than this.
22
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
A single quantum cannot be cloned
William K. Wootters, Wojciech H. Zurek · Nature · 1982 · 5.4K citations
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
Bulk Spin-Resonance Quantum Computation
Neil Gershenfeld, Isaac L. Chuang · Science · 1997 · 1.5K citations