The full quantum/coherent bidirectional region square
OpenQAlgorithms.Papers.Independent.Support50.P37.quantum_coherent_region_squareLet 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 arbitrary , define the four propositions
Every edge of the square is an equivalence:
This determines all four quantum/coherent bidirectional regions from any one of them. It is an asymptotic statement with counted startup and recycling; finite coherent teleportation's returned catalyst is not a free input.
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.(33): all four edges of the quantum/coherent rate-region square.
Rates Q1,Q2,E are signed. This is an asymptotic assertion: the finite coherent
teleportation catalyst must be generated and recycled through counted calls.
No finite zero-seed two-cobit equality is asserted. -/
theorem quantum_coherent_region_square (U : Resource) (hU : IsIsometricResource U)
(Q1 Q2 E : ℝ) :
(AchievesBidirectional U .quantum .quantum Q1 Q2 E ↔
AchievesBidirectional U .coherent .quantum (2*Q1) Q2 (E-Q1)) ∧
(AchievesBidirectional U .quantum .quantum Q1 Q2 E ↔
AchievesBidirectional U .quantum .coherent Q1 (2*Q2) (E-Q2)) ∧
(AchievesBidirectional U .coherent .quantum (2*Q1) Q2 (E-Q1) ↔
AchievesBidirectional U .coherent .coherent (2*Q1) (2*Q2) (E-Q1-Q2)) ∧
(AchievesBidirectional U .quantum .coherent Q1 (2*Q2) (E-Q2) ↔
AchievesBidirectional U .coherent .coherent (2*Q1) (2*Q2) (E-Q1-Q2)) := 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 arbitrary real numbers. Define to mean that for every , every sufficiently large natural , starting at some , admits natural forward, backward, and entanglement consumption/production pairs , , satisfying the following rule at rates : a negative rate forces production zero and permits consumption at most , whereas a nonnegative rate forces consumption zero and requires production at least . There must be a finite sequential composition of local product channels and resource calls with arbitrary finite local memory, using at most calls to , entangled-pair preparations, forward resources of type , and backward resources of type , with no calls to other resource kinds, approximating the tensor product of forward resources, backward resources, and entangled-pair preparations. A quantum resource transfers a two-dimensional input unchanged to the other party; a coherent resource maps to ; a backward resource 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 means that every density input, including any positive finite reference register, yields output difference satisfying . With this definition, the declaration asserts the conjunction
No nonnegativity assumptions are imposed on ; negative and zero rates retain exactly the consumption and production rules specified above.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.