In this paper we propose an approach to quantum lambda-calculi. The quantum data-classical control paradigm is considered. Starting from a measurement-free untyped quantum lambdaÐcalculus called Q, we will study standard properties such as confluence and subject reduction and some good quantum properties. We will focus on the expressive power, analyzing the relationship with other quantum computational models. Successively, we will add an explicit measurement operator to Q. On the resulting calculus, called Q^{*} we will propose a complete study of reductions sequences regardless their finiteness, proving confluence results. Moreover, since the stronger motivation behind quantum computing is the research of new results in computational complexity, we will also propose a calculus which captures the three classes of quantum polytime complexity, showing an ICC-like approach in the quantum setting.
Curriculum studiorum
