Equation (5): flagged coherent information and achievable concatenated-cat rate
OpenQAlgorithms.Papers.Independent.Intakenext100.P93.cat_flagged_rateLet with sum at most one, and fix the positive cat length . Encode half of the normalized Bell state , apply the independent physical Pauli channel, decode, and measure and retain the complete syndrome. Denote this actual instrument output by , the syndrome mass by , and its conditional logical channel by . Each conditional channel is the Pauli mixture with weights when ; at zero mass choose the identity. The output is a density matrix and
Here , the receiver includes the syndrome, and every entropy uses base two. If , this rate is achievable by this fixed cat inner encoder concatenated with outer additive stabilizer encoders: for every fidelity error and rate slack , every sufficiently large positive outer length admits an encoder for logical qubits and a CPTP decoder with entanglement fidelity and every normalized pure-input transmission fidelity at least .
The operational assertion supplies high-fidelity unassisted quantum communication, rather than only an entropic number. Negative values remain signed expressions. At the expression is the Bell-input hashing yield, without input optimization.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P93
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P93
open QAlgorithms
open scoped BigOperators ComplexConjugate Matrix
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Smith--Smolin, PDF p.2, Eq.(5): actual flagged output, Pauli conditional
channels, coherent-information identity and operational random-stabilizer
concatenation rate. A negative signed expression is not an operational rate. -/
theorem cat_flagged_rate (k : ℕ) (px py pz : ℝ)
(hx : 0 ≤ px) (hy : 0 ≤ py) (hz : 0 ≤ pz) (hsum : px + py + pz ≤ 1) :
IsDensityMatrix (catInstrumentOutput k px py pz) ∧
(∀ s : Qubits k, IsChannel (conditionalChannel k px py pz s) ∧
∀ rho : Matrix Bool Bool ℂ,
conditionalChannel k px py pz s rho =
∑ u : Bool, ∑ v : Bool,
((if iidCatSyndromeMass k px py pz s = 0 then
(if u = false ∧ v = false then 1 else 0)
else catLogicalSyndromeMass k px py pz u v s / iidCatSyndromeMass k px py pz s : ℝ) : ℂ) •
conjSuperop ((Stabilizer.pauliOfBits u v).mat) rho) ∧
(∀ x y : Bool × (Bool × Qubits k), catInstrumentOutput k px py pz x y =
if x.2.2 = y.2.2 then
(iidCatSyndromeMass k px py pz x.2.2 : ℂ) *
idTensorSuperop (R := Bool) (conditionalChannel k px py pz x.2.2)
(pureDensity catBellInput) (x.1, x.2.1) (y.1, y.2.1)
else 0) ∧
catRate k px py pz =
(∑ s : Qubits k, iidCatSyndromeMass k px py pz s *
(let rho := idTensorSuperop (R := Bool) (conditionalChannel k px py pz s)
(pureDensity catBellInput)
vnEntropy (traceLeft rho) - vnEntropy rho)) / (k + 1 : ℕ) ∧
catRate k px py pz =
(1 + QAlgorithms.Papers.Independent.Support50.P40.finiteEntropyBits (iidCatSyndromeMass k px py pz) -
QAlgorithms.Papers.Independent.Support50.P40.finiteEntropyBits (fun z : Bool × Bool × Qubits k =>
catLogicalSyndromeMass k px py pz z.1 z.2.1 z.2.2)) / (k + 1 : ℕ) ∧
(0 ≤ catRate k px py pz → CatAchievable k px py pz (catRate k px py pz)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P93
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , including , and nonnegative real numbers with , write . For , let , where , , , and . Set , let be the sum of over , , , and put . Define , , the repetition encoder , and the decoder branch . Let , and define if , and otherwise. With , let , indexed by , have zero entries between distinct syndrome blocks and block equal to . Write , where is applied by continuous functional calculus with the total real logarithm, and , so zero terms contribute . Define . The theorem asserts that is positive semidefinite with trace ; that every is a channel, meaning it has a finite Kraus representation with Kraus matrices satisfying ; and that, for every and every complex matrix ,
where , with , , and . It further asserts, for all Boolean and all ,
and the two rate identities
Finally, if , then for every and there exists an integer such that for every there are a natural number , an encoder matrix , and a channel from blocks of qubits to qubits, satisfying . The encoder satisfies , , and its range is the common fixed space of a commuting subgroup of the unitary group generated by matrices , where and , with that subgroup containing no . If and
then both , where , and for every unit vector . Zero-mass syndrome branches are included through the identity-map convention, and the achievability implication includes and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.