Abstract
In this paper, we propose an approach to quantum λ-calculi. The ‘quantum data-classical control’ paradigm is considered. Starting from a measurement-free untyped quantum λ-calculus calledQ, we will study standard properties such as confluence and subject reduction, and some good quantum properties. We will focus on the expressive power, analysing the relationship with other quantum computational models. Successively, we will add an explicit measurement operator toQ. On the resulting calculus, calledQ*, we will propose a complete study of reduction sequences regardless of 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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A linear linear lambda-calculus;Mathematical Structures in Computer Science;2024-05-31
2. A concrete model for a typed linear algebraic lambda calculus;Mathematical Structures in Computer Science;2023-11-21
3. A new connective in natural deduction, and its application to quantum computing;Theoretical Computer Science;2023-05
4. OpenQL: A Portable Quantum Programming Framework for Quantum Accelerators;ACM Journal on Emerging Technologies in Computing Systems;2022-01-31
5. Causality in Higher Order Process Theories;Electronic Proceedings in Theoretical Computer Science;2021-09-18