PhyslibAlpha.ProbabilisticTheory.Classical.EnsembleRefinement
Refinement of ensembles
i. Overview
An ensemble is a recipe for preparing a state: choose one of finitely many states with given probabilities. We write it as a finite list of weighted states, a state times a nonnegative weight. Its total is their sum, the state it prepares. Two ensembles with the same total cannot be told apart by any measurement.
Ensembles refine when any two ensembles with the same total have a common refinement. This is a table of weighted states. Its rows add up to the members of the first ensemble, and its columns add up to the members of the second. For a die it is a joint probability distribution with the two ensembles as marginals.
Refinement is the physical content of being classical. On a simplex it follows from uniqueness: decompose every member into pure states and cut. Conversely, refinement is all the uniqueness lemma needs. A qubit shows the failure: the maximally mixed state is an equal mixture of spin up and down and of spin left and right, and these two ensembles have no common refinement.
ii. Key results
- `EnsemblesRefine E` states that ensembles refine. - `IsClassical.ensemblesRefine` proves that ensembles refine when positive functionals form a lattice. - `EnsemblesRefine.eq_of_sum_weighted_eq` proves that, when ensembles refine, a mixture of different pure states determines its weights. - `EnsemblesRefine.upperEnvelope_add_le` proves that, when ensembles refine, upper envelopes are subadditive. - `IsSimplexStateSpace.ensemblesRefine` proves that ensembles refine on a simplex.
iii. Table of contents
- A. Ensembles of weighted states
- B. Refinement separates pure states
- C. Upper envelopes on refining ensembles
- D. Ensembles refine on a simplex
A. Ensembles of weighted states
B. Refinement separates pure states
C. Upper envelopes on refining ensembles
D. Ensembles refine on a simplex
6 declarations
The ensemble refinement property of an order unit space
Let be an order unit space. The property `EnsemblesRefine E` states that any two finite ensembles of weighted states with the same total admit a common refinement. Specifically, for any two finite families of positive linear functionals and on such that , there exists a "table" of positive linear functionals satisfying: 1. The sum of each row matches the first ensemble: for all . 2. The sum of each column matches the second ensemble: for all .
Classicality implies ensemble refinement
Let be a classical order unit space. Then ensembles of weighted states in admit a common refinement. That is, given two finite families of positive linear functionals and on satisfying there exists a family of positive linear functionals such that for each , and for each .
Ensembles with equal totals have a common refinement table
Let be an order unit space that satisfies the ensemble refinement property. Given two finite families of positive linear functionals and on such that their totals are equal, i.e., , there exists a refinement table of positive linear functionals such that: 1. For each , . 2. For each , .
Choquet–Meyer: Subadditivity of the upper envelope for refining ensembles
Let be an order unit space that satisfies the ensemble refinement property (meaning any two finite ensembles of weighted states with the same total admit a common refinement). For any finite, non-empty family of elements in , and any two positive linear functionals and on , the upper envelope of is subadditive:
Simplex state spaces are classical
Let be an Archimedean order-unit space. If the state space is a simplex (meaning every state has a unique representation as a probability measure on the pure states), then is a classical space. In this context, being classical implies that the set of positive linear functionals on forms a lattice, such that any two positive functionals have a least upper bound (supremum) determined by the integration against the supremum of their corresponding measures.
Ensembles refine on a simplex
If the state space of an Archimedean order-unit space is a simplex, then ensembles in refine. Specifically, for any two finite families of positive linear functionals and on that prepare the same total state (i.e., ), there exists a common refinement. This refinement is a collection of positive linear functionals such that the sum of each row matches the first ensemble () and the sum of each column matches the second ensemble ().
