Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
SIAM Journal on Computing
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Quantum computation and quantum information
Quantum computation and quantum information
Computational complexity of uniform quantum circuit families and quantum Turing machines
Theoretical Computer Science
Complexity Limitations on Quantum Computation
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Fast parallel circuits for the quantum Fourier transform
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Quantum lower bounds for fanout
Quantum Information & Computation
Efficient Universal Quantum Circuits
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A lower bound method for quantum circuits
Information Processing Letters
Efficient universal quantum circuits
Quantum Information & Computation
| Hi-index | 0.00 |
Small depth quantum circuits have proved to be unexpectedly powerful in comparison to their classical counterparts. We survey some of the recent work on this and present some open problems.