{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:27:59Z","timestamp":1743110879477,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_18","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"223-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable"],"prefix":"10.1007","author":[{"given":"Yasuhiro","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seiichiro","family":"Tani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Yamazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuyuki","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC), pp. 333\u2013342 (2011)","DOI":"10.1145\/1993636.1993682"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1098\/rspa.2010.0301","volume":"467","author":"MJ Bremner","year":"2011","unstructured":"Bremner, M.J., Jozsa, R., Shepherd, D.J.: Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proceedings of the Royal Society A 467, 459\u2013472 (2011)","journal-title":"Proceedings of the Royal Society A"},{"issue":"1&2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"106","DOI":"10.26421\/QIC8.1-2-8","volume":"8","author":"S Clark","year":"2008","unstructured":"Clark, S., Jozsa, R., Linden, N.: Generalized Clifford groups and simulation of associated quantum circuits. Quantum Information and Computation 8(1&2), 106\u2013126 (2008)","journal-title":"Quantum Information and Computation"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11537311_5","volume-title":"Fundamentals of Computation Theory","author":"SA Fenner","year":"2005","unstructured":"Fenner, S.A., Green, F., Homer, S., Zhang, Y.: Bounds on the power of constant-depth quantum circuits. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 44\u201355. Springer, Heidelberg (2005)"},{"issue":"5","key":"18_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.4086\/toc.2005.v001a005","volume":"1","author":"P H\u00f8yer","year":"2005","unstructured":"H\u00f8yer, P., \u0160palek, R.: Quantum fan-out is powerful. Theory of Computing 1(5), 81\u2013103 (2005)","journal-title":"Theory of Computing"},{"issue":"7&8","key":"18_CR6","doi-asserted-by":"crossref","first-page":"633","DOI":"10.26421\/QIC14.7-8-7","volume":"14","author":"R Jozsa","year":"2014","unstructured":"Jozsa, R., van den Nest, M.: Classical simulation complexity of extended Clifford circuits. Quantum Information and Computation 14(7&8), 633\u2013648 (2014)","journal-title":"Quantum Information and Computation"},{"issue":"1&2","key":"18_CR7","doi-asserted-by":"crossref","first-page":"54","DOI":"10.26421\/QIC13.1-2-5","volume":"13","author":"X Ni","year":"2013","unstructured":"Ni, X., van den Nest, M.: Commuting quantum circuits: efficient classical simulations versus hardness results. Quantum Information and Computation 13(1&2), 54\u201372 (2013)","journal-title":"Quantum Information and Computation"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Takahashi, Y., Tani, S.: Collapse of the hierarchy of constant-depth exact quantum circuits. In: Proceedings of the 28th IEEE Conference on Computational Complexity (CCC), pp. 168\u2013178 (2013)","DOI":"10.1109\/CCC.2013.25"},{"issue":"13&14","key":"18_CR9","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.26421\/QIC14.13-14-7","volume":"14","author":"Y Takahashi","year":"2014","unstructured":"Takahashi, Y., Yamazaki, T., Tanaka, K.: Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates. Quantum Information and Computation 14(13&14), 1149\u20131164 (2014)","journal-title":"Quantum Information and Computation"},{"issue":"2","key":"18_CR10","doi-asserted-by":"crossref","first-page":"134","DOI":"10.26421\/QIC4.2-5","volume":"4","author":"BM 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 4(2), 134\u2013145 (2004)","journal-title":"Quantum Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:31:59Z","timestamp":1674567119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}