Uniform average error suffices for E=0 coherification
OpenQAlgorithms.Papers.Independent.Support50.P37.average_error_coherificationLet be a fixed bipartite unitary or isometry between nonzero finite-dimensional registers, and let . Suppose finite protocols , using at most calls to and free local operations only, transmit independent uniform classical messages of lengths and , with and . Neither the protocol, its schedule, nor its register dimensions depends on the message pair. No external entanglement, shared random seed, side communication, or catalyst is supplied.
If the uniform average joint decoding success tends to one, then the same rates are achievable coherently:
Here and range over all respective bit strings, and specifies Alice's and Bob's decoded outputs. The coherent conclusion has vanishing joint trace-distance error uniformly over normalized quantum inputs and untouched references, without supplied entanglement. This states the strengthening actually used in the construction, rather than an unspecified resource-assisted generalization.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P37
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P37
open QAlgorithms.Papers.Independent.Support21.P19
open QAlgorithms.Papers.Independent.Renew46.P34 (rateConstraint)
open scoped Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.5, norm-squared identity for Gamma_00, and note [14] on p.12.
In the E=0 construction, a vanishing uniform average classical error suffices for
reference-uniform coherent transmission at the same rates, without an external seed. -/
theorem average_error_coherification (U : Resource) (hU : IsIsometricResource U)
(C1 C2 : ℝ) (h : AchievesAverageClassical U C1 C2) :
AchievesBidirectional U .coherent .coherent C1 C2 0 := by sorry
end QAlgorithms.Papers.Independent.Support50.P37
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a bipartite resource with positive finite input dimensions , positive finite output dimensions , and map , where satisfies . Here an allowed protocol is a finite composition of local channels and resource calls extended by local memory registers; a channel means a map with a finite Kraus family satisfying . Suppose the real numbers are nonnegative and have the following property: for every , there is an integer such that for every integer , there are nonnegative integers satisfying and , and an allowed protocol using at most calls to and no calls to supplied entangled-state, quantum-communication, coherent-communication, or classical-communication resources, whose input registers have dimensions , whose output registers have dimensions , and for which
Then, for every , there is an integer such that for every integer , there are nonnegative integers , with and , and an allowed protocol using at most calls to and no supplied entanglement or additional communication resources, which approximates the tensor product of forward coherent-bit channels, backward coherent-bit channels, and preparation of Bell pairs. A forward coherent-bit channel maps to , retaining one copy of the basis label at Alice and placing the other at Bob; the backward channel reverses the parties, and each Bell pair is . More precisely, writing for this target map, the protocol map has the same input and output registers as , and for every positive integer and every positive semidefinite, trace-one matrix on an -dimensional reference register together with the entire target input,
The conclusion places no upper bounds on , and its entanglement rate requires zero supplied Bell pairs while allowing any , without requiring positive entanglement production. Zero communication rates and zero output counts are included; zero tensor copies mean the identity resource on one-dimensional registers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.