§7.2 (7.23)–(7.24): bipartite uncertainty relation
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.bipartite_uncertaintyAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation denotes conditional von Neumann entropy. In hypothesis testing, and , with . The value minimizes the first error subject to the second being at most .
Let rho_AB be normalized, and let two orthonormal-basis measurements on A have maximum squared overlap c. Let alpha,beta,gamma>=1/2 be finite, different from one, with gamma/(gamma-1)=alpha/(alpha-1)+beta/(beta-1) and (alpha-1)(beta-1)(gamma-1)<0. Then the displayed bipartite uncertainty relation holds for the actual measured marginals.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#7.bipartite
§7.2 (7.23)–(7.24): bipartite uncertainty relation, arXiv:1504.00233v5, PDF p.117,118. -/
theorem bipartite_uncertainty [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
(U V : paperMat A) (hU : Uᴴ*U = 1) (hV : Vᴴ*V = 1) (a b c : ℝ)
(ha : 1/2 ≤ a) (hb : 1/2 ≤ b) (hc : 1/2 ≤ c) (ha1 : a ≠ 1) (hb1 : b ≠ 1) (hc1 : c ≠ 1)
(hrel : c/(c-1) = a/(a-1)+b/(b-1)) (hsign : (a-1)*(b-1)*(c-1) < 0) :
conditionalUp true (ENNReal.ofReal c) r-paperLogE (basisOverlap U V) ≤ conditionalUp true (ENNReal.ofReal a) (paperBasisMeasurement U r)+
conditionalUp true (ENNReal.ofReal b) (paperBasisMeasurement V r) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite index types with decidable equality, let be a positive semidefinite complex matrix indexed by with , and let be complex matrices indexed by satisfying and . For real numbers , each different from , suppose that and . Define , indexed by , by when , and by zero otherwise; define analogously. Put . To specify the entropy expressions, write for the continuous functional calculus of with the real function that is zero at zero and equals elsewhere, and set . For , define to be if either and , or , and to be otherwise, where and for . Define , with ranging over all positive semidefinite matrices indexed by having trace one. Then the asserted extended-real inequality is . The endpoint orders are included whenever all the stated hypotheses hold; the matrix powers at zero use the specified zero value even for negative exponents.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.