Section IV.A and reference note [28]: dephasing private capacity
OpenQAlgorithms.Papers.Independent.Support50.P07.dephasing_privateCapacityChoose any Pauli axis and . For the receiver map , with any full isometric dilation,
The private capacity uses the full trace-norm operational criterion above, arbitrary mixed block inputs, uniform messages and normalized POVMs; is binary entropy in bits. All parameter endpoints and all three Pauli axes are included.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Support50.P07
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
dilationPower idealJoint maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)
open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)
variable {A B E C D F : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]
variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]
/-- PDF pp.6–7 and note [28], p.8: general channel private capacity, allowing
arbitrary mixed and entangled signal states, equals the dephasing formula.
All three Pauli axes are included, as in IV.A and the proof of Theorem 12. -/
theorem dephasing_privateCapacity [Nonempty E]
(U : Matrix (Fin 2 × E) (Fin 2) ℂ)
(hU : IsIsometry U) (axis : Fin 3) (p : ℝ) (hp : p ∈ Set.Icc 0 1)
(hmap : receiverChannel U =
qubitPauliProbabilityChannel (fun i => if i = axis then p else 0)) :
fullTracePrivateCapacity U = 1 - binEntropy2 p := by sorry
end QAlgorithms.Papers.Independent.Support50.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite, nonempty type with decidable equality, let satisfy , choose an index , and let . Put
and assume, as equality on every matrix , that
Define to be the real supremum of all with the following property: for every error tolerance and slack , there is an integer such that every admits an integer , density matrices on , and matrices on the receiver output with , such that and the following trace norm error is strictly less than . Here density means positive semidefinite with trace ; form the matrix , indexed by message , decoded label , and environment index , with zero entries between different classical labels and blocks
The error is
The tensor dilation has entries given by products of the corresponding entries of . Writing , with , the assertion is
Both endpoints and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.