Essential Unitarity for Higher-Order Quantum Computation (EXTENDED 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 by multiplicative 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.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2026-11-02
DOI
https://doi.org/10.4204/eptcs.456.1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Essential Unitarity for Higher-Order Quantum Computation (EXTENDED ABSTRACT)

Samson Abramsky, Radha Jagadeesan
Electronic Proceedings in Theoretical Computer Science
Quantum Computing Algorithms and Architecture
article

Essential Unitarity for Higher-Order Quantum Computation (EXTENDED ABSTRACT)

Samson Abramsky, Radha Jagadeesan
article en

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 by multiplicative 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.

Electronic Proceedings in Theoretical Computer ScienceVol. 456
DePaul University (US), University College London (GB)
Openalex Percentile: Top 17%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Essential Unitarity for Higher-Order Quantum Computation (EXTENDED ABSTRACT) — Samson Abramsky, Radha Jagadeesan · Electronic Proceedings in Theoretical Computer Science (2026) | TGRS Research Map | TGRS