Essential unitarity ensures information preservation in higher-order quantum computing

Essential Unitarity for Higher-Order Quantum Computation (Extended Abstract)

Logic in Computer Science

Summary

Quantum computers use special building blocks called unitary operations to process information without loss. This paper extends the idea of unitarity to more complex, higher-order quantum systems that manage information across multiple layers. The authors introduce a new framework that guarantees these advanced quantum operations preserve information correctly, even when they interact in complicated ways. This work helps better understand and design quantum programs that involve controlling other quantum programs.

What this means in practice

  • For quantum software developers: Design correct higher-order quantum functions that guarantee no information loss during execution using the essential unitarity condition.
  • For quantum hardware architects: Implement quantum circuits involving coherent control and higher-order quantum switching with guaranteed unitary behavior at all system levels.

A theory result. No direct application yet.

Authors

Samson Abramsky, Radha Jagadeesan

Abstract

We develop a boundary-centric semantic framework for higher-order quantum computation, building on the Kelly-Laplaza description of compact closure and Abramsky's execution account. In the semantic carrier Perm(C), morphisms are complex-linear combinations of polarized boundary linkings, composed by execution. Finite-family addresses provide coherent control over finite-level quantum registers (qudits) while retaining the multiplicative boundary structure. We identify essential unitarity, a boundary condition extending ordinary unitarity to higher-order interfaces. On positive qudit registers it coincides with ordinary matrix unitarity; at higher order it expresses preservation of information across the full polarized boundary. We define a unit-free coherent quantum core generated bymultiplicative wiring, unitary gates on positive qudit registers, and contextual coherent control, and prove that every one of its morphisms is essentially unitary. The framework realizes an applied coherent quantum switch and the unitary stages of equal-ratio one-slot supermap dilations with explicit memory. Complete proofs appear in the full version of this paper.