Appendix C — characterization of condition (5) by Hilbert–Schmidt terms
ProvedOCB2012.process_condition_iff_allowedThroughout, (Alice's input and output) and (Bob's) are finite-dimensional systems; operators on are complex matrices in that tensor order. A CJ matrix of a CPTP map satisfies and . For each system fix a Hilbert–Schmidt basis with , Hermitian and traceless for , and . A term is allowed if its set of non-identity factors is one of (Fig. 3). Then for every Hermitian on :
holds if and only if and for every term that is not allowed, i.e. the Hilbert–Schmidt coefficients of vanish outside the allowed types and .
Formalization Note The coefficient equals by orthogonality, so vanishing coefficients are stated as vanishing traces. Hermiticity of and of the basis matches the source's restriction to real coefficients (Eq. (17)).
import Mathlib import Definitions.Def_PeresTerno_kraus_basics import Definitions.Def_OCB2012_defs open Matrix open scoped Kronecker ComplexOrder
namespace OCB2012
theorem process_condition_iff_allowed {a1 a2 b1 b2 : Type*} [Fintype a1] [Fintype a2]
[Fintype b1] [Fintype b2] [DecidableEq a1] [DecidableEq a2] [DecidableEq b1] [DecidableEq b2]
(BA1 : HSBasis a1) (BA2 : HSBasis a2) (BB1 : HSBasis b1) (BB2 : HSBasis b2)
(W : Matrix ((a1 × a2) × (b1 × b2)) ((a1 × a2) × (b1 × b2)) ℂ) (hW : W.IsHermitian) :
(∀ (MA : Matrix (a1 × a2) (a1 × a2) ℂ) (MB : Matrix (b1 × b2) (b1 × b2) ℂ),
IsCPTP_CJ MA → IsCPTP_CJ MB → prob W MA MB = 1) ↔
(W.trace = (Fintype.card a2 * Fintype.card b2 : ℂ) ∧
∀ μ ν l γ, ¬ AllowedType μ.isSome ν.isSome l.isSome γ.isSome →
(W * ((BA1.σ μ ⊗ₖ BA2.σ ν) ⊗ₖ (BB1.σ l ⊗ₖ BB2.σ γ))).trace = 0) := by sorry
end OCB2012Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let be arbitrary finite types with decidable equality. They index the systems . Write , , , . All matrices have complex entries. A matrix on the composite system is indexed by , and denotes the Kronecker product, with . So acts on in that factor order.
Hilbert–Schmidt bases (given data). The theorem takes four arbitrary Hilbert–Schmidt bases , one for each system. For a finite type with , such a basis consists of the following data:
- a finite index type with decidable equality;
- a family of complex matrices such that:
- each is Hermitian;
- for every ;
- for all ;
- .
The extended family is defined by (the "identity" index ) and for (the "non-identity" indices). No further property is assumed, such as spanning or linear independence, beyond what follows from these axioms.
Edge cases.
- If is empty, then and the condition cannot hold. So no Hilbert–Schmidt basis exists for an empty type. Since the theorem takes bases for all four systems as inputs, it only ever applies when are all nonempty.
- If , then is empty and the only basis element is .
Allowed types. For a quadruple of flags for , each flag is "true" exactly when the corresponding basis index is a non-identity index. The quadruple is allowed iff
In words: a non-identity factor on requires a non-identity factor on and an identity factor on . A non-identity factor on requires a non-identity factor on and an identity factor on .
Listed by the set of systems carrying a non-identity factor, the 16 cases split as follows.
- Allowed (8): , , , , , , , .
- Not allowed (8): , , , , , , , .
Every set containing both and is not allowed.
CPTP Choi matrices. For finite types , a matrix indexed by is called a CPTP Choi matrix, written , iff both of the following hold:
- is positive semidefinite, meaning Hermitian with (as a real number) for all ;
- its partial trace over the second factor is the identity:
For on this means . For on it means .
The probability is defined as the complex number
Statement. Let be any Hermitian matrix on . Positive semidefiniteness is not assumed. Then the following two conditions are equivalent: each implies the other.
(L) For every matrix on and every matrix on such that and both hold,
as a complex number.
(R) Both of the following hold.
- The trace condition holds as an equality of complex numbers:
-
Choose indices , , , , each either the identity index or a non-identity index of the basis on its own system:
- for ;
- for ;
- for ;
- for .
For every such choice whose non-identity pattern is not allowed (one of the 8 non-allowed cases above),
Allowed patterns, including the all-identity term, receive no constraint from clause 2.
Quantifier scope. The equivalence is asserted for all finite types , for every choice of the four bases, and for every Hermitian . Clause 2 of (R) refers to the specific given bases, so the theorem claims that (L) holds iff the vanishing condition holds for each one of these arbitrary basis choices. Because bases cannot exist for empty types, the statement is vacuous whenever any of is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.