Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cs/0404056 · Lecture notes in computer science

A Lambda Calculus for Quantum Computation with Classical Control

Peter Selinger, Benoît Valiron

Published Jan 1, 2005• 34 citations
arXivHTMLPDF
DOI
10.1007/11417170_26

Related papers

Two linearities for quantum computing in the lambda calculus

Alejandro Díaz-Caro, Gilles Dowek B, Juan Pablo Rinaldi

arXiv:1601.04294•Biosystems•Nov 19, 2019•18 citations

A fully abstract model for quantum controlled lambda calculus

Alejandro Díaz-Caro, Octavio Malherbe

•Jun 1, 2018•1 citation

A Double Effect λ-calculus for Quantum Computation

Juliana Kaizer Vizzotto, Bruno Crestani Calegaro, Eduardo Kessler Piveta

Lecture notes in computer science•Jan 1, 2013•6 citations

A Quantum-Control Lambda-Calculus with Multiple Measurement Bases

Alejandro Díaz-Caro, Nicolas A. Monzon

arXiv:2506.16244•Lecture notes in computer science•Oct 30, 2025•0 citations

Higher-order semantics for quantum programming languages with classical control

Philip Atzemoglou

This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known problems in quantum computation.

arXiv:1311.6563•Nov 26, 2013•1 citation

Higher-order semantics for quantum programming languages with classical control

George Philip Atzemoglou

This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known problems in quantum computation: Quantum Key Distribution, the quantum Fourier transform, and the teleportation protocol./

•Jan 1, 2012•1 citation
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known problems in quantum computation.
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known problems in quantum computation: Quantum Key Distribution, the quantum Fourier transform, and the teleportation protocol./