Higher-Order Programs with Indefinite Causal Orders: a Linear Approach to Coherent Control of Quantum Processes

• URL: http://arxiv.org/abs/2607.09534v1
• Date: Fri, 10 Jul 2026 15:38:33 GMT
• Title: Higher-Order Programs with Indefinite Causal Orders: a Linear Approach to Coherent Control of Quantum Processes
• Abstract summary: We introduce a higher-order quantum functional language for quantum computation.<n>It supports general quantum computation, not merely the permutation of channels.<n>It can express every quantum channel at first order, and at second order a large subclass of quantum circuits with quantum control.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Processes with indefinite causal orders (ICOs), such as the quantum switch, are higher-order quantum processes that superpose the order in which quantum operations are performed. Such coherent control yields computational advantages but is not faithfully captured by existing quantum programming languages: either they are restricted to the unitary case, and thus cannot combine ICOs with measurement, or they treat coherent control nonlinearly. In both cases, they do not realize the full computational power of ICOs. We introduce a higher-order quantum functional language that supports general quantum computation, not merely the permutation of channels, and whose linear type system allows quantum control to be well-defined beyond the unitary case, on arbitrary quantum channels. We equip this language with a small-step operational semantics that synchronizes measurement outcomes across superposed branches, using device references and a memory function. We also give a denotational semantics by means of completely positive maps. With linearity as the only constraint, some well-typed terms would denote unphysical maps. We therefore impose a typing discipline that goes beyond linearity, and interpret programs in the causal category Caus[CPM], under which every well-typed program is physically meaningful, a property that can be checked statically and efficiently. We prove soundness, and study the language's expressive power: it can express every quantum channel at first order, and at second order a large subclass of the so-called quantum circuits with quantum control (QC-QCs), containing the quantum switch. Last but not least, we show that this language is well-designed enough to be extended to the nonlinear setting with recursion.

Related papers

• Granthi: Higher-Order Quantum Programming via Unitary Wiring [0.0]
  Existing quantum programming languages confine higher order structure to a classical host.<n>Granthi is a unitary higher-order quantum programming language built on three design commitments.<n>Granthi is implemented end-to-end: an OCaml DSL elaborates surface programs through a binder-free core IR to executable quantum circuits via pytket.
  arXiv  Detail & Related papers  (2026-08-20T15:49:09Z)
• Causality in Pure Quantum Computation with Quantum Control [0.9668407688201359]
  Indefinite causal order is a characteristic phenomenon in quantum computation, with examples including the quantum SWITCH and the OCB process.<n>This paper studies such unreal causality issue in a higher-order setting, proposing a typed calculus with quantum control and its categorical semantics.<n>We also present a novel model that is closely related to the Caus construction, by which we prove that some physically-unrealizable processes are not definable in our language.
  arXiv  Detail & Related papers  (2026-07-17T13:10:20Z)
• Programming with Quantum-Controlled Quantum Channels [0.9668407688201359]
  A quantum qubit can exist in a superposition of $0$ and $1$.<n>A naive way to control a program by a qubit is by means of a controlled operation.<n>We develop a novel quantum programming language with quantum control and measurement.
  arXiv  Detail & Related papers  (2026-07-17T11:40:25Z)
• Quantum circuits are just a phase [0.0]
  We introduce a novel quantum programming language for generating unitaries from "just a phase"<n>This minimal language lifts the focus from quantum gates to eigendecomposition, conjugation, and controlled unitaries.
  arXiv  Detail & Related papers  (2025-07-15T19:31:53Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Quantum Control Machine: The Limits of Control Flow in Quantum Programming [9.481014977048282]
  We provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer. We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.
  arXiv  Detail & Related papers  (2023-04-28T17:51:35Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Qunity: A Unified Language for Quantum and Classical Computing (Extended Version) [3.862247454265945]
  We introduce Qunity, a new quantum programming language.<n>Qunity treats quantum computing as a natural generalization of classical computing.<n>We show how Qunity can cleanly express several quantum algorithms.
  arXiv  Detail & Related papers  (2022-04-26T15:34:22Z)
• 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)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.