Definition 1.4 and §2.2 — conditional-min-entropy quantum-proof extraction
DefinitionMatrixQuantumSampler595_Correspondence_Supplement_ConditionalExtractorLet be a deterministic map. For every finite quantum register , a normalized cq source is a collection of positive semidefinite blocks with . Its conditional min-entropy is , where guessing probability optimizes over all POVMs on .
The map is a strong quantum-proof extractor when every such source with and an independent uniform public seed satisfies
Here is half the trace norm and is the actual marginal. The output and ideal states are the published base definitions. This predicate places no bound on and allows singular, zero and noncommuting blocks. It supplies the security notion for the construction theorems, whose entropy assumption differs from bounded-storage security.
Formalization Note A -bit seed is indexed by with its uniform distribution, which is just a relabelling of binary strings. The imported entropy is extended-real valued; only normalized sources are tested.
import Mathlib
import Definitions.Def_MatrixQuantumSampler595_Correspondence_QuantumProofExtractor
import Definitions.Def_DIObliviousTransfer_pGuess
namespace MatrixQuantumSampler595.Correspondence.Supplement
/-- Definition 1.4 (p.4), §2.2 (pp.12–13): full conditional-min-entropy security.
The seed alphabet `Fin t` is uniform and independent; for a d-bit seed take t=2^d.
No storage dimension bound or restriction to commuting blocks is imposed. -/
def IsStrongConditionalExtractor {n m t : ℕ}
(F : BitString n → Fin t → BitString m) (k η : ℝ) : Prop :=
∀ q : ℕ, ∀ σ : BitString n → Matrix (Fin q) (Fin q) ℂ,
QAlgorithms.Papers.Independent.Advance50.P02.NormalizedBlocks σ →
(k : EReal) ≤ DIObliviousTransfer.Hmin σ →
QAlgorithms.traceDistance (strongOutputState F σ)
(strongIdealState (m := m) (t := t) σ) ≤ η
end MatrixQuantumSampler595.Correspondence.Supplement