Depolarizing channel: 42 uses are necessary to exceed the displayed coherent-information value
OpenQAlgorithms.Papers.Independent.Support50.P04.depolarizing_necessary_42Let and . Let , where are the Pauli matrices. For every positive integer , the maximum entanglement-transmission rate with classical post-processing satisfies
Here is binary entropy and fidelity is squared fidelity to the normalized maximally entangled target. The right side is the explicit comparison expression in Eq.(11); no general identity between this expression and maximized coherent information is assumed. This is a necessary block-length condition, with no achievability claim at 42.
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.6–7, Fig.4(b) and its discussion.
At alpha=0.0825 and epsilon=5.5%, at least 42 channel uses are necessary to
exceed the comparison value displayed in Eq.(11). The statement is only this
necessary condition: it does not assert that a code attains the bound at n=42.
The separate 738 value is explicitly based on a second-order approximation.
No numerical certification premise is added to this source claim. -/
theorem depolarizing_necessary_42 (n : ℕ) (hn : 0 < n) (hsmall : n < 42) :
cppBoundary (QuditFidelity.depolarizingMap 2 (by norm_num) (4*(33/400)/3)) n (11/200) ≤
((1 - QAlgorithms.Papers.Independent.Frontier18.P07.binaryEntropyBits (33/400) -
(33/400) * QAlgorithms.Papers.Independent.Information100.P80.log2 3 : ℝ) : 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
For every natural number with , hence , let be the map on complex matrices defined by . Consider all positive integers , encoding channels from an -dimensional register to qubits together with a -dimensional memory, and decoding channels from that memory together with the output qubits to an -dimensional register, subject to the following restriction on the decoder. There must exist positive integers , isometries and , a map on the joint - and -dimensional registers, and a channel from the latter register to the -dimensional output, such that, for every matrix ,
Here the singleton-outcome family consisting of must admit the following construction: there is a sequence of instruments with natural-number outcomes, each obtained by a positive finite number of successive rounds, with every instrument in the sequence extended by one further round to obtain the next. In each round, one of the two parties applies an instrument and the other applies an outcome-dependent channel, and the joint branch map is their tensor product; later rounds may depend on the accumulated outcome history. An instrument here has completely positive complex-linear branch maps, its branch outputs are summable for every input matrix, and their sum preserves trace; complete positivity means that every finite identity extension preserves positive semidefinite matrices. For each instrument in the sequence, its outcomes can be grouped to produce a singleton-outcome instrument whose map approaches in the distance
where the reference register has the same dimension as the joint input and . Every channel mentioned above is required to have a finite Kraus representation with . For such an encoder and decoder, define the effective map by applying , applying to its qubit register while retaining its memory, and then applying . With the matrix having entry at and zero elsewhere, require
The assertion is that the supremum, in the extended real numbers, of all real for which such a code exists and satisfies
The memory dimension and message dimension are unrestricted apart from positivity, has no nonnegativity requirement, and the supremum uses the extended-real convention that the supremum of the empty set is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.