A Quantum-Control Lambda-Calculus with Multiple Measurement Bases

A Quantum-Control Lambda-Calculus with Multiple Measurement Bases
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.

We introduce Lambda-SX, a typed quantum lambda-calculus that supports multiple measurement bases. By tracking duplicability relative to arbitrary bases within the type system, Lambda-SX enables more flexible control and compositional reasoning about measurements. We formalise its syntax, typing rules, subtyping, and operational semantics, and establish its key meta-theoretical properties. This proof-of-concept shows that support for multiple bases can be coherently integrated into the type discipline of quantum programming languages.


💡 Research Summary

The paper introduces Lambda‑SX, a typed quantum lambda‑calculus that extends the earlier Lambda‑S framework by allowing multiple measurement bases to be expressed directly in the language’s syntax and type system. Traditional quantum lambda calculi, including Lambda‑S, treat the computational basis as the sole reference for distinguishing base states from superpositions. This restriction limits the ability to reason about duplicability of quantum data when the state is known to be aligned with another basis, such as the Hadamard basis, and prevents a clean integration of basis‑dependent control flow.

Lambda‑SX addresses this gap by introducing two primitive base types, B (the computational basis) and X (the Hadamard basis), and a modality S(·) that denotes the linear span of a type. Types may be base types, their spans, function types over qubit types, or Cartesian products. A subtyping relation, defined as set inclusion, captures the intuition that a base type is a subset of its span (A ⪯ S(A)) and that spans are idempotent (S(S(A)) ⪯ S(A)). This subtyping also propagates through product and function types, enabling flexible composition of multi‑qubit terms.

The term language (preterms) extends the simply‑typed λ‑calculus with quantum constants (|0⟩, |1⟩, |+⟩, |−⟩), an error term ⊥, linear combinations (t + r, α·t), tensor products (⊗), and list‑style constructors for representing non‑entangled multi‑qubit systems. Two measurement primitives, π_m (measurement in the B basis) and π_m X (measurement in the X basis), first normalise their argument and then produce a probabilistic transition labelled with a probability p∈


Comments & Academic Discussion

Loading comments...

Leave a Comment