Appending one measurement to a Lüders sequence
ProvedShadowTomography.UpperBound.seqAccept_snoclinear-algebraquantum-information
Let be operators on , let be an effect () and a matrix. With , the probability that applied in succession by Lüders instruments all accept is
Equivalently, it is the acceptance probability of on the unnormalised post-selected state .
This telescoping identity is how the potential of the shadow-tomography algorithm is related to the post-selected hypotheses (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
/-- **K4b.** Appending one more effect `G` to a Lüders sequence: the probability that all of
`F 0, …, F (M-1), G` accept equals `Tr(G · A σ A†)` with `A = √F_{M-1} ⋯ √F_0`
(the unnormalised post-selected state). -/
theorem seqAccept_snoc {n : Type} [Fintype n] [DecidableEq n] {M : ℕ}
(F : Fin M → Matrix n n ℂ) (G : Matrix n n ℂ) (hG : IsEffect G) (σ : Matrix n n ℂ) :
seqAccept (Fin.snoc (α := fun _ => Matrix n n ℂ) F G) σ =
(G * (((List.finRange M).reverse.map (fun i => CFC.sqrt (F i))).prod * σ *
(((List.finRange M).reverse.map (fun i => CFC.sqrt (F i))).prod).conjTranspose)).trace.re := 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