{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:20:02Z","timestamp":1787498402429,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540281931","type":"print"},{"value":"9783540318736","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537311_5","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:00:06Z","timestamp":1127815206000},"page":"44-55","source":"Crossref","is-referenced-by-count":13,"title":["Bounds on the Power of Constant-Depth Quantum Circuits"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Fenner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frederic","family":"Green","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Homer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.26421\/QIC4.2-5","volume":"4","author":"B.M. Terhal","year":"2004","unstructured":"Terhal, B.M., DiVincenzo, D.P.: Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games. Quantum Information and Computation\u00a04, 134\u2013145 (2004)","journal-title":"Quantum Information and Computation"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.26421\/QIC2.1-3","volume":"2","author":"F. Green","year":"2002","unstructured":"Green, F., Homer, S., Moore, C., Pollett, C.: Counting, fanout and the complexity of quantum ACC. Quantum Information and Computation\u00a02, 35\u201365 (2002)","journal-title":"Quantum Information and Computation"},{"key":"5_CR3","unstructured":"Aaronson, S.: Quantum computing, postselection, and probabilistic polynomialtime, Manuscript (2004)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1137\/S0097539799355053","volume":"31","author":"C. Moore","year":"2002","unstructured":"Moore, C., Nilsson, M.: Parallel quantum computation and quantum codes. SIAM Journal on Computing\u00a031, 799\u2013815 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cleve, R., Watrous, J.: Fast parallel circuits for the quantum Fourier transform. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 526\u2013536 (2000)","DOI":"10.1109\/SFCS.2000.892140"},{"key":"5_CR6","unstructured":"Moore, C.: Quantum circuits: Fanout, parity, and counting, Manuscript (1999)"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M.: \u03a31 1 formul\u00e6 on finite structures. Annals of Pure and Applied Logic\u00a024, 1\u201348 (1983)","journal-title":"Annals of Pure and Applied Logic"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial time hierarchy. Mathematical Systems Theory\u00a017, 13\u201327 (1984)","journal-title":"Mathematical Systems Theory"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"A.A. Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds for the size of circuits of bounded depth with basis {&, \u2295}. Math. Notes Acad. Sci. USSR\u00a041, 333\u2013338 (1987)","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"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, pp. 77\u201382 (1987)","DOI":"10.1145\/28395.28404"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-36494-3_22","volume-title":"Proceedings of the 20th Symposium on Theoretical Aspects of Computer Science","author":"P. H\u00f8yer","year":"2003","unstructured":"H\u00f8yer, P., \u015apalek, R.: Quantum circuits with unbounded fan-out. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 234\u2013246. Springer, Heidelberg (2003)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1109\/18.256501","volume":"39","author":"K.Y. Siu","year":"1993","unstructured":"Siu, K.Y., Bruck, J., Kailath, T., Hofmeister, T.: Depth efficient neural networks for division and related problems. IEEE Transactions on Information Theory\u00a039, 946\u2013956 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1038\/46503","volume":"402","author":"D. Gottesman","year":"1999","unstructured":"Gottesman, D., Chuang, I.L.: Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Letters to Nature\u00a0402, 390\u2013393 (1999)","journal-title":"Letters to Nature"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","volume":"70","author":"C.H. Bennett","year":"1993","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Jozsa, R., Peres, A., Wootters, W.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky- Rosen channels. Physical Review Letters\u00a070, 1895\u20131899 (1993)","journal-title":"Physical Review Letters"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"3953","DOI":"10.1098\/rspa.1999.0485","volume":"455","author":"S. Fenner","year":"1999","unstructured":"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\u00a0455, 3953\u20133966 (1999)","journal-title":"Proceedings of the Royal Society London A"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"5_CR17","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00289117","volume":"23","author":"K. Wagner","year":"1986","unstructured":"Wagner, K.: The complexity of combinatorial problems with succinct input representation. Acta Informatica\u00a023, 325\u2013356 (1986)","journal-title":"Acta Informatica"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1137\/0221023","volume":"21","author":"S. Toda","year":"1992","unstructured":"Toda, S., Ogiwara, M.: Counting classes are at least as hard as the polynomial-time hierarchy. SIAM Journal on Computing\u00a021, 316\u2013328 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR20","volume-title":"Quantum Computation and Quantum Information.","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing\u00a026, 1411\u20131473 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C.H. Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computation. SIAM Journal on Computing\u00a026, 1510\u20131523 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/S0097539795293639","volume":"26","author":"L.M. Adleman","year":"1997","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.D.A.: Quantum computability. SIAM Journal on Computing\u00a026, 1524\u20131540 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR24","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0020-0190(99)00084-8","volume":"71","author":"T. Yamakami","year":"1999","unstructured":"Yamakami, T., Yao, A.C.C.: NQPC= co-C=P. Information Processing Letters\u00a071, 63\u201369 (1999)","journal-title":"Information Processing Letters"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Beigel, R., Reingold, N., Spielman, D.: PP is closed under intersection. In: Proceedings of the 23rd annual ACM Symposium on Theory of Computing, pp. 1\u20139 (1991)","DOI":"10.1145\/103418.103426"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T23:15:59Z","timestamp":1626563759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11537311_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}