Assisting classical and coherent communication
OpenQAlgorithms.Papers.Independent.Support50.P37.assisting_communicationLet be a fixed bipartite unitary or rectangular isometry between nonzero finite-dimensional registers held by Alice and Bob. Local quantum operations and local ancillas are free; every nonlocal call and every supplied EPR pair is counted. A positive signed rate produces a resource and a negative rate consumes it. Write for simultaneous achievable forward , backward , and ebit rates, where denote dephasing classical bits, coherent copying bits, and noiseless qubits. Achievability means that for every error tolerance and rate slack , all sufficiently large admit a fixed finite protocol with at most uses of , signed resource counts within , and joint trace-distance error at most , uniformly over normalized inputs and untouched reference systems. The protocol precedes the input; no external shared seed or catalyst is free.
Let and . Both of the following chains hold, with every link an equivalence:
Classical assistance does not enlarge these communication or entanglement tradeoffs. Coherent assistance contributes its displayed entanglement increment. The formal statement conjoins the five adjacent equivalences.
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.8, Theorem 2, Eqs.(23)–(29): both displayed chains, as five separate
edge equivalences. The nonnegative assisting amounts C1,C2 occur with negative
signed communication rates. E is arbitrary, including entanglement consumption. -/
theorem assisting_communication (U : Resource) (hU : IsIsometricResource U)
(C1 C2 E : ℝ) (hC1 : 0 ≤ C1) (hC2 : 0 ≤ C2) :
(AchievesBidirectional U .classical .classical C1 (-C2) E ↔
AchievesBidirectional U .classical .classical C1 0 E) ∧
(AchievesBidirectional U .classical .classical C1 0 E ↔
AchievesBidirectional U .coherent .coherent C1 0 E) ∧
(AchievesBidirectional U .coherent .coherent C1 0 E ↔
AchievesBidirectional U .coherent .coherent C1 (-C2) (E+C2)) ∧
(AchievesBidirectional U .classical .classical (-C1) (-C2) E ↔
AchievesBidirectional U .classical .classical 0 0 E) ∧
(AchievesBidirectional U .classical .classical 0 0 E ↔
AchievesBidirectional U .coherent .coherent (-C1) (-C2) (E+C1+C2)) := 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 any bipartite resource with positive input and output dimensions and map , where , and let be real numbers with . Write for the following precise property: for every , all natural beyond some admit natural forward, backward, and entanglement consumption/production pairs , , ; for each corresponding rate , negative requires production zero and consumption at most , while nonnegative requires consumption zero and production at least . A finite composition of local product channels and resource calls with arbitrary finite local memory must use at most calls to , entangled-pair preparations, forward resources of type , and backward resources of type , with all other resource counts zero, to approximate forward resources, backward resources, and entangled-pair preparations in tensor product. Classical communication transfers a two-dimensional input with its off-diagonal entries deleted; coherent communication sends to ; reversing a resource exchanges the parties; and each entangled-pair preparation outputs . Zero copies are one-dimensional identities. Local channels are finite Kraus maps with , calls leave accompanying memory unchanged, and call counts add under composition. Approximation requires for the output difference on every density input extended by every positive finite reference register. With this meaning, all five equivalences hold:
The hypotheses allow or , and impose no sign condition on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.