Classical/coherent mapping in every signed quadrant
OpenQAlgorithms.Papers.Independent.Support50.P37.signed_classical_coherent_regionsLet 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.
For all signed real rates ,
Thus the classical region determines the coherent region in every quadrant. For example, consumed communication rates , with , shift the coherent entanglement coordinate to .
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.9, Eq.(31): mapping of the full signed CCE and CoCoE regions.
The preceding prose prints CCC; the displayed formula and the defined region use CCE.
All three coordinates are real, and consumed cobits increase the E coordinate. -/
theorem signed_classical_coherent_regions (U : Resource) (hU : IsIsometricResource U)
(C1 C2 E : ℝ) :
AchievesBidirectional U .classical .classical C1 C2 E ↔
AchievesBidirectional U .coherent .coherent C1 C2
(E-min C1 0-min 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
For every bipartite resource with positive input and output dimensions and map for an isometry , and every real , one has
Here means that for every , there is a natural such that every natural admits natural consumption/production pairs , , at rates : a negative rate forces production zero and bounds consumption by ; a nonnegative rate forces consumption zero and bounds production below by . 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 the tensor product of forward resources, backward resources, and entangled-pair preparations. Classical communication transfers a two-dimensional input after deleting its off-diagonal entries; coherent communication maps to ; backward communication exchanges the parties; an entangled-pair preparation outputs ; and zero copies are identities on one-dimensional registers. Local channels are finite Kraus maps with , resource calls preserve accompanying memory, and composition adds counts. Approximation requires the two outputs, after adjoining any positive finite reference register and applying the maps to any positive semidefinite trace-one input, to differ by with . All three rates may be negative, zero, or positive, and zero rates use the nonnegative branch of the rule.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.