scholarly journals Formalization of Metatheory of the Quipper Quantum Programming Language in a Linear Logic

2019 ◽  
Vol 63 (4) ◽  
pp. 967-1002 ◽  
Author(s):  
Mohamed Yousri Mahmoud ◽  
Amy P. Felty
Keyword(s):  
Programming Language ◽  
Linear Logic ◽  
Quantum Programming

Quantum Programming Language NDQJava

2008 ◽  
Vol 19 (1) ◽  
pp. 1-8
Author(s):  
Jia-Fu XU
Keyword(s):  
Programming Language ◽  
Quantum Programming

Towards a quantum programming language

2004 ◽  
Vol 14 (4) ◽  
pp. 527-586 ◽  
Author(s):  
PETER SELINGER
Keyword(s):  
Programming Language ◽  
Quantum Algorithms ◽  
Denotational Semantics ◽  
Quantum Circuit ◽  
Structured Data ◽  
Data Types ◽  
Simple Quantum ◽  
Recursive Procedures ◽  
Quantum Programming ◽  
High Level

We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

scholarly journals OpenQL: A Portable Quantum Programming Framework for Quantum Accelerators

2022 ◽  
Vol 18 (1) ◽  
pp. 1-24
Author(s):  
N. Khammassi ◽  
I. Ashraf ◽  
J. V. Someren ◽  
R. Nane ◽  
A. M. Krol ◽  
...  
Keyword(s):  
Programming Language ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Quantum Operations ◽  
Programming Framework ◽  
Quantum Processor ◽  
Control Electronics ◽  
Quantum Programming ◽  
High Level ◽  
Programming Interface

With the potential of quantum algorithms to solve intractable classical problems, quantum computing is rapidly evolving, and more algorithms are being developed and optimized. Expressing these quantum algorithms using a high-level language and making them executable on a quantum processor while abstracting away hardware details is a challenging task. First, a quantum programming language should provide an intuitive programming interface to describe those algorithms. Then a compiler has to transform the program into a quantum circuit, optimize it, and map it to the target quantum processor respecting the hardware constraints such as the supported quantum operations, the qubit connectivity, and the control electronics limitations. In this article, we propose a quantum programming framework named OpenQL, which includes a high-level quantum programming language and its associated quantum compiler. We present the programming interface of OpenQL, we describe the different layers of the compiler and how we can provide portability over different qubit technologies. Our experiments show that OpenQL allows the execution of the same high-level algorithm on two different qubit technologies, namely superconducting qubits and Si-Spin qubits. Besides the executable code, OpenQL also produces an intermediate quantum assembly code, which is technology independent and can be simulated using the QX simulator.

scholarly journals The Arrow Calculus as a Quantum Programming Language

2009 ◽  
pp. 379-393 ◽  
Author(s):  
Juliana Kaizer Vizzotto ◽  
André Rauber Du Bois ◽  
Amr Sabry
Keyword(s):  
Programming Language ◽  
Quantum Programming

Towards Implementation of a Generalized Architecture for High-Level Quantum Programming Language

2017 ◽  
Vol 56 (8) ◽  
pp. 2376-2412 ◽  
Author(s):  
El-Mahdy M. Ameen ◽  
Hesham A. Ali ◽  
Mofreh M. Salem ◽  
Mahmoud Badawy
Keyword(s):  
Programming Language ◽  
Quantum Programming ◽  
High Level

scholarly journals Propositions-as-types and shared state

2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-30
Author(s):  
Pedro Rocha ◽  
Luís Caires
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Linear Logic ◽  
Natural Extension ◽  
Concurrent Programming ◽  
Type Systems ◽  
Liveness Properties ◽  
Mutable State ◽  
Shared State ◽  
Logical Rules

We develop a principled integration of shared mutable state into a proposition-as-types linear logic interpretation of a session-based concurrent programming language. While the foundation of type systems for the functional core of programming languages often builds on the proposition-as-types correspondence, automatically ensuring strong safety and liveness properties, imperative features have mostly been handled by extra-logical constructions. Our system crucially builds on the integration of nondeterminism and sharing, inspired by logical rules of differential linear logic, and ensures session fidelity, progress, confluence and normalisation, while being able to handle first-class shareable reference cells storing any persistent object. We also show how preservation and, perhaps surprisingly, progress, resiliently survive in a natural extension of our language with first-class locks. We illustrate the expressiveness of our language with examples highlighting detailed features, up to simple shareable concurrent ADTs.

Sign in / Sign up

Export Citation Format

Share Document