Remark 2: recovery is unitary preservation under Corollary 3 hypotheses
OpenQAlgorithms.Papers.Independent.Gap48.P45.pureFamilyRecovery_unitaryPreservationAll 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. Assume either or , and let be a complete pure-state family. Then
The printed reference to Corollary 2 is read as Corollary 3, for the reasons recorded in the moderation notes; independent moderation is pending.
This result identifies family recovery with unitary preservation in the simplified regimes.
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)
/-- Remark 2, PDF p.18. PRINTED: conditions of Corollary 2. CHANGED: conditions
of Corollary 3. WHY: the preceding proof uses those two channel conditions;
Corollary 2 permits mixed appended ancillas and cannot give unitary preservation.
This source correction requires independent moderation. -/
theorem pureFamilyRecovery_unitaryPreservation
{I J : Type} [Countable I] [Countable J] [Nonempty I] [Nonempty J]
(Phi : Channel I J) (hRegime : SimplifiedRegime Phi.val)
(S : Set (State I)) (hPure : S ⊆ pureStates I) (hComplete : CompleteFamily S) :
ReversibleOn Phi.val S ↔
∃ U : Hilbert I ≃ₗᵢ[ℂ] Hilbert J,
∀ rho ∈ S, Phi.val rho.coefficients = conjugateCoeff U.toLinearIsometry.toContinuousLinearMap rho.coefficients := 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, nonempty types, and write , with coordinate vectors . A coefficient matrix is trace class here if it has an expansion , with and . A state is such a matrix whose quadratic form on every finite coordinate set is real and nonnegative, and whose real diagonal is summable with sum ; a pure state has coefficients for some unit vector . A channel preserves trace class, is additive and complex homogeneous on trace-class inputs, and, for every , its amplification
takes states on to states on . For any coefficient matrix , let be a chosen bounded operator on having coordinate matrix , if one exists, and otherwise; write . Define
where has its only nonzero entry, , in row , column . Assume either that implies for every bounded , or that the cardinalities of and , with every infinite cardinality replaced by , are equal and finite. Let be a set of pure states on , and assume that the closed complex linear span of all vectors , with and , is . Then there exists a channel satisfying for every if and only if there exists a surjective complex linear isometry such that
The same must work for every member of ; completeness excludes under the nonemptiness assumption on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.