Depolarizing finite-block testing converse
OpenQAlgorithms.Papers.Independent.Support50.P04.depolarizing_testing_converseLet 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. For and , let when and otherwise, for binary , and let . Classical testing is identified with diagonal density matrices. For , let , where are Pauli matrices. Let have Bell weights and let have weights . The latter is a normalized member of . Then
This is a shared testing upper bound; it does not compare the two exact operational channel boundaries.
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.19, Eqs.(71)–(73): fixed normalized PPT Bell
alternative and the finite-block testing converse, with the source alpha/3 convention.
This is not the stronger printed operational comparison deferred under Result 3. -/
theorem depolarizing_testing_converse (alpha epsilon : ℝ)
(ha0 : 0 ≤ alpha) (ha1 : alpha ≤ 1) (he0 : 0 < epsilon) (he1 : epsilon < 1)
(n : ℕ) (hn : 0 < n) :
IsDensityMatrix depolarizingAlternative ∧ QAlgorithms.Papers.Independent.Dependency50.P36.pptPrime depolarizingAlternative ∧
unassistedBoundary (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3)) n epsilon ≤ cppBoundary (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3)) n epsilon ∧
cppBoundary (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3)) n epsilon ≤
QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (choiState (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3))))
(QAlgorithms.Papers.Independent.Information100.P60.copies n depolarizingAlternative) epsilon / (n : EReal) ∧
QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (choiState (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3))))
(QAlgorithms.Papers.Independent.Information100.P60.copies n depolarizingAlternative) epsilon =
QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (bscJoint alpha)) (QAlgorithms.Papers.Independent.Information100.P60.copies n bscAlternative) 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
For every , , and integer , define
where . Let be diagonal on , with entries at equal-bit pairs and at unequal-bit pairs, and let . The assertion is that is positive semidefinite with trace one and satisfies , and that
Here , , and tensor powers multiply corresponding coordinate entries. The testing entropy is if , and otherwise, with for the indicated pair . Both boundaries are extended-real suprema of rates attained with positive message dimension and entanglement fidelity at least ; fidelity is overlap with the normalized maximally entangled state after applying the effective channel to its second half. The unassisted boundary uses channel encoders into qubits and channel decoders from qubits. The other boundary additionally permits a positive finite memory at the encoder output, retained until decoding. Its decoder must admit separate isometric embeddings of memory and channel output, a two-factor map , discarding the first factor, and a channel on the second. The one-outcome map is required to be a stabilized trace-norm limit of total maps of a continuing sequence of finite positive-round protocols, each stage extending each history by one round; a round has a countably indexed completely positive instrument at one party and outcome-dependent channels at the other, with summable branch maps and trace-preserving total. The norm takes the supremum over density inputs with an equally dimensional reference. Channels mean finite complete Kraus sums. The full interval is included, so the parameter appearing in the depolarizing-map definition may exceed .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.