Parallel n-use testing-Rains converse
OpenQAlgorithms.Papers.Independent.Support50.P04.blocked_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. Let and . For normalized , let with the source first-factor purification. Define
where , with value when its testing value is zero. Then
The blocked channel has 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 p.11, Eq.(32).
Printed (32) omits 1/n; corrected by applying Lemma 1 to the actual blocked
channel and retaining Eq.(1)'s per-use rate. -/
theorem blocked_testingRains [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (n : ℕ) (hn : 0 < n)
(epsilon : ℝ) (he0 : 0 < epsilon) (he1 : epsilon < 1) :
cppBoundary N n epsilon ≤ channelTestingRains (piSuperop (fun _ : Fin n => N)) 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, let map complex matrices on to complex matrices on , and assume that for a finite family satisfying . For every integer and every , the assertion is
Here is a matrix on , , and, writing , the source matrix is . The tensor power of a map is defined on matrix units by applying the map separately in each coordinate and multiplying the resulting entries. The partial transpose is , and . For arbitrary matrices , put
when this infimum is positive, and is otherwise. The quantity is the extended-real supremum of all real for which there are positive integers , a channel , and a channel , with , such that their effective map, obtained by retaining the -dimensional memory, applying to the other encoder output, and then applying , has entanglement fidelity at least . Entanglement fidelity means , where and . The decoder is restricted as follows: after separate isometric embeddings of its memory and channel-output registers into positive finite dimensions , it applies a map on those two factors, traces out the first factor, and applies a channel to the second. The one-outcome instrument must be a limit of total maps of a continuing sequence of finite protocols: each protocol starts with at least one round, and each subsequent protocol extends every existing history by one round; at each history one party applies a countably indexed completely positive instrument and the other applies an outcome-dependent channel, with all branch sums summable on every input and their total preserving trace. Convergence is measured by the supremum, over density matrices with a reference of the same dimension as the joint input, of the trace norm of the difference of the extended maps. No zero-blocklength case is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.