Remark 3: exact zero-communication conversion of maximally entangled states
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.zero_communication_conversionFor normalized finite-dimensional bipartite pure states , write for their positive Schmidt ranks, and for base-two Rényi gaps. Any exact deterministic zero-communication conversion obeys for every . Moreover, if is flat on its positive support, then
Local ancillas and disposal are allowed. This characterizes the exact zero-communication conversions between maximally entangled states, including product targets.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P61
open scoped Matrix ComplexConjugate
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)
open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
attribute [local instance] Classical.propDecidable
section Operational
variable {A B C D : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
[Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
/-- PDF p.3, Remark 3: every Renyi gap is nonincreasing at zero communication;
from a flat input, the flat target's positive Schmidt rank must and may divide the input rank. -/
theorem zero_communication_conversion (phi : EuclideanSpace ℂ (A × B))
(psi : EuclideanSpace ℂ (C × D)) (hphi : ‖phi‖ = 1) (hpsi : ‖psi‖ = 1) :
(Quantum (pureDensity phi) (pureDensity psi) 0 →
∀ alpha beta : RenyiOrder, alpha < beta →
renyiGap (aliceDensity psi) alpha beta ≤ renyiGap (aliceDensity phi) alpha beta) ∧
(Flat (aliceDensity phi) →
(Quantum (pureDensity phi) (pureDensity psi) 0 ↔
Flat (aliceDensity psi) ∧ supportRank (aliceDensity psi) ∣ supportRank (aliceDensity phi))) := by sorry
end Operational
end QAlgorithms.Papers.Independent.Intakenext100.P61
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite register types and unit vectors on and on , put and . A quantum execution is generated, after finite-register relabeling, by identity steps and trace-preserving local Kraus maps at zero cost, transfers of positive integer dimensional tensor factors in either direction costing , and finite composition adding costs. The declaration asserts both that an execution from to of cost exactly zero implies
and that, if all positive eigenvalues of are equal, such a zero-cost execution exists if and only if all positive eigenvalues of are equal and divides . Here is the base-two logarithm of the number of positive eigenvalues, , for finite , , and , with sums over positive eigenvalues counted with multiplicity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.