arXiv · cs/0703152
Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power
Abstract
We 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ugo Dal Lago, Andrea Masini, Margherita Zorzi. 2007-03-30. Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power. https://searcharxiv.com/abs/cs/0703152
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.