Abstract
In this paper a programming language, qGCL, is presented for the expression of quantum algorithms. It contains the features required to program a ‘universal’ quantum computer (including initialisation and observation), has a formal semantics and body of laws, and provides a refinement calculus supporting the verification and derivation of programs against their specifications. A representative selection of quantum algorithms are expressed in the language and one of them is derived from its specification.
Cite
CITATION STYLE
Sanders, J. W., & Zuliani, P. (2000). Quantum programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1837, pp. 80–99). Springer Verlag. https://doi.org/10.1007/10722010_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
