Hadamard-degrading-map
ProvedQAlgorithms.Papers.Independent.Gap20.P04.hadamardDegradingLet be a normalized finite-dimensional isometry with , where . Let and be its receiver and complementary channels. Then for every matrix ,
Let measure the orthonormal receiver basis and prepare at outcome . Their composition is an entanglement-breaking CPTP map with normalized Kraus operators , and
This is the explicit factorized degrading construction for representation (8), not an identification of all degradable channels with Hadamard channels.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P04
open QAlgorithms
open QAlgorithms.Papers.Independent.Claimed50.P24
(Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
dephasingDilation dephasingGamma cloningDilation)
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel dilationPower)
open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)
open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)
open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)
open scoped BigOperators Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I B E J D F : Type}
variable [Fintype I] [Fintype B] [Fintype E]
variable [Fintype J] [Fintype D] [Fintype F]
variable [DecidableEq I] [DecidableEq B] [DecidableEq E]
variable [DecidableEq J] [DecidableEq D] [DecidableEq F]
variable [Nonempty I] [Nonempty B] [Nonempty E]
variable [Nonempty J] [Nonempty D] [Nonempty F]
/-- PDF p.5, (8)--(9): explicit measurement-preparation degrading map for the given
rank-one complementary representation. Coefficients use <xi_c|xi_b>, fixing conjugation. -/
theorem hadamardDegrading (U : Dilation I B E) (hU : PhysicalDilation U)
(xi : B → EuclideanSpace ℂ E) (hxi : ∀ b, ‖xi b‖ = 1)
(zeta : B → EuclideanSpace ℂ I)
(hrep : ∀ b e i, U (b,e) i = xi b e * conj (zeta b i)) :
(∀ rho, receiverChannel U rho = hadamardCoefficient zeta xi rho) ∧
IsKrausFamily (degradingKraus xi) ∧
IsChannel (basisStatePreparation xi ∘ measureBasis) ∧
ChannelEB (basisStatePreparation xi ∘ measureBasis) ∧
(∀ rho, (basisStatePreparation xi ∘ measureBasis) rho = krausApply (degradingKraus xi) rho) ∧
(∀ rho, (basisStatePreparation xi ∘ measureBasis) (receiverChannel U rho) = complementaryChannel U rho) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index types with decidable equality, and let satisfy . Let be unit vectors and arbitrary vectors, with
Define , , , and
Then, for every input matrix ,
Also ; , equivalently first deleting all off-diagonal entries and then preparing the indicated weighted vector projectors, is a channel, meaning it admits a finite Kraus representation with ; applying to the second factor of every unit-vector projector on yields a finite convex combination of products of positive semidefinite trace-one matrices; and, for every matrix on and every matrix on ,
These matrix identities are quantified over all matrices, without a positivity or normalization restriction.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.