Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 22
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Cho, Kenta 2016. Semantics for a Quantum Programming Language by Operator Algebras. New Generation Computing, Vol. 34, Issue. 1-2, p. 25.


    Rambo, Timothy M. Altepeter, Joseph B. Kumar, Prem and D'Ariano, G. Mauro 2016. Functional quantum computing: An optical approach. Physical Review A, Vol. 93, Issue. 5,


    Ying, Mingsheng 2016. Foundations of Quantum Programming.


    2016. Foundations of Quantum Programming.


    Dal Lago, Ugo and Zorzi, Margherita 2015. Wave-Style Token Machines and Quantum Lambda Calculi. Electronic Proceedings in Theoretical Computer Science, Vol. 176, p. 64.


    Heunen, Chris and Karvonen, Martti 2015. Reversible Monadic Computing. Electronic Notes in Theoretical Computer Science, Vol. 319, p. 217.


    Cho, Kenta 2014. Semantics for a Quantum Programming Language by Operator Algebras. Electronic Proceedings in Theoretical Computer Science, Vol. 172, p. 165.


    Chiribella, Giulio D’Ariano, Giacomo Mauro Perinotti, Paolo and Valiron, Benoit 2013. Quantum computations without definite causal structure. Physical Review A, Vol. 88, Issue. 2,


    Jacobs, Bart 2013. On Block Structures in Quantum Computation. Electronic Notes in Theoretical Computer Science, Vol. 298, p. 233.


    Valiron, Benoît 2013. Quantum Computation: From a Programmer’s Perspective. New Generation Computing, Vol. 31, Issue. 1, p. 1.


    Vizzotto, Juliana Kaizer 2013. 2013 2nd Workshop-School on Theoretical Computer Science. p. 9.

    Assaf, Ali and Perdrix, Simon 2012. Completeness of algebraic CPS simulations. Electronic Proceedings in Theoretical Computer Science, Vol. 88, p. 16.


    Dal Lago, Ugo and Faggian, Claudia 2012. On Multiplicative Linear Logic, Modality and Quantum Circuits. Electronic Proceedings in Theoretical Computer Science, Vol. 95, p. 55.


    Dal Lago, Ugo Masini, Andrea and Zorzi, Margherita 2011. Confluence Results for a Quantum Lambda Calculus with Measurements. Electronic Notes in Theoretical Computer Science, Vol. 270, Issue. 2, p. 251.


    Delbecque, Yannick 2011. Game Semantics for Quantum Data. Electronic Notes in Theoretical Computer Science, Vol. 270, Issue. 1, p. 41.


    Díaz-Caro, Alejandro Arrighi, Pablo Gadella, Manuel and Grattage, Jonathan 2011. Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits. Electronic Notes in Theoretical Computer Science, Vol. 270, Issue. 1, p. 59.


    Dal Lago, Ugo Masini, Andrea and Zorzi, Margherita 2010. Quantum implicit computational complexity. Theoretical Computer Science, Vol. 411, Issue. 2, p. 377.


    Ying, Mingsheng 2010. Quantum computation, quantum theory and AI. Artificial Intelligence, Vol. 174, Issue. 2, p. 162.


    LAGO, UGO DAL MASINI, ANDREA and ZORZI, MARGHERITA 2009. On a measurement-free quantum lambda calculus with classical control. Mathematical Structures in Computer Science, Vol. 19, Issue. 02, p. 297.


    Delbecque, Yannick and Panagaden, Prakash 2008. Game Semantics for Quantum Stores. Electronic Notes in Theoretical Computer Science, Vol. 218, p. 153.


    ×
  • Mathematical Structures in Computer Science, Volume 16, Issue 3
  • June 2006, pp. 527-552

A lambda calculus for quantum computation with classical control

  • PETER SELINGER (a1) and BENOIT VALIRON (a2)
  • DOI: http://dx.doi.org/10.1017/S0960129506005238
  • Published online: 04 July 2006
Abstract

In this paper we develop a functional programming language for quantum computers by extending the simply-typed lambda calculus with quantum types and operations. The design of this language adheres to the ‘quantum data, classical control’ paradigm, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and give a type system using affine intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×