Section 2.7: depolarizing noise prevents exact qubit transmission
OpenQAlgorithms.Papers.Independent.Gap20.P07.depolarizing_zeroErrorFor an integer and , let . For every positive block length , the optimal full-cb error of simulating one ideal qubit through satisfies
Consequently its capacity defined by eventual exactly vanishing error is zero. This statement concerns perfect transmission and does not set the ordinary approximate quantum capacity to zero.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
noncomputable section
open Filter MeasureTheory
open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap20.P07
open QAlgorithms
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)
open QAlgorithms.Papers.Independent.Frontier30.P14
(Operation isometryCoeff conjugateKernel)
open QAlgorithms.Papers.Independent.Claimed50.P35
(stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
transpose transposeBound TraceLinear tracePair MeasurePrepare)
open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)
/-- PDF p.6: any positive replacement probability prevents exact qubit transmission
through every finite positive block, without asserting that approximate Q is zero. -/
theorem depolarizing_zeroError (d : ℕ) (hd : 2 ≤ d) (p : ℝ) (hp : 0 < p) (hp1 : p ≤ 1) :
let T := QuditFidelity.depolarizingMap d (by omega) p
(∀ n : ℕ+, 0 < codingSimulationDistance (traceClassChannelPower T n)
(id : Operation (Fin 2) (Fin 2))) ∧ finiteErrorCapacity T 0 = 0 := by sorry
end QAlgorithms.Papers.Independent.Gap20.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural and every real with , define the map on complex matrices by
The distances in the assertion use the following conventions. A coefficient matrix is trace class when for vectors with , and is the infimum of these sums in . A channel preserves trace class, is additive and complex homogeneous there, and preserves density coefficient matrices after extension by the identity on each finite ancillary register, applied blockwise; density coefficient matrices have real nonnegative finite-coordinate quadratic forms and a summable real diagonal of sum . Define . The coding simulation distance from to is , over channel encoders and decoders of the required types. The theorem asserts that, for every positive integer ,
and that the following finite-error capacity at error is : take the supremum of positive real such that, for every positive-integer sequence with and , the simulation distance from to is eventually at most . Tensor powers apply maps independently to coordinates, and the capacity supremum is taken in , with empty value . The strict lower bound is asserted separately for each finite , without a common positive lower bound over all ; is included and is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.