Physlib

PhyslibAlpha.ProbabilisticTheory.Measurement.Postprocessing

Post-processing of measurements

i. Overview

A measurement `M` is a post-processing of a measurement `N` when `M` can be simulated by performing `N` and processing its outcome classically: `M = N ∘ K` for a normal channel `K` between the classical systems of outcomes. Thus `M ≤ₚ N` means that `N` is at least as informative as `M`. Normal classical channels are Markov kernels, so the processing is a random relabeling of the outcome; relabeling along a measurable map is the deterministic case. In every normal state, the Born law of `M` is the Born law of `N` composed with the kernel.

ii. Key results

- `Measurement.IsPostprocessing` : the information preorder on measurements. - `Measurement.isPostprocessing_iff_kernel` : post-processing through a Markov kernel. - `Measurement.mapOutcome` : deterministic relabeling of measurement outcomes. - `Measurement.IsPostprocessing.probabilityLaw_eq` : the Born law of a post-processing is the Born law of the original measurement composed with a Markov kernel.

iii. Table of contents

  • A. Post-processing
  • B. Relabeling outcomes
  • C. Born laws

A. Post-processing

B. Relabeling outcomes

C. Born laws

15 declarations

definition

MM is a post-processing of NN (M≤pNM \le_p N)

A measurement MM with outcome space Ω\Omega is a **post-processing** of a measurement NN with outcome space Ω′\Omega' if there exists a normal channel K:BoundedMeasurable(Ω)→BoundedMeasurable(Ω′)K: \text{BoundedMeasurable}(\Omega) \to \text{BoundedMeasurable}(\Omega') such that the unital positive linear map associated with MM (the Born law/channel ΦM\Phi_M) is equal to the composition of the map associated with NN (ΦN\Phi_N) and KK, i.e., ΦM=ΦN∘K\Phi_M = \Phi_N \circ K. This indicates that MM can be simulated by performing NN and applying classical processing to the outcomes.

definition

Information preorder M≤pNM \le_p N between measurements

The notation M≤pNM \le_p N represents the information preorder on measurements, indicating that the measurement MM is a post-processing of the measurement NN. This relation signifies that NN is at least as informative as MM, as MM can be simulated by performing NN and applying a classical processing channel to its outcomes.

theorem

Reflexivity of the post-processing relation (M≤pMM \le_p M)

For any measurement MM with outcome space Ω\Omega acting on a system EE, MM is a post-processing of itself, denoted by M≤pMM \le_p M.

theorem

If M≤pNM \le_p N and N≤pPN \le_p P, then M≤pPM \le_p P

Let MM, NN, and PP be measurements. If MM is a post-processing of NN (denoted M≤pNM \le_p N) and NN is a post-processing of PP (denoted N≤pPN \le_p P), then MM is a post-processing of PP (M≤pPM \le_p P). This confirms that the post-processing relation between measurements is transitive.

theorem

M≤pNM \le_p N if and only if MM is a post-processing of NN through a Markov kernel

Let MM and NN be measurements on an order unit space EE with outcome spaces Ω\Omega and Ω′\Omega' respectively. MM is a post-processing of NN (denoted M≤pNM \le_p N) if and only if there exists a Markov kernel κ\kappa from Ω′\Omega' to Ω\Omega such that the associated channel ΦM\Phi_M is equal to the composition of the channel ΦN\Phi_N and the classical channel Φκ\Phi_\kappa induced by the kernel κ\kappa, i.e., ΦM=ΦN∘Φκ\Phi_M = \Phi_N \circ \Phi_\kappa.

definition

MM and NN are post-processing equivalent (M≈pNM \approx_p N)

Two measurements MM (with outcome space Ω\Omega) and NN (with outcome space Ω′\Omega') are **post-processing equivalent** if MM is a post-processing of NN (M≤pNM \le_p N) and NN is a post-processing of MM (N≤pMN \le_p M). This equivalence relation implies that each measurement can be simulated by performing the other and applying a classical channel (Markov kernel) to the outcomes, meaning MM and NN are equally informative.

theorem

Post-processing equivalence is reflexive (M≈pMM \approx_p M)

Let MM be a measurement on an order unit space EE with outcome space Ω\Omega. Then MM is post-processing equivalent to itself, denoted as M≈pMM \approx_p M.

theorem

Symmetry of Post-processing Equivalence: M≈pN  ⟹  N≈pMM \approx_p N \implies N \approx_p M

Let MM and NN be measurements with outcome spaces Ω\Omega and Ω′\Omega', respectively, both taking values in the same space EE. If MM and NN are post-processing equivalent (M≈pNM \approx_p N), then NN and MM are post-processing equivalent (N≈pMN \approx_p M).

theorem

M≈pNM \approx_p N and N≈pPN \approx_p P implies M≈pPM \approx_p P

Let MM, NN, and PP be measurements with outcome spaces Ω\Omega, Ω′\Omega', and Ω′′\Omega'' respectively, all taking values in the same order unit space EE. If MM is post-processing equivalent to NN (denoted M≈pNM \approx_p N) and NN is post-processing equivalent to PP (N≈pPN \approx_p P), then MM is post-processing equivalent to PP (M≈pPM \approx_p P).

definition

Deterministic relabeling of measurement outcomes along a measurable map ff

Given a measurement NN on a measurable space Ω′\Omega' taking values in an order unit space EE, and a measurable map f:Ω′→Ωf: \Omega' \to \Omega between outcome spaces, this definition constructs a new measurement on Ω\Omega. The channel (unital positive linear map) associated with this new measurement is obtained by composing the channel of NN with the pull-back channel f∗f^* induced by ff. Explicitly, for any measurable set S⊆ΩS \subseteq \Omega, the effect assigned to SS by the new measurement is the effect assigned to the preimage f−1(S)f^{-1}(S) by the original measurement NN.

theorem

The effect of a relabeled measurement on ss equals N(f−1(s))N(f^{-1}(s))

Let NN be a measurement with outcome space Ω′\Omega' taking values in an order unit space EE, and let f:Ω′→Ωf: \Omega' \to \Omega be a measurable map. For any measurable set s⊆Ωs \subseteq \Omega, the effect assigned to ss by the deterministically relabeled measurement (denoted as `N.mapOutcome f`) is equal to the effect assigned by the original measurement NN to the preimage f−1(s)f^{-1}(s).

theorem

Measurable relabeling N.mapOutcome fN.\text{mapOutcome } f is a post-processing of NN (N.mapOutcome f≤pNN.\text{mapOutcome } f \le_p N)

Let NN be a measurement on a measurable space Ω′\Omega' and f:Ω′→Ωf : \Omega' \to \Omega be a measurable map. The measurement N.mapOutcome fN.\text{mapOutcome } f, obtained by deterministically relabeling the outcomes of NN according to ff (such that the effect assigned to a set S⊆ΩS \subseteq \Omega is the effect assigned to the preimage f−1(S)f^{-1}(S) by NN), is a post-processing of NN, denoted N.mapOutcome f≤pNN.\text{mapOutcome } f \le_p N.

theorem

Born Law of a Post-processed Measurement via Channel Composition

Let MM and NN be measurements on an order unit space EE with outcome spaces Ω\Omega and Ω′\Omega', respectively. Let K:BoundedMeasurable(Ω)→BoundedMeasurable(Ω′)K : \text{BoundedMeasurable}(\Omega) \to \text{BoundedMeasurable}(\Omega') be a normal channel. If the channel associated with MM is the composition of the channel associated with NN and the channel KK (i.e., ΦM=ΦN∘K\Phi_M = \Phi_N \circ K), then for every normal state ω\omega of the system, the Born law (probability measure) of MM is equal to the composition of the Markov kernel κ\kappa (associated with KK) and the Born law of NN: Law(M,ω)=κ∘mLaw(N,ω) \text{Law}(M, \omega) = \kappa \circ_m \text{Law}(N, \omega)

theorem

The Born law of a post-processing is the composition of the original Born law and a Markov kernel.

Let MM and NN be measurements on a system EE with outcome spaces Ω\Omega and Ω′\Omega', respectively. If MM is a post-processing of NN (denoted M≤pNM \le_p N), then there exists a Markov kernel κ\kappa from Ω′\Omega' to Ω\Omega such that for every normal state ω\omega of the system, the probability law (Born law) of MM given ω\omega is the composition of the kernel κ\kappa with the probability law of NN given ω\omega: Law(M,ω)=κ∘mLaw(N,ω) \text{Law}(M, \omega) = \kappa \circ_m \text{Law}(N, \omega)

theorem

The Born Law of Relabeled Outcomes is a Push-forward Measure

Let NN be a measurement on a system EE with outcome space Ω′\Omega'. Let f:Ω′→Ωf: \Omega' \to \Omega be a measurable map used to relabel the outcomes of NN, and let N.mapOutcome(f)N.\text{mapOutcome}(f) be the resulting measurement on Ω\Omega. For any normal state ω\omega of the system, the Born law (probability measure) of the relabeled measurement is the push-forward of the Born law of the original measurement NN along the map ff. That is, Law(N.mapOutcome(f),ω)=f∗(Law(N,ω)), \text{Law}(N.\text{mapOutcome}(f), \omega) = f_* (\text{Law}(N, \omega)), where f∗f_* denotes the push-forward operation on measures.