{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:31:07Z","timestamp":1767929467470,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642548321","type":"print"},{"value":"9783642548338","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54833-8_20","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:37:17Z","timestamp":1395394637000},"page":"371-391","source":"Crossref","is-referenced-by-count":6,"title":["Measurements in Proof Nets as Higher-Order Quantum Circuits"],"prefix":"10.1007","author":[{"given":"Akira","family":"Yoshimizu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Faggian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"19th IEEE Symposium on Logic in Computer Science (LICS 2004), Turku, Finland, July 14-17. Proceedings. IEEE Computer Society (2004)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: LICS [1], pp. 415\u2013425","DOI":"10.1109\/LICS.2004.1319636"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Faggian, C.: On multiplicative linear logic, modality and quantum circuits. In: Jacobs, B., Selinger, P., Spitters, B. (eds.) QPL. EPTCS, vol.\u00a095, pp. 55\u201366 (2011)","DOI":"10.4204\/EPTCS.95.6"},{"key":"20_CR4","unstructured":"Dal Lago, U., Zorzi, M.: Wave-style token machines and quantum lambda calculi (2013)"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Arch. for Math. Logic\u00a028(3), 181\u2013203 (1989)","journal-title":"Arch. for Math. Logic"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theor. Comput. Sci.\u00a050, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: Geometry of interaction 1: Interpretation of system F. Logic Colloquium\u00a088 (1989)","DOI":"10.1016\/S0049-237X(08)70271-4"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: Proof-nets: The parallel syntax for proof-theory. In: Logic and Algebra, pp. 97\u2013124. Marcel Dekker (1996)","DOI":"10.1201\/9780203748671-4"},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1142\/S021974990700289X","volume":"5","author":"N. Gisin","year":"2007","unstructured":"Gisin, N., Methot, A.A., Scarani, V.: Pseudo-telepathy: input cardinality and Bell-type inequalities. International Journal of Quantum Information\u00a05(4), 525\u2013534 (2007)","journal-title":"International Journal of Quantum Information"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. In: Boehm, H.J., Flanagan, C. (eds.) PLDI, pp. 333\u2013342. ACM (2013)","DOI":"10.1145\/2499370.2462177"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Hoshino, N.: Semantics of higher-order quantum computation via geometry of interaction. In: LICS, pp. 237\u2013246. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.26"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-19805-2_22","volume-title":"Foundations of Software Science and Computational Structures","author":"N. Hoshino","year":"2011","unstructured":"Hoshino, N.: A modified GoI interpretation for a linear functional programming language and its adequacy. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 320\u2013334. Springer, Heidelberg (2011)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-45413-6_23","volume-title":"Typed Lambda Calculi and Applications","author":"O. Laurent","year":"2001","unstructured":"Laurent, O.: A token machine for full geometry of interaction. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 283\u2013297. Springer, Heidelberg (2001)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Mackie, I.: The geometry of interaction machine. In: POPL, pp. 198\u2013208 (1995)","DOI":"10.1145\/199448.199483"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-45208-9_4","volume-title":"Theoretical Computer Science","author":"H.G. Mairson","year":"2003","unstructured":"Mairson, H.G., Terui, K.: On the computational complexity of cut-elimination in linear logic. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol.\u00a02841, pp. 23\u201336. Springer, Heidelberg (2003)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-38164-5_13","volume-title":"Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky","author":"O. Malherbe","year":"2013","unstructured":"Malherbe, O., Scott, P., Selinger, P.: Presheaf models of quantum computation: An outline. In: Coecke, B., Ong, L., Panangaden, P. (eds.) Computation, Logic, Games and Quantum Foundations. LNCS, vol.\u00a07860, pp. 178\u2013194. Springer, Heidelberg (2013)"},{"key":"20_CR17","unstructured":"Melli\u00e8s, P.A.: Categorical semantics of linear logic. Panoramas et Synth\u00e8ses, ch. 1, vol.\u00a027, pp. 15\u2013215. Soci\u00e9t\u00e9 Math\u00e9matique de France (2009)"},{"key":"20_CR18","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge Univ. Press (2000)"},{"key":"20_CR19","unstructured":"\u00d6mer, B.: Quantum programming in QCL. Master\u2019s thesis, Institute of Information Systems, Technical University of Vienna (2000)"},{"key":"20_CR20","unstructured":"Pinto, J.S.: Implantation Parall\u00e8le avec la Logique Lin\u00e9aire (Applications des R\u00e9seaux d\u2019Interaction et de la G\u00e9om\u00e9trie de l\u2019Interaction). Ph.D. thesis, \u00c9cole Polytechnique, Main text in English (2001)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Selinger, P., Valiron, B.: Quantum lambda calculus. In: Gay, S., Mackie, I. (eds.) Semantic Techniques in Quantum Computation, pp. 135\u2013172. Cambridge Univ. Press (2009)","DOI":"10.1017\/CBO9781139193313.005"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Terui, K.: Proof nets and boolean circuits. In: LICS [1], pp. 182\u2013191","DOI":"10.1109\/LICS.2004.1319612"},{"issue":"5","key":"20_CR23","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1137\/S0097539703432165","volume":"33","author":"A. Tonder van","year":"2004","unstructured":"van Tonder, A.: A lambda calculus for quantum computation. SIAM J. Comput.\u00a033(5), 1109\u20131135 (2004)","journal-title":"SIAM J. Comput."},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Yoshimizu, A., Hasuo, I., Faggian, C., Dal Lago, U.: Measurements in proof nets as higher-order quantum circuits. Extended version with proofs (2014), www-mmm.is.s.u-tokyo.ac.jp\/~ayoshimizu","DOI":"10.1007\/978-3-642-54833-8_20"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54833-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:45:51Z","timestamp":1746157551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54833-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548321","9783642548338"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54833-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}