Eq. (7) — a valid four-qubit process matrix
ProvedOCB2012.W7_isProcessMatrixOn four qubits , the matrix
is a process matrix: (Eq. (4)), and for all with and (Eq. (5)).
import Mathlib import Definitions.Def_PeresTerno_kraus_basics import Definitions.Def_OCB2012_defs open Matrix open scoped Kronecker ComplexOrder
namespace OCB2012 theorem W7_isProcessMatrix : IsProcessMatrix W7 := by sorry end OCB2012
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of OCB2012.W7_isProcessMatrix. The statement has no binders, no hypotheses and no typeclass parameters of its own. It asserts one fixed proposition about one fixed complex matrix .
Setting. A qubit index set is . There are four qubit systems, called . Rows and columns of are indexed by nested pairs with each , so the outer split is "Alice part " by "Bob part ". The Kronecker product used throughout is
so the left factor is the first index component. The fixed matrices are
in the basis ordered . is the identity of the appropriate size.
The matrix . By definition,
Here is the real square root, cast to . With the index ordering above, the first bracketed term is on times on , with identity on and . The second term is on , on and on , with identity on . So
Write and . Entrywise, the entry in row and column is zero unless , and . When those three hold:
- if (a diagonal entry), the entry is ;
- if , the entry is .
All entries are real.
Auxiliary notions, unfolded.
- Partial trace over the second factor. For a matrix indexed by pairs ,
- CPTP Choi condition. A complex matrix indexed by satisfies the condition when both of these hold:
- is positive semidefinite, meaning Hermitian with real and for every ;
- , where the trace is over the second component and the result is indexed by .
- Probability. For indexed by and indexed by , . This is an ordinary matrix product and full trace.
What is asserted. is a "process matrix" in the following sense. Both conditions hold:
- is positive semidefinite: Hermitian, and is real and for every .
- Take any two complex matrices: indexed by and indexed by . Suppose both are positive semidefinite. Suppose also , with the trace over Alice's second index , and , with the trace over Bob's second index . Then
holds as an equality of complex numbers. So the real part is and the imaginary part is .
Edge cases and strength. All dimensions are fixed at , so there are no degenerate sizes. The universally quantified class in condition 2 is nonempty; for example, belongs to it. The class is not restricted beyond the two stated conditions: any complex PSD matrix whose partial trace over the second factor is the identity counts. The theorem is a pure conjunction of conditions 1 and 2. It claims nothing about necessity, uniqueness, or any other matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.