Physlib

PhyslibAlpha.ProbabilisticTheory.State.PureMeasurement

Purity is the absence of side information

i. Overview

Roll a die and, depending on the roll, prepare a state; then perform a measurement. Someone who is only told the prepared state predicts the outcome with its Born law. Someone who is also told how the state was prepared, and sees the roll, may predict better: the roll is side information. It is useless exactly when the roll and the outcome are independent random variables.

**A state is pure exactly when it has no side information:** however it is prepared, the roll and the outcome of any yes/no measurement are independent. Being handed the state is as good as being handed the state together with the procedure that prepared it. Conversely, every mixed state can be prepared by choosing between two states in such a way that some yes/no measurement detects the choice. For a pure state, the roll is also independent of the outcome of any measurement with a countably generated outcome space.

Behind this lies a sharper statement: a state is pure exactly when every preparation of it is trivial, with every expectation value almost surely independent of the roll.

ii. Key results

- `Preparation.NoSideInfo` : the roll and the outcome of a measurement are independent. - `UnitalPositiveLinearMap.HasNoSideInfo` : however the state is prepared, the roll and the outcome of any yes/no measurement are independent. - `UnitalPositiveLinearMap.isPure_iff_hasNoSideInfo` : a normal state is pure exactly when it has no side information. - `UnitalPositiveLinearMap.isMixed_iff_exists_sideInfo` : a normal state is mixed exactly when it can be prepared from two states so that some yes/no measurement detects the choice. - `Preparation.noSideInfo_of_isPure` : preparing a pure state, the roll is independent of the outcome of every measurement with a countably generated outcome space. - `Preparation.noSideInfo_iff_postprocessEquivAE` : no side information means that the outcome law given the roll is no more informative than the outcome law ignoring it.

iii. Table of contents

  • A. Trivial preparations
  • B. Preparations of pure states
  • C. Pure states from trivial preparations
  • D. Side information
  • E. Purity is the absence of side information

A. Trivial preparations

B. Preparations of pure states

C. Pure states from trivial preparations

D. Side information

E. Purity is the absence of side information

19 declarations

definition

A preparation pp is trivial

A preparation procedure pp with outcome space XX and observable space EE is defined to be **trivial** if, for every observable A∈EA \in E, the expectation value of AA in the state prepared given a specific outcome x∈Xx \in X is almost surely equal to the expectation value of AA in the average state p.statep.\text{state}. Mathematically, pp is trivial if for every A∈EA \in E: (p.prepare(x))(A)=p.state(A) (p.\text{prepare}(x))(A) = p.\text{state}(A) for almost every xx with respect to the probability measure p.lawp.\text{law} on XX.

theorem

A Preparation is Trivial if it is Trivial on Effects

Let pp be a preparation procedure with outcome space XX and observable space EE. Suppose that for every effect e∈Ee \in E (an element such that 0≤e≤10 \le e \le 1), the expectation value of the state prepared given a specific outcome xx, denoted (p.prepare(x))(e)(p.\text{prepare}(x))(e), is almost surely equal to the expectation value of the average state p.state(e)p.\text{state}(e) with respect to the probability measure p.lawp.\text{law} on XX. Then the preparation pp is trivial, meaning that for every observable A∈EA \in E, (p.prepare(x))(A)=p.state(A)(p.\text{prepare}(x))(A) = p.\text{state}(A) holds for almost every xx.

theorem

Conditional State of a Pure Preparation Equals the Original State

Let pp be a preparation procedure with outcome space XX and observable space EE. Let ω\omega be the average state prepared by the procedure (denoted p.statep.\text{state}). If ω\omega is a pure state, then for any measurable event s⊆Xs \subseteq X whose probability P(s)\mathbb{P}(s) (given by p.lawp.\text{law}) is strictly between 00 and 11, the conditional state of the preparation given ss is equal to ω\omega.

theorem

∫sprepare(x)(A) dμ=μ(s)ρ(A)\int_s \text{prepare}(x)(A) \, d\mu = \mu(s) \rho(A) for pure states

Let pp be a preparation procedure with outcome space XX and observable space EE, and let ρ\rho be the average state prepared by pp. If ρ\rho is a pure state, then for any measurable subset s⊆Xs \subseteq X and any observable A∈EA \in E, the integral of the expectation value of AA given the outcome xx (denoted by (p.prepare(x))(A)(p.\text{prepare}(x))(A)) over the set ss is equal to the probability of ss times the expectation value of AA in the state ρ\rho: ∫s(p.prepare(x))(A) dμ(x)=μ(s)ρ(A) \int_s (p.\text{prepare}(x))(A) \, d\mu(x) = \mu(s) \rho(A) where μ\mu is the probability measure on XX associated with the preparation pp.

theorem

Every preparation of a pure state is trivial

Let pp be a preparation procedure with outcome space XX and observable space EE. If the average state ρ\rho prepared by pp (denoted p.statep.\text{state}) is a pure state, then the preparation pp is trivial. That is, for every observable A∈EA \in E, the expectation value of AA in the state prepared given a specific outcome x∈Xx \in X is almost surely equal to the expectation value of AA in the average state ρ\rho: (p.prepare(x))(A)=ρ(A) (p.\text{prepare}(x))(A) = \rho(A) for p.lawp.\text{law}-almost every x∈Xx \in X.

theorem

A normal state is pure if its preparations from two states are trivial

Let ω\omega be a normal state on an observable space EE. If every preparation procedure pp with a two-element outcome space (the type `Bool`) that averages to the state ω\omega is trivial, then ω\omega is a pure state. A preparation pp is trivial if, for every observable A∈EA \in E, the state prepared for a specific outcome xx satisfies (p.prepare(x))(A)=ω(A)(p.\text{prepare}(x))(A) = \omega(A) for almost every xx with respect to the probability measure of the preparation.

theorem

A normal state ω\omega is pure   ⟺  \iff all preparations of ω\omega are trivial

Let ω\omega be a normal state on an observable space EE. The state ω\omega is pure if and only if every preparation procedure pp with outcome space XX that yields ω\omega as its average state (i.e., p.state=ωp.\text{state} = \omega) is trivial. A preparation pp is trivial if for every observable A∈EA \in E, the expectation value of AA given a specific outcome x∈Xx \in X is almost surely equal to the average expectation value: (p.prepare(x))(A)=ω(A) (p.\text{prepare}(x))(A) = \omega(A) for p.lawp.\text{law}-almost every x∈Xx \in X.

definition

The roll of pp and outcome of MM are independent

Given a preparation procedure pp with an outcome space XX and a law (probability measure) μ\mu, and a measurement MM with an outcome space Ω\Omega, let K:X→P(Ω)K: X \to \mathcal{P}(\Omega) be the outcome law kernel that assigns a probability measure on Ω\Omega for each roll x∈Xx \in X. The preparation pp has **no side information** about the measurement MM if the random variables representing the roll (the projection onto XX) and the measurement outcome (the projection onto Ω\Omega) are independent with respect to the joint measure μ⊗K\mu \otimes K on X×ΩX \times \Omega.

theorem

p.NoSideInfo M  ⟺  p.\text{NoSideInfo } M \iff equality of joint roll-outcome measures

Let pp be a preparation procedure with an outcome space XX (the "die roll") and a probability measure μ=p.law\mu = p.\text{law} on XX. Let MM be a measurement with an outcome space Ω\Omega. The preparation pp has **no side information** about the measurement MM if and only if the joint measure on X×ΩX \times \Omega formed by the roll law and the outcome law (which depends on the roll), denoted μ⊗p.outcome M\mu \otimes p.\text{outcome } M, is equal to the joint measure formed by the roll law and the Born law of the average state (which ignores the roll), denoted μ⊗p.forgetfulOutcome M\mu \otimes p.\text{forgetfulOutcome } M.

theorem

Almost everywhere equality of outcome laws implies no side information

Let pp be a preparation procedure with an outcome space XX and a probability measure μ\mu, and let MM be a measurement with an outcome space Ω\Omega. Let K:X→P(Ω)K: X \to \mathcal{P}(\Omega) be the outcome law kernel (where K(x)K(x) is the distribution of measurement MM given the preparation roll xx), and let KavgK_{\text{avg}} be the constant kernel representing the Born law of MM for the average state prepared by pp. If K(x)=KavgK(x) = K_{\text{avg}} for μ\mu-almost every x∈Xx \in X, then the preparation pp has no side information about the measurement MM, meaning the random variables representing the roll and the measurement outcome are independent.

theorem

pp has no side information for MM iff p.outcome M=p.forgetfulOutcome Mp.\text{outcome } M = p.\text{forgetfulOutcome } M almost surely

Let pp be a preparation procedure with roll space XX and probability measure μ=p.law\mu = p.\text{law}, and let MM be a measurement with an outcome space Ω\Omega. If Ω\Omega is countably generated, then pp has no side information about MM (meaning the roll and the measurement outcome are independent) if and only if the outcome law of MM given the roll xx is almost surely equal to the forgetful outcome law (the Born law of MM on the average prepared state p.statep.\text{state}). Mathematically, this equivalence is expressed as: p.NoSideInfo M  ⟺  p.outcome M=p.forgetfulOutcome M a.e. [μ]p.\text{NoSideInfo } M \iff p.\text{outcome } M = p.\text{forgetfulOutcome } M \text{ a.e. } [\mu] where p.outcome Mp.\text{outcome } M is the Markov kernel mapping a roll xx to the measurement law of the state prepared by xx.

theorem

Independence of Roll and Measurement Outcome   ⟺  \iff Post-processing Equivalence of Outcome Laws

Let pp be a preparation procedure with roll space XX and probability law μ\mu, and let MM be a measurement with a countably generated outcome space Ω\Omega. The preparation pp has no side information about MM (meaning the random variables representing the preparation roll and the measurement outcome are independent) if and only if the Markov kernel representing the outcome law given the roll (p.outcome Mp.\text{outcome } M) and the Markov kernel representing the outcome law ignoring the roll (p.forgetfulOutcome Mp.\text{forgetfulOutcome } M) are almost surely equivalent under mutual post-processing with respect to μ\mu.

theorem

For Trivial Preparations, p.outcome M=p.forgetfulOutcome Mp.\text{outcome } M = p.\text{forgetfulOutcome } M Almost Surely

Let pp be a preparation procedure with roll space XX, observable space EE, and a probability measure p.lawp.\text{law} describing the rolls. If pp is a **trivial preparation** (meaning the expectation values of any observable given a specific roll xx are almost surely equal to the expectation values of the average state p.statep.\text{state}), then for any measurement MM with a countably generated outcome space Ω\Omega, the **outcome law** of MM given the roll xx is almost surely equal to the **forgetful outcome law** (the Born law of MM on the average state p.statep.\text{state}). Mathematically, the Markov kernels satisfy: p.outcome M=p.forgetfulOutcome M p.\text{outcome } M = p.\text{forgetfulOutcome } M almost everywhere with respect to the measure p.lawp.\text{law}.

theorem

No side information for ee implies (p.prepare x)(e)=(p.state)(e)(p.\text{prepare } x)(e) = (p.\text{state})(e) almost surely

Let pp be a preparation procedure with a space of "rolls" XX and a probability measure μ\mu on XX. Let ee be an effect in the observable space EE. If pp has no side information about the binary (yes/no) measurement associated with ee (meaning the roll and the measurement outcome are independent), then for μ\mu-almost every roll x∈Xx \in X, the probability of the effect ee in the state prepared given xx is equal to its probability in the average state p.statep.\text{state}. That is, (p.prepare x)(e)=(p.state)(e) (p.\text{prepare } x)(e) = (p.\text{state})(e) for μ\mu-almost all xx.

theorem

A preparation pp is trivial   ⟺  \iff it has no side information for all binary measurements

Let pp be a preparation procedure with outcome space XX (representing the "roll") and observable space EE. The preparation pp is **trivial** if and only if, for every effect e∈Ee \in E (an element such that 0≤e≤10 \le e \le 1), pp carries **no side information** about the binary (yes/no) measurement associated with ee. In this context, a preparation is trivial if the expectation value of any observable given a roll x∈Xx \in X is almost surely equal to the expectation value in the average state, and "no side information" means the outcome of the roll and the outcome of the measurement are independent random variables.

theorem

Purity implies independence of roll and outcome for countably generated measurements

Let pp be a preparation procedure with an outcome space XX and a law μ\mu. Let the average state prepared by the procedure, ρ=∫Xp.prepare(x) dμ\rho = \int_X p.\text{prepare}(x) \, d\mu, be a pure state (i.e., an extreme point of the state space). For any measurement MM with a countably generated outcome space Ω\Omega, the preparation pp has no side information about MM. That is, the random variable representing the "roll" x∈Xx \in X and the random variable representing the measurement outcome ω∈Ω\omega \in \Omega are independent.

definition

ω\omega has no side information

A state ω∈S[R,E]\omega \in \mathcal{S}[\mathbb{R}, E] has **no side information** if for every preparation procedure pp (with an outcome space XX) such that its average state is ω\omega (i.e., p.state=ωp.\text{state} = \omega), the outcome of the preparation (the "roll") and the outcome of any binary measurement corresponding to an effect e∈[0,1]Ee \in [0, 1]_E are independent random variables.

theorem

A normal state is pure   ⟺  \iff it has no side information

Let ω\omega be a normal state. Then ω\omega is a pure state if and only if ω\omega has no side information. That is, ω\omega is an extreme point of the state space if and only if for every preparation procedure pp whose average state is ω\omega, the outcome of the preparation (the "roll") and the outcome of any binary measurement (corresponding to an effect ee) are independent random variables.

theorem

A normal state ω\omega is mixed if and only if it leaks side information (ω is mixed  ⟺  ∃ side information\omega \text{ is mixed} \iff \exists \text{ side information})

Let ω\omega be a normal state on an ordered vector space EE. Then ω\omega is a mixed state if and only if there exists a preparation procedure pp with a binary outcome space (i.e., a choice between two states) whose average state is ω\omega, and there exists an effect e∈[0,1]e \in [0, 1] such that pp leaks side information regarding the binary measurement defined by ee. In this context, side information exists when the "roll" (the internal choice made during preparation) and the outcome of the measurement are not independent random variables.