A lambda calculus for quantum computation with classical control
<|reference_start|>A lambda calculus for quantum computation with classical control: The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and we 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.<|reference_end|>
@article{selinger2004a,
    title={A lambda calculus for quantum computation with classical control},
    author={Peter Selinger, Benoit Valiron},
    journal={Proc. of TLCA 2005},
    year={2004},
    doi={10.1007/11417170_26},
    archivePrefix={arXiv},
    eprint={cs/0404056},
    primaryClass={cs.LO}
}