Theorem 8: variational formula over the noisy-conjugate pure image
OpenQAlgorithms.Papers.Independent.Gap48.P36.noisy_image_variationalAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Let be a basis of unitaries on , including , with . Let , , and . Write for the canonical conjugate using Kraus matrices , and . Write and , with density inputs, Schatten norm, and von Neumann entropy. Put . For real ,
This is the variational formulation over the fixed noisy-conjugate pure image.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P36
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Claimed50.P48
open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C D E K L A2 B2 C2 : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]
variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]
/-- Theorem 8, PDF p.14, (34): the second factor is d^3, not d^2. -/
theorem noisy_image_variational [Nonempty A] [Nonempty K]
(T : UnitaryBasis A K) (a : K → ℝ) (ha : ProbabilityWeights a) (p : ℝ) (hp : 1 ≤ p) :
nu (ENNReal.ofReal p) (randomUnitary T.matrix a) =
(Fintype.card A : ℝ)^2 * sSup {x | ∃ gamma ∈ pureNoisyImage T.matrix,
x = schattenNorm (ENNReal.ofReal p) (weightRoot a * gamma * weightRoot a)} ∧
nu (ENNReal.ofReal p) (randomUnitary T.matrix a) =
(Fintype.card A : ℝ)^3 * sSup {x | ∃ gamma ∈ pureNoisyImage T.matrix,
x = schattenNorm (ENNReal.ofReal p) (gamma * weightMatrix a * gamma)} := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, put , and let be complex matrices on with a specified identity label , satisfying , , , and if and otherwise. Let with , and let be real. Define
and let and . Then both identities hold:
Here and , with matrix powers defined by continuous functional calculus. Zero weights, , and are included; closure of the basis under multiplication up to phase is not assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.