{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T19:30:14Z","timestamp":1780083014980,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642028816","type":"print"},{"value":"9783642028823","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_42","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"418-428","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Universal Quantum Circuits"],"prefix":"10.1007","author":[{"given":"Debajyoti","family":"Bera","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Fenner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frederic","family":"Green","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve","family":"Homer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Deutsch, D.: Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. In: Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, vol.\u00a0400, pp. 97\u2013117 (1985)","DOI":"10.1098\/rspa.1985.0070"},{"issue":"2","key":"42_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1272729.1272739","volume":"38","author":"D. Bera","year":"2007","unstructured":"Bera, D., Green, F., Homer, S.: Small depth quantum circuits. SIGACT News\u00a038(2), 35\u201350 (2007)","journal-title":"SIGACT News"},{"issue":"4","key":"42_CR3","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0214058","volume":"14","author":"S.A. Cook","year":"1985","unstructured":"Cook, S.A., Hoover, H.J.: A depth-universal circuit. SIAM Journal on Computing\u00a014(4), 833\u2013839 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"42_CR4","doi-asserted-by":"crossref","first-page":"46","DOI":"10.26421\/QIC6.1-3","volume":"6","author":"M. Fang","year":"2006","unstructured":"Fang, M., Fenner, S., Green, F., Homer, S., Zhang, Y.: Quantum lower bounds for fanout. Quantum Information and Computation\u00a06(1), 46\u201357 (2006)","journal-title":"Quantum Information and Computation"},{"key":"42_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 circuits with unbounded fan-out. Theory of Computing\u00a01, 81\u2013103 (2005)","journal-title":"Theory of Computing"},{"issue":"2","key":"42_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1103\/PhysRevLett.79.321","volume":"79","author":"M.A. Nielsen","year":"1997","unstructured":"Nielsen, M.A., Chuang, I.L.: Programmable quantum gate arrays. Phys. Rev. Lett.\u00a079(2), 321\u2013324 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"42_CR7","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Sousa, P.B.M., Ramos, R.V.: Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate. Quantum Information and Computation\u00a07(3), 228\u2013242 (2007)","DOI":"10.26421\/QIC7.3-4"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: Proceedings of the 8th ACM Symposium on the Theory of Computing, pp. 196\u2013203 (1976)","DOI":"10.1145\/800113.803649"},{"key":"42_CR10","unstructured":"Yao, A.C.C.: Quantum circuit complexity. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pp. 352\u2013361 (1993)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T11:30:59Z","timestamp":1633692659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}