General SDP and covariant dispersion converse
OpenQAlgorithms.Papers.Independent.Support50.P04.general_outer_boundsLet be a CPTP channel on finite positive-dimensional complex Hilbert spaces with fixed orthonormal bases. Write and for the maximum unassisted and classical-post-processing assisted entanglement-transmission rates. A code has a positive integer message dimension , rate , and squared fidelity to the normalized maximally entangled target at least . A cpp encoder may retain sender memory; its decoder is LOCC across that memory and the receiver outputs, with its final quantum output at the receiver and no preshared entanglement. Let be the unnormalized Choi matrix. Define . Set , where the comparison Choi operators satisfy , , and . Fix . All logarithms are binary and is the standard Gaussian quantile. Remainder constants may depend on the fixed channel and error, and are chosen before the block length: there are and such that the displayed bound holds for every integer . For every integer , and
Let . The Rains set is . Put , where is Umegaki relative entropy in bits, infinite on support failure. Let be its full minimizer set and let be the maximum of the relative-information variance over if , and the minimum otherwise. If is covariant for the full input unitary group with an output unitary representation, then is finite and
Both clauses are converse bounds.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P04
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
open QAlgorithms
namespace QAlgorithms.Papers.Independent.Support50.P04
variable {A B E : Type} [Fintype A] [DecidableEq A]
variable [Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
/-- arXiv:1504.04617v2, PDF pp.7,11–13, Result 4, Eqs.(13)–(14).
Printed (13) omits 1/n; changed to per-use normalization as Eq.(1) and Eq.(39)
require. Covariance is the full-unitary convention explicitly stated on p.12. -/
theorem general_outer_bounds [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
(he0 : 0 < epsilon) (he1 : epsilon < 1) :
(∀ n : ℕ, 0 < n → 0 < metaValue (piSuperop (fun _ : Fin n => N)) epsilon ∧
cppBoundary N n epsilon ≤ ((-QAlgorithms.Papers.Independent.Information100.P80.log2 (metaValue (piSuperop (fun _ : Fin n => N)) epsilon) / n : ℝ) : EReal)) ∧
(FullUnitaryCovariant N →
∃ a : ℝ, rainsInformation N = (a : EReal) ∧
dispersionUpper (fun n => cppBoundary N n epsilon) a (rainsVariance N epsilon) epsilon) := by sorry
end QAlgorithms.Papers.Independent.Support50.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be arbitrary finite nonempty types with decidable equality, let be a map from complex matrices on to complex matrices on admitting a finite Kraus representation , , and let . Throughout, a channel means such a finite normalized Kraus sum, , , and a density matrix is positive semidefinite with trace . Define to be the extended-real supremum of real for which there are positive integers , a channel , and a channel with and fidelity at least . The fidelity is , where and applies , reorders its output to put first, applies , and then applies . The decoder is additionally required to have the form , for positive integers , isometries , , and a channel . Here , on , must be the limit of single-outcome instruments coarse-grained from compatible finite local-history instruments : an instrument has completely positive complex-linear branches, summable outputs on every matrix, and trace-preserving sum; complete positivity means positivity under every finite identity amplification. Each local round is a branchwise tensor product in which one party performs a countable-outcome instrument and the other performs an outcome-dependent channel. Each has a positive finite number of such rounds, extends each history of by one local round using the fixed natural-number pairing, coarse-graining sums branches over fibers of an outcome-label function, and convergence means , with identity-register dimension . For any channel , define its unnormalized Choi matrix by , let transpose its first tensor factor, and define
The theorem first asserts, for every natural ,
For its second assertion, put , let denote partial transpose on , and set
Functional calculus is used in these expressions; define the extended-real to equal when , and otherwise. Let , let , and define
If there exists a group homomorphism from the unitary group on to that on such that for every unitary and every matrix , then there is a real with , and there exist , such that, for every ,
Here . The variance selection uses the displayed real infimum or supremum, without an additional attainment hypothesis; the comparison-set definition allows , for which the support condition fails for a nonzero density matrix. All finite-block conclusions explicitly require .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.