Bidirectional coherification with arbitrary signed entanglement
OpenQAlgorithms.Papers.Independent.Support50.P37.bidirectional_coherificationLet 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 any and any ,
This identifies the entire nonnegative communication quadrant, retaining the same signed entanglement rate, including zero communication rates.
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.3, Theorem 1, Eqs.(2)–(3), including the signed-E extensions on p.8.
The p.1 abstract is instantiated by this nonnegative-communication quadrant.
E<0 consumes nonnegative EPR counts of rate -E, as defined on p.2; the negative
EPR-copy exponent printed in Eq.(21) is not used as a tensor exponent. -/
theorem bidirectional_coherification (U : Resource) (hU : IsIsometricResource U)
(C1 C2 E : ℝ) (hC1 : 0 ≤ C1) (hC2 : 0 ≤ C2) :
AchievesBidirectional U .classical .classical C1 C2 E ↔
AchievesBidirectional U .coherent .coherent C1 C2 E := 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 whose four input and output dimensions are positive and whose map is for some matrix with . For all real with , the declaration asserts
Here means that for every , for every sufficiently large natural starting at some , there are natural consumption and production counts , , satisfying this rule at rates , respectively: a negative rate requires zero production and consumption at most , while a nonnegative rate requires zero consumption and production at least . A finite sequential composition of local product channels and resource calls, allowing arbitrary finite local memory, must use at most calls to , entangled-pair preparations, forward resources of type , and backward resources of type , and no other resource kinds, to approximate the tensor product of forward resources, backward resources, and entangled-pair preparations. A classical resource transfers a two-dimensional input after deleting its off-diagonal entries; a coherent resource maps to ; backward resources exchange the parties, and an entangled-pair preparation outputs . Zero copies are identities on one-dimensional registers. Local channels have finite Kraus representations with , resource calls preserve their accompanying local memory, and composition adds call counts. Approximation means that for every positive finite reference dimension and every positive semidefinite trace-one input matrix , the two reference-extended outputs differ by a matrix with . The entanglement rate may have either sign, and either communication rate may be zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.