Figure 2(a,b): noisy GHZ/W information comparisons
OpenQAlgorithms.Papers.Independent.Support50.P43.noisy_qubit_informationLet be either the three-qubit GHZ vector or the W vector . For , put . Define , , and , evaluated on in bits. Let , where is computational partial transpose and is the full trace norm. Then
These are comparisons for the two displayed families, not for arbitrary mixed states.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P43
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- These accepted register types are definitionally the required finite tensor bases.
open QAlgorithms.Papers.Independent.Claimed50.P33 (RegisterBasis SubBasis)
open QAlgorithms.Papers.Independent.Information100.P21 (ghzKet)
/-- Figure 2(a,b), PDF p.4: every caption comparison on exactly the two qubit
families, including strict negativity-versus-common-information comparison for p>0.
At p=0 the comparison is non-strict. Panel (c) is deferred. -/
theorem noisy_qubit_information (p : ℝ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) :
∀ psi : EuclideanSpace ℂ (HomBasis 3 2), psi = ghzKet 3 true ∨ psi = dickeQubitVector 3 1 →
let rho := noisyQubits psi p
((p = 0 ∨ p = 1) → commonOn rho Finset.univ = 0) ∧
((0 < p ∧ p < 1) → commonOn rho Finset.univ < 0) ∧
(alternativeOn rho Finset.univ = 0 ↔ p = 0) ∧
(0 < p → 0 < alternativeOn rho Finset.univ) ∧
conventionalOn rho Finset.univ ≤ alternativeOn rho Finset.univ ∧
commonOn rho Finset.univ ≤ logarithmicNegativity rho ∧
(0 < p → commonOn rho Finset.univ < logarithmicNegativity rho) := by sorry
end QAlgorithms.Papers.Independent.Support50.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with and every vector equal to either
where denotes the vector with amplitude at and elsewhere, set , with . For each subset , let be the reduced matrix whose entry at labels on is the sum of over all full labels restricting to on and agreeing outside , and put , where is applied by continuous functional calculus. Define
and . Also define
where the matrix square root is given by continuous functional calculus. Then all of the following hold: if or , then ; if , then ; if and only if ; if , then ; ; ; and if , then . These assertions include both endpoints: gives , and gives .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.