Quantum computation and quantum information
Quantum computation and quantum information
Fast parallel circuits for the quantum Fourier transform
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
ACM SIGACT News
Quantum lower bounds for fanout
Quantum Information & Computation
Hi-index | 0.89 |
Quantum circuits, which are shallow, limited in the number of gates and additional workspace qubits, are popular for quantum computation because they form the simplest possible model similar to the classical model of a network of Boolean gates and capable of performing non-trivial computation. We give a new lower bound technique for such circuits and use it to give another proof that deterministic computation of the parity function cannot be performed by such circuits.