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

Journal of Logical and Algebraic Methods in Programming

Semantics of quantum programming languages: Classical control, quantum control

Benoît Valiron

Published Jul 15, 2022• 15 citations
Publisher
DOI
10.1016/j.jlamp.2022.100790

Related papers

Higher-order semantics for quantum programming languages with classical control

Bob Coecke

•Jan 1, 2012•0 citations

Quantum Alternation: Prospects and Problems

Costin Bădescu, Prakash Panangaden

We propose a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement. This notion takes the form of a conditional construct similar to the IF statement in classical programming languages. We show that adding such a quantum IF statement to the QPL programming language simplifies the presentation of several quantum algorithms. This motivates the possibility of extending the denotational semantics of QPL to include this form of quantum alternation. We give a denotational semantics for this extension of QPL based on Kraus decompositions rather than on superoperators. Finally, we clarify the relation between quantum alternation and recursion, and discuss the possibility of lifting the semantics defined by Kraus operators to the superoperator semantics defined by Selinger.

arXiv:1511.01567•Electronic Proceedings in Theoretical Computer Science•Nov 3, 2015•32 citations

Syntax and semantics of quantum programs

Mingsheng Ying

Elsevier eBooks•Jan 1, 2016•0 citations

Exploring a Quantum Programming Language with Concurrency

Jain, Manisha, Fernandes, Vitor, Madeira, Alexandre +1 more

In quantum programming, as in the classical case, concurrent control is a form of program coordination that proves well suited to express complex composition patterns. This paper introduces a quantum programming language with explicit parallel and synchronization primitives and its semantics. The language is explored through a Maude implementation, and illustrated with two non trivial examples.

OASIcs : OpenAccess Series in Informatics•Jan 1, 2025•0 citations

Quantum programming languages: A tentative study

Jiafu Xu, Fangmin Song

Science in China Series F Information Sciences•May 20, 2008•3 citations

Formal semantics of a classical-quantum language

Yuxin Deng, Yuan Feng

arXiv:2107.00804•Theoretical Computer Science•Feb 22, 2022•14 citations
We propose a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement. This notion takes the form of a conditional construct similar to the IF statement in classical programming languages. We show that adding such a quantum IF statement to the QPL programming language simplifies the presentation of several quantum algorithms. This motivates the possibility of extending the denotational semantics of QPL to include this form of quantum alternation. We give a denotational semantics for this extension of QPL based on Kraus decompositions rather than on superoperators. Finally, we clarify the relation between quantum alternation and recursion, and discuss the possibility of lifting the semantics defined by Kraus operators to the superoperator semantics defined by Selinger.