Quantum Orchestras: a Concrete Semantics for Recursive Hybrid Programs

• URL: http://arxiv.org/abs/2607.09605v1
• Date: Fri, 10 Jul 2026 16:59:26 GMT
• Title: Quantum Orchestras: a Concrete Semantics for Recursive Hybrid Programs
• Abstract summary: Many production quantum programming languages represent hybrid quantum computations by extending a classical base language with a quantum effect.<n>We provide a general method for building denotational semantics for such languages, by defining the quantum orchestra monad.<n>We investigate some of the subtleties present when trying to navely extend these definitions to the quantum non-commutative case.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many production quantum programming languages represent hybrid quantum computations by extending a classical base language with a quantum effect, where qubits are addressed by reference, and quantum operations are understood to mutate some external quantum state. However, the semantics of this view of quantum computation remains underdeveloped, especially when the language allows mid-circuit measurements and non-termination. In this work, we provide a general method for building denotational semantics for such languages, by defining the quantum orchestra monad, which precisely captures this style of quantum effect. The monad has a concrete presentation, being based on the formalism of quantum instruments, a common tool in quantum information theory for capturing the action of a quantum process along with its classical outcomes. It acts on the category DCPO, and so enables the interpretation of divergent hybrid programs. The quantum orchestra monad serves as a natural extension of both the classical state monad and the probabilistic powerdomain monad. We investigate some of the subtleties present when trying to naïvely extend these definitions to the quantum non-commutative case.

Related papers

• Quantum Permutations and Beyond Quantum Controlled Reference Frames [0.0]
  We show that quantum permutations yield a generalisation of quantum reference frames in a discrete setting.<n>Strikingly, we find that the non-commutativity of quantum fields, when used as reference systems, is exactly what implies that the change of frame is achieved through a genuine quantum permutation.
  arXiv  Detail & Related papers  (2026-08-17T13:09:45Z)
• Automatic De-Quantization of Quantum Programs Using Constant Propagation [42.89658025409898]
  Every quantum operation is costly, making it crucial to minimize quantum resource usage in near-term algorithms.<n>In this work, we focus on de-quantizing quantum operations to classical computation whenever possible.<n>We formalize a hybrid state model for quantum-classical constant propagation, implement our optimizations in the open-source MQT Core tool, and evaluate them on benchmark circuits.
  arXiv  Detail & Related papers  (2026-05-21T19:21:11Z)
• Denotational semantics for stabiliser quantum programs [0.0]
  We develop a sound, universal and complete denotational semantics for stabiliser operations.<n>We demonstrate the power of the resulting semantics by describing a small, proof-of-concept assembly language for stabiliser programs.
  arXiv  Detail & Related papers  (2025-11-27T19:51:43Z)
• A programming language combining quantum and classical control [0.0]
  Two main notions of control in quantum programming languages are often referred to as "quantum" control and "classical" control.<n>We show that the paradigms may be combined within the same system.
  arXiv  Detail & Related papers  (2025-11-27T15:16:59Z)
• The Quantum Monadology [0.0]
  Modern theory of functional programming languages uses monads for encoding computational side-effects and side-contexts. We analyze the (co)monads on categories of parameterized module spectra induced by Grothendieck's "motivic yoga of operations" We indicate a domain-specific quantum programming language (QS) expressing these monadic quantum effects in transparent do-notation.
  arXiv  Detail & Related papers  (2023-10-24T11:19:24Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Compiling quantamorphisms for the IBM Q Experience [0.0]
  This paper contributes to extending the laws of classical program algebra to quantum programming. It aims at building correct-by-construction quantum circuits to be deployed on quantum devices such as those available at the IBM Q Experience.
  arXiv  Detail & Related papers  (2020-10-21T13:32:24Z)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)
• On quantum ensembles of quantum classifiers [0.0]
  Quantum machine learning seeks to exploit the underlying nature of a quantum computer to enhance machine learning techniques. A specific implementation of the quantum ensemble of quantum classifiers, called the accuracy-weighted quantum ensemble, can be fully dequantised. On the other hand, the general quantum ensemble framework is shown to contain the well-known Deutsch-Jozsa algorithm that notably provides a quantum speedup.
  arXiv  Detail & Related papers  (2020-01-29T13:46:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.