Running a block measurement on more copies than needed
ProvedShadowTomography.UpperBound.povm_liftquantum-information
Let with , and let be a POVM on , i.e. a measurement of blocks of registers each. Then there is a POVM on with the same outcome set such that for every density operator on and every event ,
( regroups the copies into blocks of , applies to the first blocks and ignores the rest.)
This lets a measurement whose copy count is only bounded, such as the Gentle Search procedure of Lemma 15 run on amplified registers (p. 16), be used inside a protocol with a fixed copy budget.
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
/-- **K6.** Regrouping and padding copies: a measurement on `k` blocks of `q` copies each
(a POVM on `(ρ^{⊗q})^{⊗k}`) with `k ≤ ℓ` can be run on `q ℓ` copies of `ρ` (ignoring the unused
ones) with exactly the same outcome statistics, for every state `ρ`. -/
theorem povm_lift {n : Type} [Fintype n] [DecidableEq n] {Ω : Type} [Fintype Ω]
(q k ℓ : ℕ) (hk : k ≤ ℓ) (P : POVM Ω (Fin k → (Fin q → n))) :
∃ P' : POVM Ω (Fin (q * ℓ) → n),
∀ ρ : Matrix n n ℂ, WildeQIT.IsDensityOperator ρ → ∀ A : Ω → Prop,
P'.prob (tensorPow ρ (q * ℓ)) A = P.prob (tensorPow (tensorPow ρ q) k) A := 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