One-use testing-Rains metaconverse
OpenQAlgorithms.Papers.Independent.Support50.P04.oneUse_testingRainsLet 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. Fix . For normalized , let with the source first-factor purification. Define
where , with value when its testing value is zero. Then
The comparison state may vary with the input state.
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.10–11, Lemma 1, Eq.(24).
The comparison state is optimized separately for each normalized channel input. -/
theorem oneUse_testingRains [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
(he0 : 0 < epsilon) (he1 : epsilon < 1) :
cppBoundary N 1 epsilon ≤ channelTestingRains N 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 channel from complex matrices on to those on , and let ; a channel means a finite Kraus sum with . Define as the extended-real supremum of real for which there are positive integers , a channel , and a channel , such that and
The decoder must have the form , for positive integers , isometries , , and a channel . The map must satisfy the following local-history limit condition: instruments have completely positive complex-linear branches, summable outputs for every matrix, and trace-preserving totals, with complete positivity tested under every finite identity amplification; a local round has tensor-product branches consisting of one party’s countable-outcome instrument and the other party’s outcome-dependent channel. There are finite raw history instruments , each starting from a local round and having a positive number of rounds, with each obtained by extending every history of by an outcome-dependent local round using the fixed pairing of natural-number labels, and single-outcome instruments coarse-grained from by summing over fibers of outcome-label functions, such that , where the identity register has dimension . For every density matrix on , set and . For matrices on the same space, define
Let be partial transpose on , and let . The theorem asserts the extended-real inequality
Here ; the alternative need not have trace , and the admissible alternatives include , for which the displayed testing quantity is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.