On the complexity of quantum ACC

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2000, Pages 250-262

  Green, Frederic ^a   Homer, Steven ^b   Pollett, Christopher ^c  

^a CLARK UNIVERSITY   (United States)

^b BOSTON UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING; TENSORS; THEOREM PROVING;

QUANTUM COMPUTATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0033698713     PISSN: 10930159     EISSN: None     Source Type: Journal    
DOI: 10.1109/CCC.2000.856756     Document Type: Article

References (16)

1. A. Barenco C. Bennett R. Cleve D. P. DiVincenzo N. Margolus P. Shor T. Sleator J. A. Smolin H. Weifurter Elementary gates for quantum computation Phys. Rev. A 52 3457 3467 1995
2. K. C. Chung T. H. Yao On Lattices Admitting Unique Lagrange Interpolations Siam Journal of Numerical Analysis 14 735 743 1977
3. P. Clote Arithmetic, Proof Theory, and Computational Complexity 164 184 1993 Oxford On polynomial Size Frege Proofs of Certain Combinatorial Principles
4. L. Fortnow J. Rogers Complexity Limitations on Quantum Computation Proceedings of 13th IEEE Conference on Computational Complexity 202 209 Proceedings of 13th IEEE Conference on Computational Complexity 1998
5. S. Fenner F. Green S. Homer R. Pruim Quantum NP is hard for PH Proceedings of 6th Italian Conference on theoretical Computer Science 241 252 Proceedings of 6th Italian Conference on theoretical Computer Science Singapore 1998
6. A. Maciel D. Therien Threshold Circuits of Small Majority-Depth Information and Computation 146 55 83 1998
7. C. Moore M. Nilsson Parallel Quantum Computation and Quantum Codes In Los Alamos Preprint archives 1998 quant-ph/9808027
8. C. Moore Quantum Circuits: Fanout, Parity, and Counting. In Los Alamos Preprint archives 1999 quant-ph/9903046
9. R. A. Nicolaides On a class of finite elements generated by Lagrange interpolation Siam Journal of Numerical Analysis 9 177 199 1972
10. P. W. Shor Polynomial-time algorithms for prime number factorization and discrete logarithms on a quantum computer SIAM J. Comp. 26 1484 1509 1997
11. K.-Y. Siu V Rowchowdhury On optimal depth threshold circuits for multiplication and related problems SIAM J. Discrete Math. 7 284 292 1994
12. K.-Y. Siu J Bruck On the power of threshold circuits with small weights SIAM J. Discrete Math. 4 423 435 1991
13. R. Smolensky Algebraic methods in the theory of lower bounds for Boolean circuit complexity Proceedings of the 19th Annual ACM Symposium on Theory of Computing 77 82 Proceedings of the 19th Annual ACM Symposium on Theory of Computing 1987
14. T. Yamakami A. C. Yao NQPc = co-C=P Information Processing Letters
15. A. C.-C. Yao On ACC and threshold circuits Proceedings of the 31st Symposium on Foundations of Computer Science 619 627 Proceedings of the 31st Symposium on Foundations of Computer Science 1990
16. A. C.-C. Yao Quantum circuit complexity Proceedings of the 34th IEEE Symposium on Foundations of Computer Science 352 361 Proceedings of the 34th IEEE Symposium on Foundations of Computer Science 1993