{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T00:18:38Z","timestamp":1786580318517,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642180729","type":"print"},{"value":"9783642180736","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18073-6_4","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T11:07:19Z","timestamp":1295435239000},"page":"35-46","source":"Crossref","is-referenced-by-count":22,"title":["Computational Depth Complexity of Measurement-Based Quantum Computation"],"prefix":"10.1007","author":[{"given":"Dan","family":"Browne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elham","family":"Kashefi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Perdrix","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"50502","DOI":"10.1103\/PhysRevLett.102.050502","volume":"102","author":"J. Anders","year":"2009","unstructured":"Anders, J., Browne, D.E.: Computational Power of Correlations. Physical Review Letters\u00a0102, 050502 (2009)","journal-title":"Physical Review Letters"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/S0097539795293639","volume":"26","author":"L. Adleman","year":"1997","unstructured":"Adleman, L., DeMarrais, J., Huang, M.: Quantum computability. SIAM Journal on Computing\u00a026, 1524\u20131540 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR3","unstructured":"Broadbent, A., Kashefi, E.: Parallelizing quantum circuits. To appear in Theoretical Computer Science (2007) (arXiv.org preprint 0704.1736)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Danos, V., Kashefi, E., Panangaden, P.: The measurement calculus. J. ACM\u00a054(2) (2007)","DOI":"10.1145\/1219092.1219096"},{"key":"4_CR5","volume-title":"Extended measurement calculus","author":"V. Danos","year":"2010","unstructured":"Danos, V., Kashefi, E., Panangaden, P., Perdrix, S.: Semantic Techniques in quantum Computation. In: Extended measurement calculus. Cambridge University Press, Cambridge (2010)"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.26421\/QIC6.1-3","volume":"6","author":"M. Fang","year":"2003","unstructured":"Fang, M., Fenner, S., Green, F., Homer, S., Zhang, Y.: Quantum lower bounds for fanout. Quantum Information and Computation\u00a06, 46\u201357 (2003)","journal-title":"Quantum Information and Computation"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"220503","DOI":"10.1103\/PhysRevLett.98.220503","volume":"98","author":"D. Gross","year":"2007","unstructured":"Gross, D., Eisert, J.: Novel schemes for measurement-based quantum computation. Physical Review Letters\u00a098, 220503 (2007)","journal-title":"Physical Review Letters"},{"issue":"1","key":"4_CR8","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(1), 35\u201365 (2002)","journal-title":"Quantum Information and Computation"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"3228","DOI":"10.1103\/PhysRevLett.76.3228","volume":"76","author":"R.B. Griffiths","year":"1996","unstructured":"Griffiths, R.B., Niu, C.-s.: Semiclassical Fourier transform for quantum computation. Physical Review Letters\u00a076, 3228\u20133231 (1996)","journal-title":"Physical Review Letters"},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"issue":"1","key":"4_CR11","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\u00a01(1), 81\u2013103 (2005)","journal-title":"Theory of Computing"},{"key":"4_CR12","unstructured":"Jozsa, R.: An introduction to measurement based quantum computation (2005), arXiv pre-print: quant-ph\/0508124"},{"key":"4_CR13","first-page":"307","volume":"249","author":"E. Kashefi","year":"2009","unstructured":"Kashefi, E., Oi, D.K.L., Browne, D., Anders, J., Andersson, E.: Twisted Graph States for Ancilla-driven Universal Quantum Computation. ENTCS\u00a0249, 307\u2013331 (2009)","journal-title":"ENTCS"},{"key":"4_CR14","unstructured":"Moore, C., Nilsson, M.: Parallel Quantum Computation and Quantum Codes (1998), arXiv pre-print:quant-ph\/9808027v1"},{"issue":"3","key":"4_CR15","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(3), 799\u2013815 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1063\/1.1582232","volume":"308","author":"M.A. Nielsen","year":"2003","unstructured":"Nielsen, M.A.: Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Phys. Rev. A\u00a0308, 96\u2013100 (2003)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1142\/S0219749905000785","volume":"3","author":"S. Perdrix","year":"2005","unstructured":"Perdrix, S.: State transfer instead of teleportation in measurement-based quantum computation. International Journal of Quantum Information\u00a03(1), 219\u2013223 (2005)","journal-title":"International Journal of Quantum Information"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"86","author":"R. Raussendorf","year":"2001","unstructured":"Raussendorf, R., Briegel, H.J.: Quantum computing via measurements only. Physical Review Letters\u00a086, 5188\u20135191 (2001)","journal-title":"Physical Review Letters"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Raussendorf, R., Browne, D.E., Briegel, H.J.: Measurement-based quantum computation on cluster states. Physical Review A\u00a068 (2003)","DOI":"10.1103\/PhysRevA.68.022312"},{"key":"4_CR20","unstructured":"Shepherd, D., Bremner, M.J.: Instantaneous Quantum Computation (2008), arXiv pre-print:0809.0847v1"}],"container-title":["Lecture Notes in Computer Science","Theory of Quantum Computation, Communication, and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18073-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T17:01:20Z","timestamp":1637168480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18073-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180729","9783642180736"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18073-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}