OpenQASM 3: A broader and deeper quantum assembly language

Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was proposed as an imperative programming language for quantum circuits based on earlier QASM dialects. In principle, any quantum computation could be described using OpenQASM 2, but there is a need to describe a broader set of circuits beyond the language of qubits and gates. By examining interactive use cases, we recognize two different timescales of quantum-classical interactions: real-time classical computations that must be performed within the coherence times of the qubits, and near-time computations with less stringent timing. Since the near-time domain is adequately described by existing programming frameworks, we choose in OpenQASM 3 to focus on the real-time domain, which must be more tightly coupled to the execution of quantum operations. We add support for arbitrary control flow as well as calling external classical functions. In addition, we recognize the need to describe circuits at multiple levels of specificity, and therefore we extend the language to include timing, pulse control, and gate modifiers. These new language features create a multi-level intermediate representation for circuit development and optimization, as well as control sequence implementation for calibration, characterization, and error mitigation.

Comparing Quantum Programming Frameworks: IBM Qiskit, Microsoft Q#, and Quantinuum’s New Stack | HackerNoon

Compare IBM Qiskit, Microsoft Q#, and Quantinuum's Guppy/Selene/Helios quantum programming platforms. Complete guide with VQE code examples.

Quantum Programming: An In-Depth Introduction and Framework Comparison

Quantum programming is an emerging discipline that challenges developers to think beyond classical bits and deterministic algorithms. Instead of manipulating binary 0s and 1s, quantum programmers work with qubits that can exist in multiple states at once and harness phenomena like superposition and entanglement to perform computations in fundamentally new ways. Quantum programming demands a shift in thinking: information is encoded in probability amplitudes, operations are reversible linear transformations, and results emerge from statistical patterns rather than single-run outputs. The reward is the ability to tackle certain computational problems that are intractable for classical computers, by exploiting the exponential state

Laws of Quantum Programming

In this paper, we investigate the fundamental laws of quantum programming. We extend a comprehensive set of Hoare et al.'s basic laws of classical programming to the quantum setting. These laws characterise the algebraic properties of quantum programs, such as the distributivity of sequential composition over (quantum) if-statements and the unfolding of nested (quantum) if-statements. At the same time, we clarify some subtle differences between certain laws of classical programming and their quantum counterparts. Additionally, we derive a fixpoint characterization of quantum while-loops and a loop-based realisation of tail recursion in quantum programming. Furthermore, we establish two normal form theorems: one for quantum circuits and one for finite quantum programs. The theory in which these laws are established is formalised in the Coq proof assistant, and all of these laws are mechanically verified. As an application case of our laws, we present a formal derivation of the principle of deferred measurements in dynamic quantum circuits. We expect that these laws can be utilized in correctness-preserving transformation, compilation, and automatic code optimization in quantum programming. In particular, because these laws are formally verified in Coq, they can be confidently applied in quantum program development.

Fraunhofer FOKUS

Fraunhofer FOKUS

QP 2024 - The Second International Workshop on the Art, Science, and Engineering of Quantum Programming - ‹Programming› 2024

Classical computing is reaching its limit. Thus, it is necessary to revolutionize the current computing form with novel computing paradigms. Towards this end, quantum computing is one of the promising computing paradigms. However, programming quantum computers differs significantly from classical computing due to novel features of quantum computing, such as superposition and entanglement. QP 2024 will provide a platform for researchers and practitioners interested in the Art, Science, and Engineering of Quantum Programming and its relation with classical programming to discuss research ch ...

Qrisp 0.3 — documentation