Covariant product-alternative testing converse
OpenQAlgorithms.Papers.Independent.Support50.P04.covariant_product_comparatorLet 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 and , and assume covariance with respect to the full input unitary group, with an output unitary representation. Set and use the normalized target. Then
The product restriction concerns the comparator only; codes may encode arbitrary entangled inputs.
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.12–13, Eq.(39): product ALTERNATIVES relax the
converse; actual code inputs remain arbitrary, including entangled blocked inputs. -/
theorem covariant_product_comparator [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (hcov : FullUnitaryCovariant N)
(n : ℕ) (hn : 0 < n) (epsilon : ℝ) (he0 : 0 < epsilon) (he1 : epsilon < 1) :
cppBoundary N n epsilon ≤ sInf {v | ∃ sigma : Matrix (A × B) (A × B) ℂ,
QAlgorithms.Papers.Independent.Dependency50.P36.pptPrime sigma ∧
v = QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (choiState N)) (QAlgorithms.Papers.Independent.Information100.P60.copies n sigma) epsilon / (n : EReal)} := 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 nonempty finite sets with decidable equality, and let be a channel, meaning that it has a finite Kraus representation with complete Kraus family. Assume there exists a group homomorphism such that
For every and , the assertion is
The comparison matrix is on and is not required to have trace one; its partial transpose has entries . Tensor powers have entries given by products of the corresponding single-copy entries, and . The testing quantity is if
is positive, and otherwise, with here equal to the two displayed tensor powers. The quantity is the extended-real supremum of rates realized by positive dimensions , a channel encoding dimensions into , and a channel decoding into dimensions, with and entanglement fidelity at least after applying independently to the channel-input factors. Fidelity is the overlap of the effective channel’s output on half of with that same maximally entangled state. The decoder must admit separate isometric embeddings into positive dimensions , followed by a two-factor map , tracing out the first factor, and a channel on the second. The map is a limit of total maps of finite protocols arranged in a continuing sequence: the first has a positive number of rounds, and each successor extends each history by one round; a round consists of a countably indexed completely positive instrument at one factor and outcome-dependent channels at the other, with summable branch maps and trace-preserving total. Convergence is in the supremum trace norm on density inputs with a reference of the same dimension as the joint input.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.