Proposition 4.5 / (54)–(57): large subspace with high minimum fidelity
OpenQAlgorithms.Papers.Independent.Gap20.P07.largeSubspace_fidelityLet be a CPTP endomorphism of a complex system of dimension , let be a density matrix, and let . There is an isometry , with , such that the compressed CPTP channel is
For this same subspace the minimum normalized pure-state fidelity satisfies
with whenever this , and also with whenever and this second . The guards are independent. Entropy is in bits and is squared. The guarded estimates supply the subspace selection needed for capacity equivalences; unguarded printed denominators are corrected explicitly.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
noncomputable section
open Filter MeasureTheory
open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap20.P07
open QAlgorithms
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)
open QAlgorithms.Papers.Independent.Frontier30.P14
(Operation isometryCoeff conjugateKernel)
open QAlgorithms.Papers.Independent.Claimed50.P35
(stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
transpose transposeBound TraceLinear tracePair MeasurePrepare)
open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)
/-- PDF pp.17--18, Proposition 4.5, (54)--(57). Printed denominators lacked
necessary guards. Changed: 1<=k<=d, with each q<1 guard independently applied,
and k<d for the entropy quotient. The same chosen range satisfies both estimates.
The half-space application of (55) is 1-2(1-Fe), correcting p.18's reciprocal typo. -/
theorem largeSubspace_fidelity (d k : ℕ) (hd : 0 < d) (hk : 0 < k) (hkd : k ≤ d)
(T : Superop (Fin d) (Fin d)) (hT : IsChannel T)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho) :
∃ V : Matrix (Fin d) (Fin k) ℂ, V.conjTranspose * V = 1 ∧
IsChannel (compressedChannel V T) ∧
((k : ℝ) * specNorm rho < 1 →
1 - (1 - fe rho T) / (1 - (k : ℝ) * specNorm rho) ≤
minimumFidelity k (compressedChannel V T)) ∧
(k < d → let q := (1 + Real.logb 2 d - vnEntropy rho) /
(Real.logb 2 d - Real.logb 2 k)
q < 1 → 1 - (1 - fe rho T) / (1 - q) ≤ minimumFidelity k (compressedChannel V T)) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive integers with , every map admitting a finite Kraus representation with , and every positive semidefinite of trace , there exists a matrix with such that the map
also admits a finite Kraus representation satisfying the corresponding identity sum, and this same satisfies both following conditional bounds. Define
where is a matrix unit, and let , with denoting continuous functional calculus. If , then
If , put
whenever , one has
The case is included, with the second bound conditional on the unsatisfied inequality .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.