Sections 7.1–7.2 / (94),(101): resource wasting and tensor blocking
OpenQAlgorithms.Papers.Independent.Gap20.P07.error_wastingAndBlockingLet be arbitrary CPTP channels on nonzero complex Hilbert spaces and let be their computed full-cb simulation error for positive integers . Then
and for all positive ,
These are consequences of wasting resources and tensor blocking, not hypotheses imposed on the physical channel. The reference may be noisy.
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.26--27, (94),(101): resource wasting and blocking are conclusions
about the computed physical-channel error, including noisy references. -/
theorem error_wastingAndBlocking {I J K L : Type}
[Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L]
(T : Operation I J) (S : Operation K L)
(hT : IsTraceClassChannel T) (hS : IsTraceClassChannel S) :
ErrorMonotone (blockError T S) ∧ ErrorSubadditive (blockError T S) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be arbitrary nonempty types and let from matrices on to matrices on , and from matrices on to matrices on , be trace class channels in the following sense: a matrix is trace class when for sequences in the corresponding spaces with summable ; a density matrix is trace class, has real nonnegative finite principal quadratic forms, and has summable real diagonal with sum ; and a trace class channel preserves trace class matrices, is additive and complex homogeneous on them, and preserves densities after every finite ancillary block amplification. Let be the infimum of the nonnegative extended real costs of such expansions, with empty infimum , and define , where applies separately to every block indexed by two ancillary labels in . For positive integers , define
where arrows indicate maps between matrices on those label types, and tensor powers apply the map recursively to each coordinate, with the zeroth power acting on the singleton empty-coordinate matrix. Then, for every pair of positive integers ,
and, for every four positive integers ,
All errors and inequalities take values in ; the block arguments in these conclusions exclude zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.