Theorem 7 — mixed-state weak-mixing sandwich
OpenQSDMixing.GU.Supplement.mixed_state_weak_mixing_sandwichfourier-analysismarkov-chainp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-mixing-timequantum-state-discrimination
Let be a nonempty finite uniform ensemble of mixed states on , with and whenever . Let be the quantum weak mixing time defined from the block Gram matrices and their block pinching.
For every ,
Thus the exact tolerance gives the lower side of the sample-complexity sandwich without assuming geometrical uniformity or purity.
Differences from the source:
- encoding: finite-dimensional density matrices → base-mission countable-mixture states on together with square matrix factors whose products equal their density matrices; reason: every finite-dimensional density matrix has such a mixture and square-root factor
- encoding: a finite uniform ensemble of states → a nonempty finite label type with the factor built into and the weak mixing time; reason: nonemptiness is the domain condition for the displayed normalization by
- reading: unstated copy-count lower endpoint → integers at least one and -valued minima; reason: this is the paper's natural-number convention and avoids the empty-set value of natural-number infima
Preamble
import Mathlib import Definitions.Def_WildeQIT_fidelity import Definitions.Def_QSDMixing_GU_kMin import Definitions.Def_QSDMixing_GU_Supplement_MixedEnsembleFactorization set_option autoImplicit false
Formal statement
namespace QSDMixing.GU.Supplement
/-- **Theorem 7, p.32.** For every nonempty finite uniform ensemble of finite-dimensional mixed
states with pairwise fidelity below one, the block-Gram quantum weak mixing time sandwiches
minimum-error discrimination sample complexity with the exact tolerance `4√ε`.
Zhou, Leditzky, *A mixing time method for estimating the sample complexity of quantum state
discrimination*, arXiv:2609.40182 (held version, sha256 62fb68dd…), Theorem 7, p.32,
eq. (31). -/
theorem mixed_state_weak_mixing_sandwich {I : Type} [Fintype I] [Nonempty I] {d : ℕ}
(E : MixedEnsembleFactorization I d)
(hdistinct : ∀ i j, i ≠ j →
WildeQIT.fidelity (mixedStateMatrix (E.state i)) (mixedStateMatrix (E.state j)) < 1)
(ε : ℝ) (hε : 0 < ε) (hε' : ε < 1) :
mixedWeakMixingTime E (4 * Real.sqrt ε) ≤ QSDMixing.GU.kMin E.state ε ∧
QSDMixing.GU.kMin E.state ε ≤ mixedWeakMixingTime E ε := by sorry
end QSDMixing.GU.Supplement
Source
Zhou, Leditzky, A mixing time method for estimating the sample complexity of quantum state discrimination, arXiv:2609.40182 (held version, sha256 62fb68dd…), Theorem 7, p.32, eq. (31)