Theorem-5
OpenQAlgorithms.Papers.Independent.Gap20.P04.theorem5Let be an integer and the universal qubit cloner specified by isometry (12), with the entire -dimensional symmetric receiver output and -dimensional environment. Put , and for set for , and for . Write , with .
The generating coordinate families are
For a family , , let be its closed convex resource-monotone hull: classical and quantum rates can be lowered. Let instead allow lowering the classical rate and increasing entanglement consumption, with nonnegative rates in both cases. These hulls include time sharing and endpoint limits.
They determine exactly
This concerns the whole symmetric output, rather than an individual clone.
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.6,12--15, Theorem 5: the whole symmetric-output cloner, N>=1.
The parent isometry (12) supplies the normalization omitted in the printed complementaryChannel Kraus list. -/
theorem theorem5 (N : ℕ) (hN : 0 < N) :
capacityCQ (cloningDilation N) = cqHull (cloningCQ N) ∧
capacityCE (cloningDilation N) = ceHull (cloningCE N) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer , including , put and define by
For a matrix , let and be the receiver and environment partial traces of . A valid purified input family comprises positive integers , probabilities summing to , and unit vectors , allowing zero probabilities; put and . With , using , define
Let contain exactly the nonnegative pairs bounded coordinatewise by for some valid family, and let contain exactly the nonnegative pairs satisfying and for some valid family. Put , where has entries . For , define
Then is the closure of the convex hull of all nonnegative satisfying and for some such ; and is the closure of the convex hull of all nonnegative satisfying and for some such .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.