Sequential Lüders acceptance is monotone in the state
ProvedShadowTomography.UpperBound.seqAccept_monolinear-algebraquantum-information
Let be operators on and write , so that the probability that the measurements , applied in succession by their Lüders instruments, all accept on is
If are matrices and satisfy (i.e. is positive semidefinite), then
In the shadow-tomography proof this is applied with and to transfer the quantum-union-bound lower bound from the true state to the maximally mixed starting hypothesis (p. 17).
Preamble
import Mathlib import Definitions.Def_WildeQIT_IsDensityOperator import Definitions.Def_ShadowTomography_UpperBound_IsEffect import Definitions.Def_ShadowTomography_UpperBound_tensorPow import Definitions.Def_ShadowTomography_UpperBound_POVM import Definitions.Def_ShadowTomography_UpperBound_ampMeasurements import Definitions.Def_ShadowTomography_UpperBound_avgMarginal import Definitions.Def_ShadowTomography_UpperBound_seqAccept set_option autoImplicit false open scoped ComplexOrder MatrixOrder
Formal statement
namespace ShadowTomography.UpperBound
/-- **K4a.** Sequential Lüders acceptance is monotone in the state: if `σ ⪰ c ρ` then
`seqAccept F σ ≥ c · seqAccept F ρ`. -/
theorem seqAccept_mono {n : Type} [Fintype n] [DecidableEq n] {M : ℕ}
(F : Fin M → Matrix n n ℂ) (σ ρ : Matrix n n ℂ) (c : ℝ)
(h : (σ - (c : ℂ) • ρ).PosSemidef) :
c * seqAccept F ρ ≤ seqAccept F σ := by
sorry
end ShadowTomography.UpperBoundSource
S. Aaronson, Shadow Tomography of Quantum States, arXiv:1711.01053v2, https://arxiv.org/abs/1711.01053, Section 5 (proof of Theorem 2), pp. 15-19