Quantum lower bounds for fanout

Quantum Information and Computation

Volumn 6, Issue 1, 2006, Pages 046-057

  Fang, M ^a   Fenner, S ^b   Green, F ^c   Homer, S ^a   Zhang, Y ^b  

^a BOSTON UNIVERSITY   (United States)

^b The Department of Mechanical Engineering   (United States)

^c CLARK UNIVERSITY   (United States)

Author keywords

Circuit complexity; Fanout; Quantum complexity; Quantum computation

Indexed keywords

QUANTUM COMPUTERS; QUBITS;

CIRCUIT COMPLEXITY; CONSTANT-DEPTH CIRCUITS; FAN-OUT; QUANTUM CIRCUIT; QUANTUM COMPLEXITY; QUANTUM LOWER BOUNDS; RESOURCE-BOUNDED; TOFFOLI GATES;

CIRCUIT THEORY;

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

References (14)

1. P. Høyer and R. Spalek, "Quantum circuits with unbounded fan-out," in Proceedings of thee 20th STACS Conference, 2003, Springer-Verlag Lecture Notes in Computer Science 2607, 234-246.
2. X. Wang, A. Sorenson and K. Molmer, "Multi-bit gates for quantum computing," Phys. Rev. Lett. 86 (17) (2001) 3907-3910.
3. Cristopher Moore, "Quantum circuits: Fanout, parity, and counting," in Los Alamos Preprint archives (1999), quant-ph/9903046.
4. F. Green, S. Homer, C. Moore and C. Pollett, "Counting, fanout and the complexity of quantum ACC," Quantum Information and Computation 2 (2002) 35-65.
5. M. Furst, J.B. Saxe, and M. Sipser, "Parity, circuits, and the polynomial-time hierarchy." Math. Syst. Theory 17 (1984) 13-27.
6. A. A. Razborov, "Lower bounds on the size of bounded depth networks over a complete basis with logical addition," Matematicheskie Zametki 41 (1987) 598-607.
7. English translation in Mathematical Notes of the Academy of Sciences of the USSR 41 (1987) 333-338.
8. R. Smolensky, "Algebraic methods in the theory of lower bounds for Boolean circuit complexity," in Proceedings of the 19th Annual ACM Symposium on Theory of Computing (1987) 77-82.
9. P. W. Shor, "Polynomial-time algorithms for prime number factorization and discrete logarithms on a quantum computer," SIAM J. Computing 26 (1997) 1484-1509.
10. R. Cleve and J. Watrous, "Fast parallel circuits for the quantum Fourier transform," in Proceedings of the 41st Annual Symposium on Foundations of Computer Science (2000), 526-536.
11. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2001.
12. A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and Quantum Computation, American Mathematical Society, 2002.
13. N. Nisan, "CREW PRAMs and decision trees," SIAM J. Computing 20 (1991) 999-1007.
14. S. Fenner, F. Green, S. Homer and Y. Zhang, "Bounds on the power of constant depth quantum circuits," in Los Alamos Preprint Archives (2003), quant-ph/0312209.