Commuting rotations give a state-dependent linear recovery bound
OpenQAlgorithms.Papers.Independent.Support50.P44.commuting_rotations_linear_boundLet be a density operator on finite-dimensional complex systems , with marginals , and . There exist a CPTP map and unitaries commuting with respectively, such that, for every supported on ,
and
Inverse square roots are generalized inverses. The full CPTP map completes the supported formula outside that support, and may depend on the entire state. This is the nonuniversal structural recovery result used by the corollary.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P44
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P44
open QAlgorithms.Papers.Independent.Dependency50.P13 (IsTraceClass compression)
open QAlgorithms.Papers.Independent.Dependency50.P21 (marginalAB)
open QAlgorithms.Papers.Independent.Renew46.P37 (classicalKL)
open Filter
open scoped ENNReal ComplexOrder Matrix
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable {A B C E G : Type*}
/-- PDF pp.19–20, Lemma 6.1, (116)–(117). Source correction: the formula is
restricted to supported inputs as explicitly stipulated in (115); require a full
CPTP completion. Singular rhoB is allowed. R may depend on the full state. -/
theorem commuting_rotations_linear_bound [Fintype A] [Fintype B] [Fintype C]
[DecidableEq A] [DecidableEq B] [DecidableEq C]
(rho : Matrix (A × (B × C)) (A × (B × C)) ℂ) (hrho : IsDensityMatrix rho) :
let rhoBC := traceLeft rho
let rhoB : Matrix B B ℂ := fun b b2 => ∑ c, rhoBC (b,c) (b2,c)
∃ R : Superop B (B × C), IsChannel R ∧
∃ U : Matrix.unitaryGroup B ℂ, ∃ V : Matrix.unitaryGroup (B × C) ℂ,
(U : Matrix B B ℂ) * rhoB = rhoB * (U : Matrix B B ℂ) ∧
(V : Matrix (B × C) (B × C) ℂ) * rhoBC =
rhoBC * (V : Matrix (B × C) (B × C) ℂ) ∧
(∀ X, finiteSupport rhoB * X * finiteSupport rhoB = X →
R X = rotatedTranspose rhoBC U V X) ∧
1 - Real.log 2 / 2 * finiteCMI rho ≤
rootFidelity rho (idTensorSuperop R (marginalAB rho)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P44
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite types equipped with decidable equality, and let be a positive semidefinite complex matrix of trace one indexed by . Define by tracing out , by tracing out , and by tracing out from ; explicitly, their entries are respectively , , and . Put for evaluated by real continuous functional calculus, and put . Then there exist a map from -matrices to -matrices and unitary matrices on and on with the following properties: for some natural number and matrices satisfying ; and ; and, writing with , with , and , every matrix satisfying obeys
Furthermore, if , meaning , then
All matrix functions above use real continuous functional calculus, with reciprocal zero defined as zero. No nonemptiness assumptions are stated on the index types, but the trace-one hypothesis cannot hold if any of is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.