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:1705.00097 · Lecture notes in computer science

A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls

Alejandro Díaz-Caro

Published Jan 1, 2017• 5 citations
arXivHTMLPDF
DOI
10.1007/978-3-319-71237-6_22

Related papers

A Lambda Calculus for Quantum Computation with Classical Control

Peter Selinger, Benoît Valiron

arXiv:cs/0404056•Lecture notes in computer science•Jan 1, 2005•34 citations

A fully abstract model for quantum controlled lambda calculus

Alejandro Díaz-Caro, Octavio Malherbe

•Jun 1, 2018•1 citation

Decision Diagrams for Density Matrices

Thomas Grurl, Jürgen Fuß, Robert Wille

Synthesis lectures on engineering, science, and technology•Nov 29, 2024•0 citations

A lambda calculus for density matrices.

Alejandro Díaz-Caro

We present a quantum extension to the lambda calculus following the approach of classical control/quantum data. The quantum data is represented by density matrices, and we provide an interpretation for programs as density matrices and functions upon them.

•Apr 28, 2017•0 citations

Theory of Density Matrices

K. Husimi, Yoshihiro Kitano, Toshiyuki Nishiyama

Fortschritte der Physik•Jan 1, 1958•27 citations

Towards a Quantum Calculus

Philippe Jorrand, Simon Perdrix

The aim of this paper is to introduce a general model of quantum computation, the quantum calculus: both unitary transformations and projective measurements are allowed; furthermore a complete classical control, including conditional structures and loops, is available. Complementary to its operational semantics, we introduce a pure denotational semantics for the quantum calculus. Based on probabilistic power domains [Jones, C. and G. D. Plotkin, A probabilistic powerdomain of evaluations, in: LICS, 1989, pp. 186–195. URL http://homepages.inf.ed.ac.uk/gdp/publications/Prob_Powerdomain.pdf], this pure denotational semantics associates with any description of a computation in the quantum calculus its action in a mathematical setting. Adequacy between operational and pure denotational semantics is established. Additionally to this pure denotational semantics, an observable denotational semantics is introduced. Following the work by Selinger, this observable denotational semantics is based on density matrices and super-operators. Finally, we establish an exact abstraction connection between these two semantics.

Electronic Notes in Theoretical Computer Science•Jul 1, 2008•2 citations
The aim of this paper is to introduce a general model of quantum computation, the quantum calculus: both unitary transformations and projective measurements are allowed; furthermore a complete classical control, including conditional structures and loops, is available. Complementary to its operational semantics, we introduce a pure denotational semantics for the quantum calculus. Based on probabilistic power domains [Jones, C. and G. D. Plotkin, A probabilistic powerdomain of evaluations, in: LICS, 1989, pp. 186–195. URL http://homepages.inf.ed.ac.uk/gdp/publications/Prob_Powerdomain.pdf], this pure denotational semantics associates with any description of a computation in the quantum calculus its action in a mathematical setting. Adequacy between operational and pure denotational semantics is established. Additionally to this pure denotational semantics, an observable denotational semantics is introduced. Following the work by Selinger, this observable denotational semantics is based on density matrices and super-operators. Finally, we establish an exact abstraction connection between these two semantics.