# Techniques: Bennett and Stinespring, Together at Last

## What the paper contributes (one paragraph)
This is a categorical-semantics paper. It presents a single universal construction, the restriction affine completion of a monoidal restriction category followed by a quotient that enforces well-pointedness (extensionality), and shows that this one construction recovers two superficially different completions: Stinespring dilation, which realises a quantum channel (CPTP map) as a reversible process on a larger space, and Bennett's method, which makes a classical program reversible by emitting garbage. Instantiated on isometries it yields the category of quantum channels, and on partial injections it yields partial functions. A dual construction reconstructs the underlying reversible categories (unitaries up to global phase, partial injections) as cofree inverse categories. The upshot is a structural statement that both mixed quantum theory and conventional classical computation rest on reversible foundations. The work supplies abstract universal properties and equivalences of categories, not an operational procedure for any concrete device or computation.

## Techniques offered
- **Universal categorical completion unifying Stinespring dilation and Bennett embedding** - a restriction affine completion plus well-pointedness quotient that, as one construction, turns reversible open-system dynamics (isometries, partial injections) into arbitrary closed-system dynamics (quantum channels, partial functions), with a dual cofree-inverse construction going back.
  - guarantee: universal property (the completion is characterised up to unique strong monoidal restriction functor) and monoidal equivalences of categories, including $\Ext(\Lb(\Isometry)) \simeq \CPTP$ and $\Inv(\CPTP) \simeq \Unitary_p$; this is a structural foundations result, not a performance or correctness bound on any computation
  - quote: "We present a universal construction that relates reversible dynamics on open systems to arbitrary dynamics on closed systems: the restriction affine completion of a monoidal restriction category quotiented by well-pointedness."

## Where it could apply
- Target primitive(s): none
- Target application group(s): platforms_tooling (categorical semantics of reversible and quantum computation; no operational supply to a vendor benchmark or result)

## Caveats
Pure category-theory and quantum-foundations paper (QPL 2021). Its content is universal properties, congruences, and equivalences of categories, presented as a unification of two known dilation/embedding theorems. Nothing here is a directly suppliable capability for an external vendor or application result: it is not accreditation, decoding, a fault-tolerant code, compilation or lattice surgery, error mitigation, benchmarking, tomography, resource estimation, classical simulation, or a new device-level algorithm. The single bullet above is a best-fit framing of the abstract construction as categorical platforms tooling; it does not certify, mitigate, or compile any concrete computation.