Proposition 2: OND complete families characterize universal recovery
OpenQAlgorithms.Papers.Independent.Gap48.P45.ondFamily_universalRecoveryCharacterizationAll physical Hilbert spaces are nonzero complex separable Hilbert spaces, with finite dimensions included. States are positive trace-class operators of trace one, channels are completely positive and trace preserving on the entire trace class, and logarithms are natural. Inner products are conjugate-linear in the first argument. An OND family admits no partition into two nonempty mutually orthogonal subfamilies. Its components are obtained by finite chains of nonorthogonal pure states, and projects onto the closed span of component . Let be a complete pure-state family in . Quantify over every nonzero separable output space and every channel into it. Then
for some ancillary space and a fixed state . The ancilla and state may depend on the channel.
This result characterizes when recovering a pure family forces recovery of every input state.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
noncomputable section
open Filter MeasureTheory
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap48.P45
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize traceClosure rankOne productCoeff tensorApply)
open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Complementary traceFirst traceSecond)
open QAlgorithms.Papers.Independent.Frontier18.P07
(GeneralizedEnsemble averageCoefficients extendedEntropyNats extendedRelativeEntropyNats ensembleHolevo pureStates finiteEnsembleCapacity)
open QAlgorithms.Papers.Independent.Frontier18.P18
(operatorCoeff boundedOperator conjugateCoeff ReversibleOn IsometricallyEquivalent
IsParsevalFrame IsKrausRepresentation)
open QAlgorithms.Papers.Independent.Claimed50.P16 (tensorRankLE)
open QAlgorithms.Papers.Independent.Next46.P31 (positiveSquareRoot)
open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)
/-- Proposition 2, PDF p.13: quantify over ALL nonzero separable output spaces;
channel (13) appends a fixed, possibly mixed ancillary state. -/
theorem ondFamily_universalRecoveryCharacterization
{I : Type} [Countable I] [Nonempty I]
(S : Set (State I)) (hPure : S ⊆ pureStates I) (hComplete : CompleteFamily S) :
OrthogonallyNondecomposable S ↔
∀ (J : Type) [Countable J] [Nonempty J] (Phi : Channel I J), ReversibleOn Phi.val S →
∃ (K : Type) (_ : Countable K) (_ : Nonempty K) (sigma : State K),
IsometricallyEquivalent Phi.val (appendingMap sigma) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable and nonempty and . Call a matrix nuclear if for vectors with ; a state is a nuclear matrix with real nonnegative quadratic forms on every finite coordinate set and summable real diagonal of sum . Put , let be a chosen bounded operator with coordinate matrix , or zero if none exists, and write . Let be a set of states, each equal to for some unit vector , such that the closed span of the ranges of , , is all of . Then the following are equivalent: for every subset with both and nonempty, there are and with ; and, for every countable nonempty set and every channel admitting a channel with for every , there are a countable nonempty set and a state on such that is isometrically equivalent to the map . Explicitly, this equivalence of maps means that there is a bounded with and, for every nuclear ,
Here a channel means a map preserving nuclear matrices, additive and complex homogeneous on them, whose entrywise amplification by every finite identity preserves states; no condition on its values on nonnuclear matrices is included. The dense-span assumption excludes , while the condition about splitting is vacuous for a singleton.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.