Section 3.2 / (20),(21): exact embedding and dimensional obstruction
ProvedQAlgorithms.Papers.Independent.Gap20.P07.idealSimulationErrorLet be integers and let be the infimum of the full-cb error over all CPTP encoders and decoders simulating an ideal -level system through an ideal -level system. Then
The first branch pads the logical matrix into matrices; the second is the dimensional obstruction. These estimates include equal dimensions.
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.9--10, (20)--(21): exact embedding and dimensional obstruction.
The surrounding prose reverses the padding dimensions; the formulas fix them. -/
theorem idealSimulationError (n m : ℕ) (hn : 0 < n) (hm : 0 < m) :
(m ≤ n → codingSimulationDistance (id : Operation (Fin n) (Fin n))
(id : Operation (Fin m) (Fin m)) = 0) ∧
(n ≤ m → ENNReal.ofReal (1 - (n : ℝ) / m) ≤
codingSimulationDistance (id : Operation (Fin n) (Fin n)) (id : Operation (Fin m) (Fin m))) := 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 every pair of natural numbers , let denote the identity maps on the respective complex matrix spaces. Define as the infimum of over expansions by square-summable vectors for which that sum is finite; trace class means that at least one such expansion exists, and an empty infimum is . A density is trace class with positive semidefinite finite principal restrictions and summable real diagonal of sum . A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities under every finite ancillary extension. For any map , write for the supremum of over integers and trace-class with , where the ancillary extension applies separately to each matrix block with fixed ancillary indices. Let
Then both implications hold:
When , both implications apply and give zero error and a zero lower bound. The assertion concerns an infimum and does not assert that an encoder–decoder pair attains it.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.