{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:42:29Z","timestamp":1770295349635,"version":"3.49.0"},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2009,4]]},"abstract":"<jats:p>We study a measurement-free, untyped \u03bb-calculus with quantum data and classical control. This work arises from previous proposals by Selinger and Valiron, and Van Tonder. We focus on operational and expressiveness issues, rather than (denotational) semantics. We prove subject reduction and confluence, and a standardisation theorem. Moreover, we prove the computational equivalence of the proposed calculus with a suitable class of quantum circuit families.<\/jats:p>","DOI":"10.1017\/s096012950800741x","type":"journal-article","created":{"date-parts":[[2009,2,16]],"date-time":"2009-02-16T05:43:15Z","timestamp":1234762995000},"page":"297-335","source":"Crossref","is-referenced-by-count":13,"title":["On a measurement-free quantum lambda calculus with classical control"],"prefix":"10.1017","volume":"19","author":[{"given":"UGO DAL","family":"LAGO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANDREA","family":"MASINI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARGHERITA","family":"ZORZI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2009,4,1]]},"reference":[{"key":"S096012950800741X_ref","unstructured":"Yao A. (1993) Quantum Circuit Complexity. In: Proc. 34th Annual Symposium on Foundations of Computer Science, IEEE 352\u2013360."},{"key":"S096012950800741X_ref23","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"Wadsworth","year":"1980"},{"key":"S096012950800741X_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58027-1_24"},{"key":"S096012950800741X_ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703432165"},{"key":"S096012950800741X_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_17"},{"key":"S096012950800741X_ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"S096012950800741X_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129506005238"},{"key":"S096012950800741X_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004256"},{"key":"S096012950800741X_ref10","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-36-00227-2"},{"key":"S096012950800741X_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02650179"},{"key":"S096012950800741X_ref13","unstructured":"Maymin P. (1997) The lambda-q calculus can efficiently simulate quantum computers. arXiv:quant-ph\/9702057."},{"key":"S096012950800741X_ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"S096012950800741X_ref11","doi-asserted-by":"crossref","unstructured":"Knill E. (1996) Conventions for quantum pseudocode. Tech. Rep. LAUR-96-2724, Los Alamos National Laboratory.","DOI":"10.2172\/366453"},{"key":"S096012950800741X_ref7","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1985.0070"},{"key":"S096012950800741X_ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219096"},{"key":"S096012950800741X_ref4","volume-title":"Quantum mechanics","author":"Basdevant","year":"2005"},{"key":"S096012950800741X_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.12.015"},{"key":"S096012950800741X_ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447323"},{"key":"S096012950800741X_ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.1"},{"key":"S096012950800741X_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70590-1_2"},{"key":"S096012950800741X_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49208-9_9"},{"key":"S096012950800741X_ref12","unstructured":"Maymin P. (1996) Extending the lambda calculus to express randomized and quantumized algorithms. arXiv:quant-ph\/9612052."},{"key":"S096012950800741X_ref14","volume-title":"Quantum computation and quantum information","author":"Nielsen","year":"2000"},{"key":"S096012950800741X_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00111-6"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096012950800741X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T21:57:04Z","timestamp":1558130224000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096012950800741X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["S096012950800741X"],"URL":"https:\/\/doi.org\/10.1017\/s096012950800741x","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4]]}}}