Abstract
Q# is a standalone domain-specific programming language from Microsoft for writing and running quantum programs. Like most industrial languages, it was designed without a formal specification, which can naturally lead to ambiguity in its interpretation. We aim to provide a formal language definition for Q#, placing the language on a solid mathematical foundation and enabling further evolution of its design and type system. This paper presents λQ#, an idealized version of Q# that illustrates how we may view Q# as a quantum ALGOL (algorithmic language). We show the safety properties enforced by λQ#'s type system and present its equational semantics based on a fully complete algebraic theory by Staton.
Cite
CITATION STYLE
Singhal, K., Hietala, K., Marshall, S., & Rand, R. (2023). Q# as a Quantum Algorithmic Language. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 394, pp. 170–191). Open Publishing Association. https://doi.org/10.4204/EPTCS.394.10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.