Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power

Simple item page
dc.creatorLago, Ugo Dal
dc.creatorMasini, Andrea
dc.creatorZorzi, Margherita
dc.date2007-03-30
dc.date.accessioned2026-07-07T07:54:48Z
dc.date.available2026-07-07T07:54:48Z
dc.descriptionWe study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We prove subject reduction, confluence and a standardization theorem. Moreover, we prove the computational equivalence of the proposed calculus with a suitable class of quantum circuit families.
dc.description25 pages
dc.identifierhttps://arxiv.org/abs/cs/0703152
dc.identifierhttp://arxiv.org/abs/cs/0703152
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126753
dc.subjectLogic in Computer Science
dc.subjectF.4.1
dc.titleQuantum Lambda Calculi with Classical Control: Syntax and Expressive Power
dc.typetext

Files

Collections

arXiv