Unitary quantum channel
DefinitionICSCompute_Supplement_IsUnitaryChannelcomplexity-theoryindefinite-causal-orderp2o-gran-per-chapterp2o-plan-paperp2o-v1process-matricesquantum-information
Let be a linear map from the matrices on a register to the matrices on a register . Then is a unitary channel if there is a matrix from to with and such that
For qubit registers and the two unitarity conditions force , so this is the paper's notion of an -to- qubit channel that acts as conjugation by a unitary. It is the property "the generated channel is unitary" in Theorems 1.1, 5.1 and 5.2.
Formalization Note The paper asks for on every -qubit state ; since is linear and states span all matrices, this is the same as the identity on every matrix. A map of this form is automatically a quantum channel.
Definition code
import Mathlib
namespace ICSCompute.Supplement
/-- **Unitary quantum channel** (Shmueli, *What Can Be Computed with Indefinite Causal
Structure?*, arXiv:2610.40573, version of 2026-11-03, sha256 d3e36399…b606, Definition 4.6,
p.20 (PDF p.22)): "Let `n ∈ ℕ ∪ {0}` and let `C` be an `n`-to-`n` qubit quantum channel, as in
Definition 3.13. We say that `C` is unitary if there is a unitary matrix `U_C ∈ ℂ^{2ⁿ×2ⁿ}` such
that `C(ρ) = U_C ρ U_C†` for every `n`-qubit state `ρ`."
**Formalization Note** The input and output registers are index types `ι`, `κ`; `U` is a matrix
from `ι` to `κ` with `U†U = I` and `UU† = I`, which forces `|ι| = |κ|` and for `ι = κ` is
exactly membership in `Matrix.unitaryGroup`. For qubit registers `S(r)`, `S(ℓ)` it forces
`r = ℓ`, the paper's "`n`-to-`n`". The identity `Φ(X) = U X U†` is required for every matrix `X`,
which is equivalent to the paper's "for every state `ρ`" because `Φ` is linear and states span
all matrices; a map of this form is automatically a quantum channel. -/
def IsUnitaryChannel {ι κ : Type*} [Fintype ι] [Fintype κ] [DecidableEq ι] [DecidableEq κ]
(Φ : Matrix ι ι ℂ →ₗ[ℂ] Matrix κ κ ℂ) : Prop :=
∃ U : Matrix κ ι ℂ, U.conjTranspose * U = 1 ∧ U * U.conjTranspose = 1 ∧
∀ X : Matrix ι ι ℂ, Φ X = U * X * U.conjTranspose
end ICSCompute.Supplement
Source
Shmueli, What Can Be Computed with Indefinite Causal Structure?, arXiv:2610.40573 (version of 2026-11-03, sha256 d3e36399…b606), Definition 4.6, p.20 (PDF p.22)