Counting, fanout, and the complexity of quantum ACC

Quantum Information and Computation

Volumn 2, Issue 1, 2002, Pages 35-65

  Green, Frederic ^a   Homer, Steven ^b   Moore, Cristopher ^c   Pollett, Christopher ^d  

^a CLARK UNIVERSITY   (United States)

^b BOSTON UNIVERSITY   (United States)

^c SANTA FE INSTITUTE   (United States)

^d SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

Quantum circuit complexity; Quantum computation; Threshold circuit

Indexed keywords

POLYNOMIALS; QUANTUM COMPUTERS; THRESHOLD ELEMENTS;

CIRCUIT COMPLEXITY; CLASSICAL COUNTERPART; CONSTANT-DEPTH CIRCUITS; POLYNOMIAL SIZE; QUANTUM ANALOG; QUANTUM COMPLEXITY CLASS; THRESHOLD CIRCUITS; UPPER BOUND;

COMPUTER CIRCUITS;

EID: 0009678585     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (42)

1. L. Grever, "A fast quantum mechanical algorithm for database search." in ACM Symposium on Theory of Computing, ACM Press (1996).
2. P. W. Shor, "Polynomial-time algorithms for prime number factorization and discrete logarithms on a quantum computer." SIAM J. Computing 26 (1997) 1484-1509.
3. D. Deutsch. Quantum theory, the church-turing principal, and the universal quantum computer. In Proceedings of the Royal Society of London, pages 97-117, 1985.
4. D. Deutsch and R. Jozsa. Rapid solutions of problems by quantum computation. In Proceedings of the Royal Society of London, pages 553-558, 1992.
5. A. Berthiaume and G. Brassard. "Oracle quantum computing." Journal of Modern Optics, 41(12): 2521-2535, 1994.
6. E. Bernstein and U. Vazirani, "Quantum complexity theory." SIAM J. Comp., 26:1411-1473, 1997.
7. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computation. SIAM Journal on Computing, 26:1510-1523, 1997.
8. D. Simon. On the power of quantum computation. SIAM Journal on Computing, 26:1474-1483, 1997.
9. A. Berthiaume and G. Brassard. "The quantum challenge to structural complexity." In Proceedings of the IEEE Conference on Computational Complexity, IEEE Press, 132-137, 1992.
10. L. Adleman, J. DeMarrais, and M. Huang. Quantum computability. SIAM J. Computing 26 (1997) 1524-1540.
11. S. Fenner, F. Green, S. Homer, and R. Pruim, "Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy." Royal Society of London A (1999) 455, pp 3953-3966.
12. A. C.-C. Yao, "Quantum circuit complexity." Proc. 34th IEEE Symposium on Foundations of Computer Science (1993) 352-361.
13. 1." J. Comput. System Sci. 38 (1989) 150-164.
14. M. Beaudry, P. McKenzie, P. Péladeau, and D. Thérien, "Circuits with monoidal gates." Proc. Symposium on Theoretical Aspects of Computer Science (1993) 555-565.
15. C. Moore, D. Thérien, F. Lemieux, J. Berman, and A. Drisko , "Circuits and Expressions with Non-Associative Gates." Journal of Computer and System Sciences 60 (2000) 368-394.
16. A. Chandra, L. Stockmeyer, and U. Vishkin, "Constant depth reducibility," in SIAM J. Comp., 13, (1984), pp. 423-439.
17. H. Vollmer, Introduction to Circuit Complexity, Springer-Verlag 1999.
18. 1," in Journal of the ACM, 35 (1988), pp. 941-952.
19. 1 formulae on finite structures." Ann. Pure Appl. Logic 24 (1983) 1-48.
20. M. Furst, J.B. Saxe, and M. Sipser, "Parity, circuits, and the polynomial-time hierarchy." Math. Syst. Theory 17 (1984) 13-27.
21. A.A. Razborov, "Lower bounds for the size of circuits of bounded depth with basis {&, ⊕}." Math. Notes Acad. Sci. USSR 41(4) (1987) 333-338.
22. R. Smolensky, "Algebraic methods in the theory of lower bounds for Boolean circuit complexity." Proc. 19th Annual ACM Symposium on Theory of Computing (1987) 77-82.
23. P.W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring." Proc. 35th IEEE Symposium on Foundations of Computer Science (1994) 124-134.
24. C. Moore and M. Nilsson, "Parallel quantum computation and quantum codes." quantph/9808027, and to appear in SIAM J. Computing.
25. C. Moore and M. Nilsson, "Some notes on parallel quantum computation." quant-ph/9804034.
26. C. Moore, "Quantum Circuits: Fanout, Parity, and Counting." quant-ph/9903046.
27. =P." In Information Processing Letters, 71 (1999), pp. 63-69.
28. F. Green, S. Homer, and C. Pollett, "On the Complexity of Quantum ACC," in Fifteenth Annual Conference on Computational Complexity Theory, IEEE Computer Society Press, (2000) 250-262.
29. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2001.
30. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
31. D.P. DiVincenzo and P.W. Shor, "Fault-tolerant error correction with efficient quantum codes." quant-ph/9605031.
32. P.W. Shor, "Fault-tolerant quantum computation." quant-ph/9605011.
33. J.I. Cirac and P. Zoller, "Quantum computers with cold trapped ions." Phys. Rev. Lett. 74 (1995) 4091-4094.
34. N. Gershenfeld and I. Chuang, "Bulk spin resonance quantum computation." Science 275 (1997) 350.
35. A. Barenco, C. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J.A. Smolin, and H. Weifurter, "Elementary gates for quantum computation." Phys. Rev. A 52, pages 3457-3467, 1995.
36. M. Reck, A. Zeilinger, H.J. Bernstein, and P. Bertani, "Experimental realization of any discrete unitary operator." Phys. Rev. Lett. 73 (1994) 58-61.
37. K.-Y. Siu and V Rowchowdhury, "On optimal depth threshold circuits for multiplication and related problems." SIAM J. Discrete Math. 7 (1994) 284-292.
38. K.-Y. Siu and J Bruck, "On the power of threshold circuits with small weights." SIAM J. Discrete Math. 4 (1991) 423-435.
39. P. Clote, "On polynomial Size Frege Proofs of Certain Combinatorial Principles." In P. Clote and J. Krajicek, editors, Arithmetic, Proof Theory, and Computational Complexity, Oxford (1993) 164-184.
40. K. C. Chung and T. H. Yao, "On Lattices Admitting Unique Lagrange Interpolations." SIAM Journal of Numerical Analysis 14 (1977) 735-743.
41. R. A. Nicolaides, "On a class of finite elements generated by Lagrange interpolation." SIAM Journal of Numerical Analysis 9 (1972) 177-199.
42. A. C.-C. Yao, "On ACC and threshold circuits." Proc. 31st IEEE Symposium on Foundations of Computer Science (1990) 619-627.