Corollary 6: universal achievable corner
OpenQAlgorithms.Papers.Independent.Intakenext100.P54.universal_achievable_cornerFor every error and rate slack , there is such that every admits a one-way protocol, chosen before its arbitrary normalized pure target in , with shared maximally entangled rank resource, exact conditional successful output, and a common success/failure flag, satisfying
Here counts every possible forward message, including failure; Bob uses a fixed CPTP decoder for each message. The entanglement cost is . Thus one cbit and one ebit per qubit are simultaneously achievable asymptotically for universal probabilistic exact preparation.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder NNReal ENNReal
open MeasureTheory ProbabilityTheory
namespace QAlgorithms.Papers.Independent.Intakenext100.P54
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)
open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
/-- Corollary 6, PDF p.4. The error and rate slack precede the dimension threshold and code;
the code precedes every arbitrary pure target. The failure outcome is charged. -/
theorem universal_achievable_corner :
∀ eps : ℝ, 0 < eps → ∀ delta : ℝ, 0 < delta →
∃ Dzero : ℕ, 2 ≤ Dzero ∧ ∀ D ≥ Dzero,
∃ P : RSPCode (RSPVector (Fin D)) (Fin D),
P.S = D ∧ Real.logb 2 P.K ≤ (1 + delta) * Real.logb 2 D ∧
P.ExactWithError eps := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P54
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real and every real , there exists a natural number such that for every natural number , there is a code with positive integers , output space , and inputs all unit vectors , satisfying
For each , its effect matrices are positive semidefinite and sum to ; its input-independent decoders have finite Kraus representations with . Moreover, there is one subset such that, writing , every unit vector satisfies for all and . The theorem allows , in which case the subset may be empty; it imposes no bound on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.