Example 9: one qubit perfectly in two uses with NS and PPTp
ProvedQAlgorithms.Papers.Independent.Support50.P11.perfect_qubit_two_usesLet , with input and output , and put . Let be the symmetric and antisymmetric projectors for one input–output pair. Set
The actual bipartite code reconstructed from (29), with , is CPTP, non-signalling in both directions and PPT-preserving. Its average input is and
The pair satisfies every selected primal constraint. The common factor , omitted in print, is necessary for the operational perfect-transmission example.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.12, Example 9: the explicit perfect two-use qubit code.
The printed Lambda lacks a common 1/9; it is corrected here to satisfy (32),(34),(35).
Gamma is (rho tensor I-Lambda)/3 through reconstructedCode. -/
theorem perfect_qubit_two_uses :
let N := piSuperop (fun _ : Fin 2 => wernerHolevoChannel 3 1)
let rho : Matrix (Fin 2 → Fin 3) (Fin 2 → Fin 3) ℂ := (9 : ℂ)⁻¹ • 1
let Z := reconstructedCode 2 (by decide) rho exampleLambda
Primal 2 true true rho exampleLambda ∧ primalObjective N exampleLambda = 1 ∧
IsForwardCode 2 .both Z ∧ codeAverageInput 2 Z = rho ∧ channelFidelity 2 (link 2 N Z) = 1 := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let , and let , acting on matrices indexed by ; explicitly, has entries , where denotes a matrix unit. Set . On , let and , and define
where the factors are grouped so that
Write for transposition of the second subsystem, let , and let , where . Put , and define a map from matrices on to matrices on by
Then is positive semidefinite with trace , and
Here the partial trace in the equality traces out the first factor, and all matrix inequalities mean that the difference is positive semidefinite. Moreover, and are channels, meaning each admits a finite Kraus representation with ; there are channels and such that, for every matrix ,
and . Finally, the map on two-dimensional matrices defined by
satisfies .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.