Bounds on the power of constant-depth quantum circuits

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 44-55

  Fenner, Stephen ^a   Green, Frederic ^b   Homer, Steven ^c   Zhang, Yong ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

^b CLARK UNIVERSITY   (United States)

^c BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; NETWORKS (CIRCUITS); POLYNOMIALS; PROBABILITY;

DEPTH-FIVE CIRCUITS; NQP; QUANTUM CIRCUITS;

QUANTUM ELECTRONICS;

EID: 26844539700     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_5     Document Type: Conference Paper

References (25)

1. Terhal, B.M., DiVincenzo, D.P.: Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games. Quantum Information and Computation 4 (2004) 134-145
2. Green, F., Homer, S., Moore, C., Pollett, C.: Counting, fanout and the complexity of quantum ACC. Quantum Information and Computation 2 (2002) 35-65
3. Aaronson, S.: Quantum computing, postselection, and probabilistic polynomial-time (2004) Manuscript.
4. Moore, C., Nilsson, M.: Parallel quantum computation and quantum codes. SIAM Journal on Computing 31 (2002) 799-815
5. Cleve, R., Watrous, J.: Fast parallel circuits for the quantum Fourier transform. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science. (2000) 526-536
6. Moore, C.: Quantum circuits: Fanout, parity, and counting (1999) Manuscript.
7. 1 formulæ on finite structures. Annals of Pure and Applied Logic 24 (1983) 1-48
8. Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial time hierarchy. Mathematical Systems Theory 17 (1984) 13-27
9. Razborov, A.A.: Lower bounds for the size of circuits of bounded depth with basis {&, ⊗}. Math. Notes Acad. Sci. USSR 41 (1987) 333-338
10. Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proceedings of the 19th ACM Symposium on the Theory of Computing. (1987) 77-82
11. Høyer, P., Špalek, R.: Quantum circuits with unbounded fan-out. In: Proceedings of the 20th Symposium on Theoretical Aspects of Computer Science. Volume 2607 of Lecture Notes in Computer Science., Springer-Verlag (2003) 234-246
12. Siu, K.Y., Bruck, J., Kailath, T., Hofmeister, T.: Depth efficient neural networks for division and related problems. IEEE Transactions on Information Theory 39 (1993) 946-956
13. Gottesman, D., Chuang, I.L.: Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Letters to Nature 402 (1999) 390-393
14. Bennett, C.H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters 70 (1993) 1895-1899
15. Fenner, S., Green, F., Homer, S., Pruim, R.: Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy. Proceedings of the Royal Society London A 455 (1999) 3953-3966
16. Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science 8 (1979) 189-201
17. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
18. Wagner, K.: The complexity of combinatorial problems with succinct input representation. Acta Informatica 23 (1986) 325-356
19. Toda, S., Ogiwara, M.: Counting classes are at least as hard as the polynomial-time hierarchy. SIAM Journal on Computing 21 (1992) 316-328
20. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)
21. Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing 26 (1997) 1411-1473
22. Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computation. SIAM Journal on Computing 26 (1997) 1510-1523
23. Adleman, L.M., DeMarrais, J., Huang, M.D.A.: Quantum computability. SIAM Journal on Computing 26 (1997) 1524-1540
24. C = co-C=P. Information Processing Letters 71 (1999) 63-69
25. Beigel, R., Reingold, N., Spielman, D.: PP is closed under intersection. In: Proceedings of the 23rd annual ACM Symposium on Theory of Computing. (1991) 1-9