generalized-dephasing-structure
ProvedQAlgorithms.Papers.Independent.Gap20.P04.generalizedDephasingStructureLet and be nonzero finite-dimensional registers, choose a preferred orthonormal input/receiver basis, and let have norm one, without an orthogonality requirement. The map is an isometry, and its receiver channel is Hadamard. For complete dephasing in that basis,
These identities explain why diagonal input marginals suffice in the subsequent CQ and CE optimizations.
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 pp.5--6, (10): generalized dephasing is Hadamard and commutes with complete
dephasing; the complement depends only on input diagonals. No orthogonality of v_i required. -/
theorem generalizedDephasingStructure (v : I → EuclideanSpace ℂ E)
(hI : Nonempty I) (hv : ∀ i, ‖v i‖ = 1) :
PhysicalDilation (gdDilation v) ∧ Hadamard (gdDilation v) ∧
(∀ rho, receiverChannel (gdDilation v) (diagonal rho) = diagonal rho) ∧
(∀ rho, diagonal (receiverChannel (gdDilation v) rho) = diagonal rho) ∧
(∀ rho, complementaryChannel (gdDilation v) (diagonal rho) = complementaryChannel (gdDilation v) rho) ∧
(∀ rho, complementaryChannel (gdDilation v) rho = ∑ i, rho i i • pureDensity (v i)) := 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, with nonemptiness of also supplied explicitly, and let satisfy for every . Define by , let , , and let retain diagonal entries and set off-diagonal entries to zero. Then is a physical dilation, meaning its input, receiver, and environment index types are nonempty and . Its complementary map has the following property: applying it to the second factor of every unit-vector projector on yields a finite convex combination of products of density matrices, where each factor is positive semidefinite with trace . Furthermore, for every matrix on , without any positivity or normalization assumption,
One-dimensional registers are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.