Q# as a Quantum Algorithmic Language

06/07/2022
by   Kartik Singhal, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2019

A Component-Based Formal Language Workbench

The CBS framework supports component-based specification of programming ...
research
11/11/2020

Petr4: Formal Foundations for P4 Data Planes

P4 is a domain-specific language for programming and specifying packet-p...
research
03/25/2023

Formalization of Quantum Intermediate Representations for Code Safety

Quantum Intermediate Representation (QIR) is a Microsoft-developed, LLVM...
research
08/24/2019

Quantifiers metamorphoses. Generalizations, variations, algorithmic semantics

This article contains ideas and their elaboration for quantifiers, which...
research
04/08/2019

A HoTT Quantum Equational Theory (Extended Version)

This paper presents an equational theory for the QRAM model of quantum c...
research
02/15/2021

MatchKAT: An Algebraic Foundation For Match-Action

We present MatchKAT, an algebraic language for modeling match-action pac...
research
09/04/2019

Explaining SDN Failures via Axiomatisations

This work introduces a concept of explanations with respect to the viola...

Please sign up or login with your details

Forgot password? Click here to reset