Minimal sufficient statistical experiments on von Neumann algebras
Yui Kuramochi
Department of Nuclear Engineering, Kyoto University, 6158540 Kyoto, Japan
[email protected]
Abstract
A statistical experiment on a von Neumann algebra is a parametrized family of normal states on
the algebra.
This paper introduces the concept of minimal sufficiency for
statistical experiments
in such operator algebraic situations.
We define equivalence relations of statistical experiments indexed by a common parameter set by
completely positive or Schwarz coarse-graining
and
show that any statistical experiment is equivalent to a minimal sufficient statistical experiment
unique up to normal isomorphism of outcome algebras.
We also establish the relationship between
the minimal sufficiency condition for statistical experiment in this paper
and those for subalgebra.
These concepts and results are applied to the concatenation relation
for completely positive channels with general input and outcome
von Neumann algebras.
In the case of the quantum-classical channel corresponding to
the positive-operator valued measure (POVM),
we prove the equivalence of the minimal sufficient condition
previously proposed by the author and that in this paper.
We also give a characterization of the discreteness of a POVM
up to postprocessing equivalence
in terms of the corresponding
quantum-classical channel.
quantum information, quantum measurement, minimal sufficient statistical experiment, postprocessing equivalence relation
pacs:
03.67.-a, 03.65.Ta, 02.30.Tb
I Introduction
A statistical experiment, or statistical model,
on a von Neumann algebra M is a family
(φθ)θ∈Θ
of normal states on
M.
Such operator algebraic statistical experiments
reflects partial knowledge on the prepared quantum state,
e.g. the state is known to be pure or
to be a Gaussian state parametrized by a finite set of real parameters.
As in the classical mathematical statistics, Halmos and Savage (1949); Bahadur (1954)
we can consider the (minimal) sufficiency for such noncommutative settings.
Umegaki initiated this line of study in Ref. Umegaki, 1959; *umegaki1962,
in which the sufficiency of
a von Neumann subalgebra M1 of M with respect to
(φθ)θ∈Θ is defined by the existence of a
normal conditional expectation E from M onto M1
such that φθ∘E=φθ
for all θ∈Θ.
Later Petz Petz (1986, 1988)
generalized the sufficiency to arbitrary 2-positive channel
Λ:N→M
in the Heisenberg picture
with an arbitrary outcome algebra N.
Here Λ is sufficient if there exists
a 2-positive channel
Γ:M→N
such that
φθ∘Λ∘Γ=φθ
for all θ∈Θ.
Operationally, the channel Γ can be regarded as
a reversing channel that reconstruct the original state φθ
from the coarse-grained state φθ∘Λ.
In this sense, the coarse-grained family of states
(φθ∘Λ)θ∈Θ on N
has the same information about the parameter θ
as the original family (φθ)θ∈Θ,
and such sufficient coarse-grainings induce the equivalence relation
between noncommutative statistical experiments, Guţă and Jenčová (2007)
which is a generalization of the corresponding relation
for classical statistical experiments defined through
sufficient Markov maps. Torgersen (1991)
The minimal sufficiency condition for noncommutative settings so far is
mainly considered for subalgebras;
a subalgebra is minimal sufficient if it is sufficient and included in
all the sufficient subalgebras.
In Ref. Łuczak, 2014 Łuczak
gave a simple proof that
any faithful statistical experiment admits a minimal sufficient subalgebra
by using the mean ergodic theorem
for von Neumann algebras. Kümmerer and Nagel (1979)
Recently, the author has introduced the concept of the minimal sufficient
POVM,
which is the least redundant POVM among the POVMs that bring us the
same information about the measured quantum
system. Kuramochi (2015); *10.1063/1.4961516
In Ref. Kuramochi, 2015; *10.1063/1.4961516
it is shown that any POVM on a separable Hilbert space is postprocessing equivalent to
a minimal sufficient POVM unique up to almost isomorphism.
Then it is natural to ask whether
we can generalize the notion of minimal sufficiency
to noncommutative statistical experiments
and
whether
we can establish existence and uniqueness up to isomorphism
for such general statistical experiments
as in the case of POVM.
In this paper we investigate these questions and give affirmative answers for them.
This paper is organized as follows.
Sec. II is devoted to the preliminaries on von Neumann algebras and channels between them.
In Sec. III we introduce two minimal sufficiency conditions on
statistical experiments by Schwarz and completely positive (CP) coarse-grainings,
which are shown to be equivalent in Theorem 2,
and prove the existence and uniqueness up to isomorphism
of a minimal sufficient statistical experiment equivalent to a given statistical experiment
(Theorem 1).
We also establish
in Theorems 2 and 3
that the minimal sufficiency of a statistical experiment can be characterized
in terms of the minimal sufficiency of subalgebra and vice versa.
We also apply these results to the channel concatenation relation.
In Sec. IV we consider POVMs by identifying them with
quantum-classical (QC) channels
and establish
in Theorem 4
the equivalence between the minimal sufficiency conditions
proposed in this paper and in Ref. Kuramochi, 2015; *10.1063/1.4961516.
We also give a characterization of the discreteness of a POVM up to postprocessing equivalence
in terms of the corresponding QC channel
by using the construction of a minimal sufficient statistical experiment given in Sec. III
(Theorem 5).
II Preliminaries
In this section we introduce preliminaries on von Neumann algebras and fix the notation.
For general reference on operator algebras, we refer Ref. Takesaki, 1979.
Let M be a von Neumann algebra.
The unit element of M is denoted by \mathbbm1M.
A bounded linear functional φ∈M∗
is called normal if it is continuous in the σ-weak topology
(i.e. ultraweak topology) of M
and the set of normal linear functionals on M is written as
M∗,
which can be identified with the predual space of M.
For each φ∈M∗ and A∈M,
φ(A) is also denoted as
⟨φ,A⟩.
A normal linear functional φ∈M∗ is called a normal state on M
if φ is positive and satisfies the normalization condition
φ(\mathbbm1M)=1.
The set of normal states on M is denoted by
S(M).
For each φ∈S(M),
the support of φ is the smallest projection
s(φ)∈M satisfying
φ(s(φ))=1.
A family of normal states
(φθ)θ∈Θ is said to be faithful if for each positive A∈M,
φθ(A)=0
for all θ∈Θ
implies A=0.
This condition is equivalent to
⋁θ∈Θs(φθ)=\mathbbm1M,
where for a family of projections
(Pi) in M,
⋁iPi denotes the supremum projection on M.
The quantum channel describing the general quantum operation or coarse-graining is defined as follows.
Let M and N be von Neumann algebras and
let Λ:M→N be a bounded linear map.
Λ is called unital if Λ(\mathbbm1M)=\mathbbm1N.
Λ
is called normal if
it is continuous in the σ-weak topologies on M and N.
For normal Λ:M→N
we define its predual
Λ∗:N∗→M∗
by Λ∗(φ)=φ∘Λ
(φ∈N∗).
The map Λ∗ is also characterized by the equation
⟨φ,Λ(A)⟩=⟨Λ∗(φ),A⟩
(φ∈N∗,A∈M).
Λ is called positive if Λ(A)≥0 for any A≥0.
Λ is called n-positive (n≥1) if
[TABLE]
holds for any Ai∈M and any Bj∈N.
Λ is called completely positive (CP) if
Λ is n-positive for all n≥1.
Λ is said to be a Schwarz map if it satisfies
[TABLE]
which is called the Schwarz,
or Kadison-Schwarz,
inequality.
If Λ is unital,
the Schwarz inequality reduces to
[TABLE]
or equivalently
[TABLE]
From the conditions (1) and (2)
we can see that any composition and any convex combination
of unital and Schwarz maps are also unital and Schwarz.
Any 2-positive map
is Schwarz. Choi (1974)
If either M or N is abelian,
the Schwarz and CP conditions are reduced to
the simpler condition of positivity.
A linear map
Λ:M→N
is called a Schwarz (respectively, CP)
channel (in the Heisenberg picture)
if Λ is normal, unital, and Schwarz (respectively, CP).
The set of Schwarz (respectively, CP)
channels from M to N is denoted by
ChSch(M→N)
(respectively, ChCP(M→N)).
The sets ChSch(M→M) and
ChCP(M→M) are denoted as
ChSch(M)
and ChCP(M),
respectively.
The identity map on M is denoted by
idM.
For a Schwarz or CP channel Λ:M→N,
M and N are called the outcome and input spaces of
Λ,
respectively.
Here a channel Λ:M→N in the Heisenberg picture
maps a outcome observable
A∈M to the input observable Λ(A)∈N.
On the other hand, the state change in the Schrödinger picture
is described by the predual map Λ∗:N∗→M∗
that maps the input state φ∈S(N)
to the outcome state Λ∗(φ)∈S(M).
Let M be a von Neumann algebra and
let M1 be a von Neumann subalgebra of M.
A conditional expectation, or CP projection,
from M onto M1 is a normal linear mapping
E:M→M1
satisfying
[TABLE]
If E satisfies the above conditions,
then we have the following:
[TABLE]
A conditional expectation E:M→M1
is called faithful if E(A∗A)=0 implies A=0
for any A∈M.
Now we define (minimal) sufficient subalgebras following Ref. Łuczak, 2014.
Let M be a von Neumann algebra,
let M1 be a von Neumann subalgebra of M,
and let (φθ)θ∈Θ be a family of normal states on M.
M1 is called Schwarz (respectively, CP) sufficient subalgebra
with respect to (φθ)θ∈Θ
if there exists
Γ∈ChSch(M→M1)
(respectively, Γ∈ChCP(M→M1))
such that
φθ∘Γ=φθ
for all θ∈Θ.
M1 is called an Umegaki sufficient subalgebra
with respect to (φθ)θ∈Θ
if there exists a conditional expectation
E from M onto M1 such that
φθ∘E=φθ
for all θ∈Θ.
The following implications hold for these notions
of sufficient subalgebra:
[TABLE]
A von Neumann subalgebra M1 of M is called
Schwarz (respectively, CP or Umegaki) minimal sufficient with respect to
(φθ)θ∈Θ
if M1 is Schwarz (respectively, CP or Umegaki) sufficient
and contained in any Schwarz (respectively, CP or Umegaki) sufficient subalgebras.
An important example of a von Neumann algebra is
the set of bounded operators L(H) on a Hilbert space
H.
We call such a von Neumann algebra fully quantum.
The predual L(H)∗
(respectively, the set of normal states S(L(H)))
is identified with the set of trace class operators T(H)
(respectively, the set of density operators S(H))
on H
by the identification
⟨T,A⟩=tr(TA)
(T∈T(H),A∈L(H)).
For a CP channel Λ∈ChCP(L(K)→L(H)),
its predual is a map Λ∗:T(H)→T(K)
that is CP and trace-preserving.
Another important example is the abelian von Neumann algebra.
Let
(Ω,Σ,μ)
be a localizable Segal (1951)
measure space.
We denote the Lp space of
(Ω,Σ,μ) by
Lp(Ω,Σ,μ)
or
Lp(μ)
for 1≤p≤∞.
The notion of μ-almost everywhere (μ-a.e.)
equality defines an equivalence relation on the set of complex-valued Σ-measurable
functions and the equivalence class to which a measurable function f belongs
is denoted by [f]μ.
Note that Lp(μ) is a set of such equivalence classes.
L∞(μ) is an abelian von Neumann algebra acting on the Hilbert space
L2(μ)
and its predual is identified with L1(μ)
by the correspondence
[TABLE]
III Minimal sufficient statistical experiment and channel
In this section we establish existence and uniqueness theorem for minimal sufficient statistical experiments
on general von Neumann algebras.
We also apply this to the concatenation relation for channels.
III.1 Minimal sufficient statistical experiment
A triple E=(M,Θ,(φθ)θ∈Θ)
is called a statistical experiment if
M is a von Neumann algebra,
Θ=∅ is a set,
and (φθ)θ∈Θ∈S(M)Θ
is a family of normal states on M indexed by Θ.
M and Θ are called the outcome space and the parameter set of E,
respectively.
Definition 1**.**
Let
E1=(M1,Θ,(φθ(1))θ∈Θ)
and
E2=(M2,Θ,(φθ(2))θ∈Θ)
be statistical experiments with the common parameter set Θ.
- (i)
E1 is a Schwarz coarse-graining
(respectively, CP coarse-graining)
of E2,
written E1≼SchE2
(respectively, E1≼CPE2),
if there exists Λ∈ChSch(M1→M2)
(respectively, Λ∈ChCP(M1→M2))
such that
φθ(1)=φθ(2)∘Λ
for all θ∈Θ.
2. (ii)
E1 and E2 are called Schwarz equivalent
(respectively, CP equivalent),
written E1∼SchE2
(respectively, E1∼CPE2),
if both
E1≼SchE2 and E2≼SchE1
(respectively, E1≼CPE2 and E2≼CPE1)
hold.
3. (iii)
E1 and E2 are said to be isomorphic,
written E1≅E2,
if there exists a normal isomorphism
π from M1 onto M2 such that
φθ(1)=φθ(2)∘π
for all θ∈Θ.
≼Sch and ≼CP are preorder relations and
∼Sch, ∼CP, and ≅ are equivalence relations for statistical experiments.
The following implications are evident from the definitions:
[TABLE]
We will show in Corollary 1 that
the relations ∼Sch and ∼CP in fact coincide.
We now define the minimal sufficiency conditions as follows.
Definition 2**.**
A statistical experiment E=(M,Θ,(φθ)θ∈Θ)
is Schwarz minimal sufficient
(respectively, CP minimal sufficient)
if φθ∘Γ=φθ
for all θ∈Θ
implies
Γ=idM
for any Γ∈ChSch(M)
(respectively, for any Γ∈ChCP(M)).
Apparently a Schwarz minimal sufficient statistical experiment
is CP minimal sufficient.
We will prove in Theorem 2 that these minimal sufficiency conditions
are in fact equivalent.
We now state the mean ergodic theorem, Kümmerer and Nagel (1979)
which is the key to the proofs of the following theorems.
Let M be a von Neumann algebra
and let L(M) denote the set of bounded linear operators on
M.
The topology
σ(L(M),M⊗M∗)
is called the σ-weak topology on L(M).
For a subset F⊆L(M),
we denote by co(F) the convex hull of F
and by co(F) the closed convex hull of F
with respect to the σ-weak topology on L(M).
Lemma 1** (Ref. Kümmerer and Nagel, 1979, Theorem 2.4).**
Let M be a von Neumann algebra and
let F be a semigroup of normal Schwarz contractions on M.
Suppose that there exists a faithful family of normal states
P
on M
such that φ∘Γ=φ
for all φ∈P and for all Γ∈F.
Then there exists a normal linear mapping E on M such that
E∈co(F)
and
E∘Γ=Γ∘E=E
for all Γ∈F.
Furthermore, E is a conditional expectation onto
the fixed point von Neumann subalgebra
EM={B∈M}E(B)=B.
Remark 1**.**
While the original statement in Ref. Kümmerer and Nagel, 1979
is for a semigroup of CP contractions,
we can relax this constrains to a semigroup of Schwarz contractions
since the Schwarz property is sufficient for the proof.
Lemma 2**.**
Let E=(M,Θ,(φθ)θ∈Θ) be a statistical experiment.
Then E is CP equivalent to a statistical experiment
E0=(M0,Θ,(φθ(0))θ∈Θ) such that
(φθ(0))θ∈Θ is faithful on M0.
Proof.
Let
P=⋁θ∈Θs(φθ)
be the support of the family (φθ)θ∈Θ
and let M0:=PMP.
We define
φθ(0) by the restriction of φθ to M0.
Then E0=(M0,Θ,(φθ(0))θ∈Θ) is a statistical experiment
and (φθ(0))θ∈Θ is faithful.
Now we show E∼CPE0.
We define channels Λ∈ChCP(M→M0)
and
Γ∈ChCP(M0→M) by
[TABLE]
where ϕ is an arbitrary fixed normal state on M0.
Since we have
φθ(A)=φθ(PAP)
(θ∈Θ,A∈M),
for any A∈M and B∈M0 we obtain
[TABLE]
Therefore E∼CPE0 holds.
∎
Now we are in the position to prove the following theorem,
which is the main result of this paper.
Theorem 1**.**
Let E=(M,Θ,(φθ)θ∈Θ) be a statistical experiment.
- (i)
There exists a Schwarz minimal sufficient statistical experiment E0 CP equivalent to E.
Furthermore if E1 is another
Schwarz minimal sufficient statistical experiment Schwarz equivalent to E,
then E0≅E1 holds.
2. (ii)
There exists a CP minimal sufficient statistical experiment
E0 CP equivalent to E.
Furthermore if E1 is another
CP minimal sufficient statistical experiment CP equivalent to E,
then E0≅E1 holds.
Proof.
We first show the existence part of (i).
According to Lemma 2,
we may assume that (φθ)θ∈Θ is faithful on M.
We define a semigroup of Schwarz channels F by
[TABLE]
Then Lemma 1 implies that
there exists a conditional expectation E∈coF onto
the fixed point von Neumann subalgebra EM=:M0 such that
E∘Γ=Γ∘E=E for all
Γ∈F.
Thus there exists a net
(Γα)⊆coF=F
converging to E in the σ-weak topology.
Then we have
[TABLE]
and therefore E∈F.
Let φθ(0) denote the restriction of φθ to M0
and let E0:=(M0,Θ,(φθ(0))θ∈Θ).
We now show E∼CPE0.
Since the identity idM0 can be regarded as a channel in ChCP(M0→M),
we have E0≼CPE.
On the other hand, from E∈F, we obtain
φθ(A)=φθ∘E(A)=φθ(0)∘E(A)
for all θ∈Θ and for all A∈M.
Since a conditional expectation is CP,
we have E≼CPE0.
Thus we have shown E∼CPE0.
To show the Schwarz minimal sufficiency of E0, we take a channel
Γ∈ChSch(M0) such that
φθ(0)∘Γ=φθ(0)
(θ∈Θ).
Then we have
φθ∘Γ∘E(A)=φθ(0)∘Γ(E(A))=φθ(0)(E(A))=φθ(A)
(A∈M,θ∈Θ).
Thus Γ∘E∈F
and hence Γ∘E=(Γ∘E)∘E=E,
which implies Γ=idM0.
Therefore E0 is Schwarz minimal sufficient.
To show the uniqueness part of (i),
we take another Schwarz minimal sufficient statistical experiment
E1=(M1,Θ,(φθ(1))θ∈Θ)
Schwarz equivalent to E.
Since we have E0∼SchE1,
there exist Schwarz channels
Γ0∈ChSch(M0→M1)
and
Γ1∈ChSch(M1→M0)
such that
φθ(0)=φθ(1)∘Γ0
and
φθ(1)=φθ(0)∘Γ1
for all θ∈Θ.
Then we have
[TABLE]
and the Schwarz minimal sufficiency of E0 and E1 implies that
Γ1∘Γ0=idM0
and
Γ0∘Γ1=idM1,
i.e. Γ0 and Γ1 are bijections with Γ0−1=Γ1.
Now we show that Γ0 is a normal isomorphism from M0 onto M1.
For this it is sufficient to prove
Γ0(A∗A)=Γ0(A∗)Γ0(A)
for all A∈M0.
By using the Schwarz inequality we have
[TABLE]
which implies
Γ1∘Γ0(A∗A)=Γ1(Γ0(A∗)Γ0(A)).
Thus we obtain
Γ0(A∗A)=Γ0(A∗)Γ0(A),
proving E0≅E1.
The existence part of the claim (ii) is immediate from (i)
and the uniqueness part
can be shown in a similar manner as in (i).
∎
Remark 2**.**
The construction of M0 in the proof of Theorem 1
is due to Ref. Łuczak, 2014
(Theorem 1), in which M0 is shown to be
an Umegaki minimal sufficient subalgebra with respect to
(φθ)θ∈Θ.
Under more restrictive conditions on E,
a related result for the uniqueness part of our Theorem 1
is obtained in Ref. Guţă and Jenčová, 2007
(Corollary 3.4)
by using the theory of Connes’ cocycles. Takesaki (2003)
We can now show the equivalence of
the two coarse-graining equivalence relations
as in the following corollary.
Corollary 1**.**
Let E1 and E2 be statistical experiments
with a common parameter set.
Then
E1∼SchE2
if and only if
E1∼CPE2.
Proof.
Assume E1∼SchE2.
Then according to Theorem 1 (i) there exist Schwarz minimal sufficient statistical experiments
E~1 and E~2 satisfying
E1∼CPE~1
and
E2∼CPE~2.
Thus we have
E1~∼SchE2~
and the uniqueness part of Theorem 1 (i)
implies E1~≅E2~.
Therefore we obtain
E1∼CPE~1≅E~2∼CPE2,
which implies E1∼CPE2.
The converse is evident.
∎
The following theorem gives equivalent conditions of the
minimal sufficiency for statistical experiment.
Theorem 2**.**
Let E=(M,Θ,(φθ)θ∈Θ)
be a statistical experiment.
Then the following conditions are equivalent.
- (i)
E* is Schwarz minimal sufficient.*
2. (ii)
E* is CP minimal sufficient.*
3. (iii)
(φθ)θ∈Θ*
is faithful
and M is a Schwarz minimal sufficient subalgebra
with respect to (φθ)θ∈Θ.*
4. (iv)
(φθ)θ∈Θ*
is faithful
and M is a CP minimal sufficient subalgebra
with respect to (φθ)θ∈Θ.*
5. (v)
(φθ)θ∈Θ*
is faithful
and M is an Umegaki minimal sufficient subalgebra
with respect to (φθ)θ∈Θ.*
Proof.
The implications
(i)⟹(ii)
and
(iii)⟹(iv)⟹(v)
are evident from the definitions.
(ii)⟹(i).
Assume that E is CP minimal sufficient.
Then Theorem 1 (i) implies that there exists a Schwarz minimal sufficient
statistical experiment E0 CP equivalent to E.
Since E0 is also CP minimal sufficient, the uniqueness part of
Theorem 1 (ii)
implies E≅E0.
Therefore E is Schwarz minimal sufficient.
(i)⟹(iii).
Assume (i) and let M1 be an arbitrary Schwarz sufficient
subalgebra of M with respect to (φθ)θ∈Θ.
Then there exists a channel
Γ∈ChSch(M→M1)⊆ChSch(M)
such that
φθ∘Γ=φθ
for all θ∈Θ.
Therefore the Schwarz minimal sufficiency of E implies
Γ=idM.
Thus we have M1=M
and M is a Schwarz minimal sufficient subalgebra.
The faithfulness of (φθ)θ∈Θ
follows from the construction of a minimal sufficient statistical
experiment
given in Theorem 1.
(v)⟹(i).
Assume (v).
Then from the proof of Theorem 1
there exists an Umegaki sufficient subalgebra M0 of M
such that
E0=(M0,Θ,(φθ(0))θ∈Θ)
is a Schwarz minimal sufficient statistical experiment
CP equivalent to E,
where φθ(0) is the restriction of φθ to M0.
From the condition (v) we should have M=M0
and therefore E=E0 is Schwarz minimal sufficient.
∎
Thanks to Theorem 2 the Schwarz and CP minimal sufficiency conditions coincide.
From now on we shall call a statistical experiment minimal sufficient
not specifying Schwarz or CP.
For the minimal sufficiency conditions for subalgebra,
we obtain the following theorem.
Theorem 3**.**
Let E=(M,Θ,(φθ)θ∈Θ)
be a statistical experiment,
let
M1 be a von Neumann subalgebra of M,
and let φθ(1) denote the restriction of φθ to
M1.
Suppose that (φθ)θ∈Θ is faithful on M.
Then the following conditions are equivalent.
- (i)
M1* is a Schwarz minimal sufficient subalgebra with respect to (φθ)θ∈Θ.*
2. (ii)
M1* is a CP minimal sufficient subalgebra with respect to (φθ)θ∈Θ.*
3. (iii)
M1* is an Umegaki minimal sufficient subalgebra with respect to (φθ)θ∈Θ.*
4. (iv)
M1* is a Schwarz sufficient subalgebra with respect to (φθ)θ∈Θ
and the statistical experiment
E1=(M1,Θ,(φθ(1))θ∈Θ) is minimal sufficient.*
5. (v)
M1* is a CP sufficient subalgebra with respect to (φθ)θ∈Θ
and the statistical experiment
E1=(M1,Θ,(φθ(1))θ∈Θ) is minimal sufficient.*
6. (vi)
M1* is an Umegaki sufficient subalgebra with respect to (φθ)θ∈Θ
and the statistical experiment
E1=(M1,Θ,(φθ(1))θ∈Θ) is minimal sufficient.*
Proof.
Let
F,
M0⊆M,
φθ(0),
and E
be the same as in the proof of Theorem 1,
in which we have shown that
M0 is an Umegaki sufficient subalgebra of M with respect to
(φθ)θ∈Θ
and that
E0=(M0,Θ,(φθ(0))θ∈Θ)
is a Schwarz minimal sufficient statistical experiment.
First we prove that M0 is a minimal sufficient subalgebra
with respect to (φθ)θ∈Θ
in the sense of Schwarz, CP, and Umegaki.
Let M2 be a Schwarz sufficient subalgebra of M
with respect to (φθ)θ∈Θ
and let Γ∈ChSch(M→M2)⊆ChSch(M) be a channel
satisfying
φθ∘Γ=φθ
for all θ∈Θ.
Then we have Γ∈F and hence
Γ∘E=E.
From this we obtain M0⊆M2
and therefore M0 is a Schwarz minimal sufficient subalgebra.
Since M0 is an Umegaki sufficient subalgebra,
this shows that M0 is also minimal sufficient in the sense
of CP and Umegaki.
(i)⟹(vi).
Assume (i).
Since M0 and M1 are both Schwarz minimal sufficient,
we have M1=M0.
Therefore
M1=M0
is an Umegaki sufficient subalgebra and
E1=(M1,Θ,(φθ(1))θ∈Θ)=(M0,Θ,(φθ(0))θ∈Θ)
is a minimal sufficient statistical experiment.
Similar proofs apply to the implications
(ii)⟹(vi)
and
(iii)⟹(vi).
The implications (vi)⟹(v)⟹(iv)
are immediate from (3).
(iv)⟹(i), (ii), and (iii).
Assume (iv).
Since M0 is minimal sufficient in the sense of Schwarz and Umegaki
with respect to (φθ)θ∈Θ,
M0 is an Umegaki sufficient subalgebra of M1
with respect to (φθ(1))θ∈Θ.
Then from the assumption (iv) and Theorem 2 (v)
we obtain
M1=M0.
Thus M1=M0 is a minimal sufficient subalgebra
in the sense of Schwarz, CP, and Umegaki.
∎
Now we consider finite dimensional case, which reduces to
the decomposition theorem by Koashi and Imoto. Koashi and Imoto (2002)
Example 1**.**
Let E=(L(H),Θ,(ρθ)θ∈Θ) be a statistical experiment
with H finite dimensional.
As mentioned in Sec. II,
we regard ρθ as a density operator on H.
For simplicity, we assume that (ρθ)θ∈Θ is faithful on L(H).
Let M0 be the minimal sufficient subalgebra
of L(H)
with respect to (ρθ)θ∈Θ
and let E be the conditional expectation from L(H)
onto M0 satisfying E∗(ρθ)=ρθ
for all θ∈Θ.
As shown in Ref. Hayden et al., 2004 (Appendix A),
H, M0, E, and ρθ
are decomposed as follows:
[TABLE]
where Hα and Kα are Hilbert spaces,
Pα is the orthogonal projection onto
Hα⊗Kα,
ωα∈S(Kα),
trKα[⋅] denotes the partial trace over Kα,
qα,θ is a discrete probability distribution over α,
and ρα,θ∈S(Hα).
This decomposition further satisfies the following:
for any Γ∈ChCP(L(H))
satisfying
Γ∗(ρθ)=ρθ
for all θ∈Θ,
Γ∣L(Hα⊗Kα)=idL(Hα)⊗Γα
for all α
where Γα∈ChCP(L(Kα)) is a channel
satisfying
Γα∗(ωα)=ωα.
The existence of such decomposition of
H and ρ satisfying this condition
is first proved by Koashi and Imoto. Koashi and Imoto (2002)
Later another operator algebraic proof analogous to ours
is obtained in Ref. Hayden et al., 2004,
in which,
due to the finite dimensionality,
the conditional expectation E
is constructed by using a weaker version of
mean ergodic theorem (Lemma 11).
In this sense, our results in this section can be considered as
a generalization of
the Koashi-Imoto decomposition in more general operator algebraic settings.
III.2 Minimal sufficient channel
Now we apply the general theory developed in
Subsection III.1
to the concatenation relation for CP channels.
Definition 3**.**
Let M1, M2 and Min be von Neumann algebras
and let
Λ1∈ChCP(M1→Min)
and
Λ2∈ChCP(M2→Min)
be CP channels with the common input space Min.
-
Λ1 is a concatenation,
or coarse-graining,
of Λ2,
written Λ1≼CPΛ2,
if there exists a channel Γ∈ChCP(M1→M2)
such that Λ1=Λ2∘Γ.
2. 2.
Λ1 and Λ2 are said to be concatenation equivalent,
written
Λ1∼CPΛ2,
if both
Λ1≼CPΛ2
and
Λ2≼CPΛ1
hold.
3. 3.
Λ1 and Λ2 are said to be isomorphic,
written
Λ1≅Λ2,
if there exists a normal isomorphism
π from M1 onto M2 such that
Λ1=Λ2∘π.
Definition 4**.**
Let M and Min be von Neumann algebras.
Then a channel Λ∈ChCP(M→Min) is called
minimal sufficient
if
Λ∘Γ=Λ
implies
Γ=idM
for any Γ∈ChCP(M).
For each channel Λ∈ChCP(M→Min),
we define by
[TABLE]
the statistical experiment associated with Λ.
The concepts in Definitions 3 and 4
can be rephrased in terms of the associated statistical experiments
as follows.
Proposition 1**.**
Let M1, M2 and Min be von Neumann algebras
and
let
Λ1∈ChCP(M1→Min)
and
Λ2∈ChCP(M2→Min)
be channels.
Then we have the following.
- (i)
Λ1≼CPΛ2* if and only if
EΛ1≼CPEΛ2.*
2. (ii)
Λ1∼CPΛ2* if and only if
EΛ1∼CPEΛ2.*
3. (iii)
Λ1≅Λ2*
if and only if
EΛ1≅EΛ2.*
4. (iv)
Λ1* is minimal sufficient if and only if EΛ1 is minimal sufficient.*
Applications of Theorem 1 and
Corollary 1 to CP channels
immediately give the following corollaries.
Corollary 2**.**
Let M and Min be von Neumann algebras
and let
Λ∈ChCP(M→Min) be a channel.
Then there exists a minimal sufficient CP channel Λ0
concatenation equivalent to Λ.
Furthermore such Λ0 is unique up to isomorphism.
Corollary 3**.**
Let M1, M2 and Min be von Neumann algebras
and
let
Λ1∈ChCP(M1→Min)
and
Λ2∈ChCP(M2→Min)
be CP channels.
Then
Λ1∼CPΛ2
if and only if
there exist Schwarz channels
Γ1∈ChSch(M1→M2)
and
Γ2∈ChSch(M2→M1)
such that
Λ1=Λ2∘Γ1
and
Λ2=Λ1∘Γ2.
IV Minimal sufficient POVM
In this section we consider minimal sufficiency conditions
for POVMs on a given input von Neumann algebra
Min
and relate the results of this paper to the one obtained in
Ref. Kuramochi, 2015; *10.1063/1.4961516.
Throughout this section we assume that
the input von Neumann algebra Min is
σ-finite, or more strongly
that Min has separable predual.
A von Neumann algebra is σ-finite if and only if
it admits a faithful normal state φ0.
Throughout this section φ0 denotes a fixed faithful normal state on Min.
IV.1 POVMs as QC channels
A POVM on Min is a triple
(Ω,Σ,M)
such that (Ω,Σ) is a measurable space
and
M:Σ→Min
is a mapping satisfying
- (i)
M(E)≥0
(∀E∈Σ);
2. (ii)
M(Ω)=\mathbbm1Min;
3. (iii)
for any disjoint sequence {En}⊆Σ,
M(∪nEn)=∑nM(En),
where the RHS is convergent in the weak operator topology.
For each normal state φ∈S(Min)
we define the outcome probability measure PφM on (Ω,Σ)
by
PφM(E):=⟨φ,M(E)⟩
(E∈Σ).
Now we will see that a POVM can be regarded as a
QC channel Holevo (2012)
in the following sense.
For faithful φ0∈S(Min),
we define a normal and unital mapping
ΓM:L∞(Pφ0M)→Min
by
[TABLE]
Here [f]Pφ0M
is written as [f]M since
the notions of Pφ0M-a.e. and
M-a.e. equalities coincide.
The outcome space L∞(Pφ0M) is independent
of the choice of faithful
φ0.
The predual of ΓM is the mapping
Γ∗M:Min∗→L1(Pφ0M)
such that
[TABLE]
which can be identified with the outcome probability measure PφM.
Since Γ∗M is positive,
we have
ΓM∈ChCP(L∞(Pφ0M)→Min).
ΓM is called the QC channel
of M.
Let
(Ω1,Σ1,M) and (Ω2,Σ2,N)
be POVMs on a σ-finite von Neumann algebra Min.
An M-N weak Markov kernel Dorofeev and de Graaf (1997); Jenčová, Pulmannová, and Vinceková (2008) is a mapping
κ(⋅∣⋅):Σ1×Ω2→[0,1]
such that
- (i)
κ(E∣⋅)
is Σ2-measurable for each E∈Σ1;
2. (ii)
κ(Ω1∣ω2)=1,
N(ω2)-a.e.;
3. (iii)
for every disjoint sequence {En}⊆Σ1,
κ(∪nEn∣ω2)=∑nκ(En∣ω2),
N(ω2)-a.e.;
4. (iv)
for any M-null set N∈Σ1,
κ(N∣ω2)=0,
N(ω2)-a.e.
For a pair of measures μ and ν,
μ-ν weak Markov kernel is defined similarly.
A weak Markov kernel κ(⋅∣⋅) is called a regular Markov kernel if
κ(⋅∣ω2)
is a probability measure for each ω2∈Ω2.
If (Ω1,Σ1) is a standard Borel space Kechris (1995),
for every M-N weak Markov kernel κ(⋅∣⋅)
there exists a regular Markov kernel
κ~(⋅∣⋅) such that
κ(E∣ω2)=κ~(E∣ω2),
N(ω2)-a.e. for each
E∈Σ1.
M is a postprocessing of N,
written M⪯N,
if
there exists an M-N weak Markov kernel κ(⋅∣⋅)
such that
[TABLE]
M and N are said to be postprocessing equivalent,
written M≃N,
if both M⪯N and N⪯M hold.
The relations ⪯ and ≃ are
preorder and equivalence relations of POVMs on Min,
respectively.
Remark 3**.**
In the definition of the weak Markov kernel applied in Refs. Dorofeev and de Graaf, 1997; Jenčová, Pulmannová, and Vinceková, 2008,
the condition (iv) is not required.
Still the condition (iv)
makes no difference in the definitions of the postprocessing relations ⪯ and ≃
since (iv) follows from (i)-(iii) and (5).
We denote by χE the indicator function of a set E.
Lemma 3**.**
Let (Ω1,Σ1,μ)
and (Ω2,Σ2,ν)
be localizable measure spaces.
Then for every channel Γ∈ChCP(L∞(μ)→L∞(ν))
there exists a μ-ν weak Markov kernel
κ(⋅∣⋅):Σ1×Ω2→[0,1]
such that
[TABLE]
Conversely,
for each μ-ν weak Markov kernel κ(⋅∣⋅)
there exists a unique channel
Γ∈ChCP(L∞(μ)→L∞(ν))
satisfying (6).
Proof.
From the definition of the channel,
it is immediate that
the condition (6) uniquely determines
a μ-ν weak Markov kernel κ(⋅∣⋅)
up to ν-a.e. equality.
To show the converse, we take
an arbitrary μ-ν weak Markov kernel
κ(⋅∣⋅).
For each [f]ν∈L1(ν),
we define a complex measure
κ∗f on (Ω1,Σ1)
by
[TABLE]
which is absolutely continuous with respect to μ
from the definition of the weak Markov kernel.
Therefore we may define a positive linear map
Γ∗:L1(ν)→L1(μ) by
[TABLE]
(Note that a measure is localizable if and only if the Radon-Nikodym theorem
is valid for the measure Segal (1951)).
Let Γ:L∞(μ)→L∞(ν)
be the dual map of Γ∗,
which is positive, therefore completely positive, and normal linear map.
Then for any [f]ν∈L1(ν) and E∈Σ1 we have
[TABLE]
which implies the condition (6).
Thus Γ is unital and therefore
Γ∈ChCP(L∞(μ)→L∞(ν)).
To establish the uniqueness, we take another channel
Λ∈ChCP(L∞(μ)→L∞(ν))
satisfying
Λ([χE]μ)=[κ(E∣⋅)]ν
(E∈Σ1).
Then we have
Γ([χE]μ)=Λ([χE]μ)
for each E∈Σ1.
By taking a uniformly bounded μ-a.e. convergent sequence of simple functions,
we can show
Γ([f]μ)=Λ([f]μ)
for each [f]μ∈L∞(μ),
proving Γ=Λ.
∎
The postprocessing relation of POVMs can be rephrased
in terms of the concatenation relation for the corresponding
QC channels as follows.
Proposition 2**.**
Let Min be a σ-finite von Neumann algebra
and let
(Ω1,Σ1,M) and (Ω2,Σ2,N)
be POVMs on Min.
Then the following conditions are equivalent.
- (i)
ΓM≼CPΓN.**
2. (ii)
M⪯N.**
Proof.
Assume ΓM≼CPΓN.
Then there exists a channel
Γ∈ChCP(L∞(Pφ0M)→L∞(Pφ0N))
such that ΓM=ΓN∘Γ.
From Lemma 3 there exists an M-N weak Markov kernel
κ(⋅∣⋅) such that
Γ([χE]M)=[κ(E∣⋅)]N.
Then for each E∈Σ1 we have
[TABLE]
which implies M⪯N.
Conversely, if we assume M⪯N,
then there exists an M-N weak Markov kernel κ(⋅∣⋅)
satisfying (5).
Then Lemma 3 implies that there exists a channel
Γ∈ChCP(L∞(Pφ0M)→L∞(Pφ0N))
satisfying
Γ([χE]M)=[κ(E∣⋅)]N
(E∈Σ1).
Thus for each E∈Σ1 it holds that
[TABLE]
By taking a uniformly bounded M-a.e. convergent sequence of simple functions,
this implies that
ΓM([f]M)=ΓN∘Γ([f]M)
for every [f]M∈L∞(Pφ0M).
Thus we obtain ΓM≼CPΓN.
∎
Corollary 4**.**
Let Min,
(Ω1,Σ1,M) and (Ω2,Σ2,N)
be the same as in Proposition 2.
Then the following conditions are equivalent.
- (i)
ΓM∼CPΓN.**
2. (ii)
M≃N.**
The above discussion shows that any POVM
can be regarded as a channel with an abelian
outcome space.
Conversely we have the following.
Proposition 3**.**
Let Min be a σ-finite von Neumann algebra
and let M be an abelian von Neumann algebra.
Then for any channel Γ∈ChCP(M→Min)
there exists a POVM M on Min such that
ΓM∼CPΓ.
If we further assume that
Γ∗(S(Min))
is faithful on M,
then M can be taken such that
ΓM≅Γ.
Proof.
Since M is abelian,
we may identify M with L∞(μ) for some localizable measure space
(Ω,Σ,μ)
(Ref. Sakai, 1971, Sec. 1.18).
We define a POVM (Ω,Σ,M)
by
M(E):=Γ([χE]μ)
(E∈Σ).
Now we show ΓM∼CPΓ.
Since Pφ0M is absolutely continuous with respect to μ,
the mapping
[TABLE]
is a well-defined normal homomorphism.
Since we have
Γ([χE]μ)=M(E)=ΓM∘π([χE]μ)
for any E∈Σ,
by taking a uniformly bounded μ-a.e. convergent sequence of simple functions,
we obtain Γ([f]μ)=ΓM∘π([f]μ)
for any [f]μ∈L∞(μ).
Thus we have shown Γ≼CPΓM.
To show
ΓM≼CPΓ,
we define
g0:=dPφ0M/dμ and
Ω0:={ω∈Ω}g0(ω)>0.
For each [g]μ∈L1(μ) we have
[TABLE]
where ∣∣⋅∣∣L1(μ) denotes the L1-norm on L1(μ).
Thus the mapping
[TABLE]
is well-defined and positive.
For any [f]M∈L∞(Pφ0M)
and [g]μ∈L1(μ) we have
[TABLE]
which implies that dual map Λ0 of Λ0∗ is given by
Λ0([f]M)=[fχΩ0]μ
([f]M∈L∞(Pφ0M)).
Now we define a channel Λ∈ChCP(L∞(Pφ0M)→L∞(μ))
by
[TABLE]
where [h0]M∈L1(Pφ0M) is a fixed normal state
on L∞(Pφ0M).
Then for each E∈Σ
we have
[TABLE]
where the second equality follows from that Ω∖Ω0
is an M-null set.
From this we obtain
Γ∘Λ=ΓM,
proving
ΓM∼CPΓ.
Now we assume that Γ∗(S(Min)) is faithful
on M.
Then Γ∗(φ0) is faithful and therefore
μ and Pφ0M are mutually absolutely continuous.
Thus π given by (7) is an isomorphism between the outcome spaces
of Γ and ΓM.
Hence we have ΓM≅Γ.
∎
IV.2 Minimal sufficiency
Now we introduce two minimal sufficiency conditions
for POVM as follows.
Definition 5**.**
Let Min be a σ-finite von Neumann algebra and let
(Ω,Σ,M) be a POVM on Min.
- (i)
M is kernel minimal sufficient if for any
M-M weak Markov kernel κ(⋅∣⋅),
[TABLE]
implies κ(E∣ω)=χE(ω),
M(ω)-a.e. for every E∈Σ.
2. (ii)
M is relabeling minimal sufficient if
for any POVM (Ω1,Σ1,N) postprocessing equivalent to M
there exists a Σ1/Σ-measurable mapping
f:Ω1→Ω such that
the POVM (Ω,Σ,Nf) defined by
Nf(E):=N(f−1(E))
(E∈Σ)
coincides with
(Ω,Σ,M).
The relabeling minimal sufficiency is introduced in Ref. Kuramochi, 2015; *10.1063/1.4961516
in which the corresponding POVM is called just “minimal sufficient”.
We will see in Theorem 4 that
these minimal sufficiency conditions for POVM coincide
under the assumptions of the standard Borel outcome space
and of the separability of the predual Min∗.
A POVM (Ω,Σ,M) on a σ-finite
von Neumann algebra Min is called complete,
or injective, Dorofeev and de Graaf (1997)
if
[TABLE]
implies f=0, M-a.e. for any bounded and measurable f.
A POVM
(Ω,Σ,M) is called a projection-valued measure (PVM)
if M(E) is a projection for each E∈Σ.
It is immediate from the definition that any complete POVM is kernel minimal sufficient,
and it is also known Dorofeev and de Graaf (1997) that any PVM
is complete.
Therefore we have
Proposition 4**.**
Let (Ω,Σ,M) be a PVM on a
σ-finite von Neumann algebra Min.
Then M is kernel minimal sufficient.
Now we assume that the predual Min∗ of the input von Neumann algebra Min
is separable with respect to the norm topology.
Then there exists a countable family of normal states
(φn)n≥1⊆S(Min)
dense in S(Min).
Following Ref. Kuramochi, 2015; *10.1063/1.4961516,
for each POVM (Ω,Σ,M) on Min
we define the following Σ/B(R∞)-measurable mapping
[TABLE]
where (R∞,B(R∞)) is the countable product space of the real line
(R,B(R))
equipped with the Borel σ-algebra
B(R).
Note that while the mapping T depends on the choices of
the Radon-Nikodym derivatives,
the POVM (R∞,B(R∞),MT)
defined by
MT(E)=M(T−1(E))
(E∈B(R∞))
does not.
The following two lemmas can be shown similarly as in
Ref. Kuramochi, 2015; *10.1063/1.4961516.
Lemma 4**.**
Let Min be a σ-finite von Neumann algebra,
let (Ω,Σ,M) be a POVM on Min,
and let f:Ω→Ω1 be a measurable mapping
between the measurable spaces
(Ω,Σ) and (Ω1,Σ1).
Define a POVM (Ω1,Σ1,Mf)
by Mf(E):=M(f−1(E))
(E∈Σ1).
Then the following conditions are equivalent.
- (i)
M≃Mf.**
2. (ii)
dPφ0MdPφM(ω)=dPφ0MfdPφMf(f(ω)),*
M(ω)-a.e. for all φ∈S(Min).
*
Lemma 5**.**
Let Min be a von Neumann algebra with separable predual,
let (φn)n≥1⊆S(Min) be dense in S(Min),
let (Ω,Σ,M) be a POVM on Min,
and let T be the mapping defined by (9).
Then the POVM (R∞,B(R∞),MT) induced by T satisfies the following conditions.
- (i)
MT≃M.**
2. (ii)
(dPφ0MTdPφnMT(t))n≥1=t,*
MT(t)-a.e.*
3. (iii)
MT* is relabeling minimal sufficient.*
The following theorem establishes the relationship between
the two minimal sufficiency conditions for a POVM in Definition 5
and that for the corresponding QC channel.
Theorem 4**.**
Let Min be a σ-finite von Neumann algebra
and let (Ω,Σ,M) be a POVM on Min.
Then the following conditions are equivalent.
- (i)
M* is kernel minimal sufficient.*
2. (ii)
ΓM* is minimal sufficient.*
If we further assume that Min∗ is separable
and (Ω,Σ) is standard Borel,
then the conditions (i) and (ii) are equivalent to
- (iii)
M* is relabeling minimal sufficient.*
Proof.
(i)⟹(ii).
Assume (i).
We take arbitrary Γ∈ChCP(L∞(Pφ0M))
such that ΓM∘Γ=ΓM.
Then Lemma 3 implies that there exists a Pφ0M-Pφ0M
weak Markov kernel κ(⋅∣⋅) such that
[κ(E∣⋅)]M=Γ([χE]M)
for each E∈Σ.
Then we have
[TABLE]
for every E∈Σ.
Thus the kernel minimal sufficiency of M implies
that
Γ([χE]M)=[κ(E∣⋅)]M=[χE]M
for every E∈Σ,
and hence we obtain
Γ=idL∞(Pφ0M).
Therefore ΓM is minimal sufficient.
(ii)⟹(i).
Assume (ii).
We take an arbitrary M-M
weak Markov kernel κ(⋅∣⋅) satisfying (8).
Since κ(⋅∣⋅) is also a
Pφ0M-Pφ0M
weak Markov kernel,
Lemma 3 assures that
there exists a channel
Γ∈ChCP(L∞(Pφ0M))
such that Γ([χE]M)=[κ(E∣⋅)]M
for every E∈Σ.
Then the condition (8)
implies
ΓM∘Γ([χE]M)=ΓM([χE]M)
for all E∈Σ,
and hence we have
ΓM∘Γ=ΓM.
Thus the minimal sufficiency of ΓM implies
Γ=idL∞(Pφ0M)
and therefore we have κ(E∣ω)=χE(ω),
M(ω)-a.e. for
every E∈Σ,
which proves the kernel minimal sufficiency of M.
Now we assume that Min∗ is separable and
(Ω,Σ) is standard Borel.
Let (φn)n≥1, T, and MT be the same as in Lemma 5.
(i)⟹(iii).
Assume (i).
Then Lemma 5 (i) and the standard Borel property
of (Ω,Σ) imply that there exists
an M-MT regular Markov kernel κ(⋅∣⋅)
such that
[TABLE]
holds for each E∈Σ.
Therefore the assumption (i) implies
κ(E∣T(ω))=χE(ω),
M(ω)-a.e. for each E∈Σ.
Since (Ω,Σ) is standard Borel,
there exists a countable family {En}n≥1⊆Σ
that separates all the points of Ω.
Thus there exists an M-null set N∈Σ
such that
[TABLE]
Now suppose that ω,ω′∈Ω∖N
and
T(ω)=T(ω′).
Then (10) implies that
χEn(ω)=χEn(ω′)
for all n≥1,
and therefore ω=ω′.
Thus T is injective on Ω∖N.
Since an image of an injective measurable mapping between
standard Borel spaces is measurable,
the restriction T∣Ω∖N
of T to Ω∖N
is a Borel isomorphism between standard Borel spaces
(Ω∖N,Σ∩(Ω∖N))
and
(Ω~,B(R∞)∩Ω~),
where we have defined Ω~:=T(Ω∖N),
[TABLE]
and
[TABLE]
Thus if we define S:R∞→Ω
by
[TABLE]
where ω0∈Ω is arbitrary,
then S is B(R∞)/Σ-measurable and (MT)S=M.
Since MT is a relabeling minimal sufficient POVM postprocessing equivalent to M,
this shows that M is also relabeling minimal sufficient.
(iii)⟹(i).
Assume (iii).
According to the uniqueness theorem for the relabeling minimal sufficient
POVM
(Ref. Kuramochi, 2015; *10.1063/1.4961516, Theorem 5, see also the erratum),
(Ω,Σ,M) and
(R∞,B(R∞),MT) are almost isomorphic,
i.e. there exist M-null set N1∈Σ,
MT-null set N2∈B(R∞),
and a Borel isomorphism h from
(Ω∖N1,Σ∩(Ω∖N1))
to
(R∞∖N2,B(R∞)∩(R∞∖N2))
such that MT(E)=M(h−1(E))
for all E∈B(R∞)∩(R∞∖N2).
This almost isomorphism induces an isomorphism between the corresponding QC channels
ΓM and ΓMT,
indicating ΓM≅ΓMT.
Thus it is sufficient to show that MT is kernel minimal sufficient.
Suppose that κ(⋅∣⋅) is an MT-MT weak Markov kernel
satisfying
[TABLE]
for all E∈B(R∞).
Since (R∞,B(R∞)) is standard Borel,
there exists a regular Markov kernel κ~(⋅∣⋅)
such that
κ(E∣t2)=κ~(E∣t2),
MT(t2)-a.e. for all E∈B(R∞).
Then we define a POVM
N on the direct product space
(R∞×R∞,B(R∞)⊗B(R∞))
by
[TABLE]
where E∣t2:={t1∈R∞}(t1,t2)∈E.
From the definition of N, we have N⪯MT.
If we define canonical projections
[TABLE]
then the POVMs induced by these maps and N are given by
[TABLE]
indicating N⪯MT=Nf=Ng⪯N.
Thus from Lemmas 4 and 5 we obtain
[TABLE]
Therefore if we put N~:={(t1,t2)∈R∞×R∞}t1=t2,
then we have
[TABLE]
which implies κ~(R∞∖{t}∣t)=0,
MT(t)-a.e.
Thus there exists an MT-null set N∈B(R∞) such that
κ~(⋅∣t) is concentrated on {t} for all t∈R∞∖N.
Hence we have
[TABLE]
for all E∈B(R∞),
proving the kernel minimal sufficiency of MT.
∎
If we do not assume
in Theorem 4
the standard Borel property of the outcome space,
the equivalence (i) or (ii)⟺(iii)
does not hold according to the following example,
which is the one considered in the appendix of Ref. Kuramochi, 2015; *10.1063/1.4961516.
Example 2**.**
Let μ be the Lebesgue measure defined on the Borel
σ-algebra
B([0,1]) of the unit interval [0,1]
and let Min be the set
L(L2(μ))
of bounded operators on the Hilbert space L2(μ).
We define a PVM ([0,1],B([0,1]),M) on Min by
[TABLE]
and ([0,1],Bˉ([0,1]),Mˉ)
by Mˉ(F):=M(E)
(E∈B([0,1]),F∈Bˉ([0,1]), E△F is μ-null),
where Bˉ([0,1]) is the family of Lebesgue measurable sets on [0,1]
and E△F:=(E∖F)∪(F∖E) is the symmetric difference.
Then Proposition 4 implies that M and Mˉ are both
kernel minimal sufficient and Lemma 3 of
Ref. Kuramochi, 2015; *10.1063/1.4961516
implies M≃Mˉ.
Now we show that Mˉ is not relabeling minimal sufficient.
Suppose that Mˉ is relabeling minimal sufficient.
Then there should exist a B([0,1])/Bˉ([0,1])-measurable mapping
f:[0,1]→[0,1] such that Mf=Mˉ.
If we put κ(E∣x):=χE(f(x))
(E∈Bˉ([0,1]),x∈[0,1]),
then κ(⋅∣⋅)
is a regular Markov kernel satisfying
[TABLE]
which contradicts the appendix of Ref. Kuramochi, 2015; *10.1063/1.4961516
in which it is proven that there is no regular Markov kernel
satisfying (11).
Therefore Mˉ is not relabeling minimal sufficient.
IV.3 Characterization of discreteness
A POVM (Ω,Σ,M) on a σ-finite
von Neumann algebra Min is called discrete if
Σ is the power set 2Ω of Ω.
For such M,
the outcome space of ΓM
coincides with ℓ∞(Ω0),
where Ω0:={ω∈Ω}M({ω})=0
and ℓ∞(Ω0) denotes the set of bounded complex functions on Ω0.
A non-zero projection P on a von Neumann algebra M is called
atomic if there is no non-zero projection on M strictly smaller than P.
An abelian von Neumann algebra M is called
totally atomic if
M is isomorphic to ℓ∞(Ω)
for some set Ω.
An abelian von Neumann algebra M is totally atomic if and only if
there exists a family of mutually orthogonal atomic projections
(Pω)ω∈Ω on M such that
∑ω∈ΩPω=\mathbbm1M.
If we have such atomic projections
(Pω)ω∈Ω,
then the mapping
[TABLE]
is an isomorphism from ℓ∞(Ω)
onto M.
The following lemma is immediate from Ref. Størmer, 1972.
Lemma 6**.**
Let H be a separable Hilbert space and let
M be an abelian von Neumann subalgebra of L(H).
Then M is totally atomic if and only if there exists a faithful
conditional expectation
from L(H) onto M.
Now we can show the following theorem which characterizes the discreteness of a POVM
up to postprocessing equivalence.
Theorem 5**.**
Let (Ω,Σ,M) be a POVM
on a σ-finite von Neumann algebra Min.
Then the following conditions are equivalent.
- (i)
M* is postprocessing equivalent to a discrete POVM.*
2. (ii)
ΓM* is concatenation equivalent to a channel with a fully quantum outcome space.*
Proof.
Assume (i).
Then there exists a discrete POVM
(Ω1,2Ω1,M1)
postprocessing equivalent to M.
We can take M1 such that
M1({ω1})=0
for all ω1∈Ω1.
Then Corollary 4 implies
ΓM∼CPΓM1.
Here, ΓM1 is the mapping
ΓM1:ℓ∞(Ω1)→Min given by
[TABLE]
We define a Hilbert space
ℓ2(Ω1):={f:Ω→C}∑ω1∈Ω1∣f(ω1)∣2<∞,
and a conditional expectation from
L(ℓ2(Ω1)) onto
ℓ∞(Ω1)
by
[TABLE]
where ⟨⋅⟩⋅ is the inner product on ℓ2(Ω1)
defined by
[TABLE]
∣f⟩⟨g∣
(f,g∈ℓ2(Ω1)) is the von Neumann-Schatten product
defined by ∣f⟩⟨g∣h=⟨g⟩hf
(h∈ℓ2(Ω1)),
and
[TABLE]
Here we identify ℓ∞(Ω1) with
{∑ω1∈Ω1f(ω1)∣δω1⟩⟨δω1∣}f∈ℓ∞(Ω1).
We also define a channel Γ∈ChCP(L(ℓ2(Ω1))→Min)
by
[TABLE]
Then we have
Γ=ΓM1∘E
and
ΓM1=Γ∣ℓ∞(Ω1).
Therefore we obtain ΓM∼CPΓM1∼CPΓ,
proving the condition (ii).
Assume (ii).
Then there exist a Hilbert space K and a channel
Γ∈ChCP(L(K)→Min) satisfying
ΓM∼CPΓ.
Since Γ is concatenation equivalent to
Γ∣L(P0K)∈ChCP(L(P0K)→Min),
where P0 is the support of Γ∗(φ0),
we may assume that Γ∗(φ0) is faithful and therefore
that K is separable.
Then from the proof of Theorem 1,
there exist an Umegaki minimal sufficient subalgebra
M0 of L(K)
with respect to (Γ∗(φ))φ∈S(Min)
and
a conditional expectation E from L(K) onto M0
satisfying
Γ∘E=Γ.
Since
Γ∗(φ0)=φ0∘Γ=φ0∘Γ∘E
is faithful on L(K),
E is a faithful conditional expectation.
Moreover,
M0 is abelian
because, from the uniqueness of the minimal sufficient channel,
M0 is isomorphic to a von Neumann subalgebra
of L∞(Pφ0M),
the outcome space of ΓM.
Therefore Lemma 6 implies that
M0 is totally atomic.
Thus the restriction Γ∣M0∈ChCP(M0→Min)
is isomorphic to ΓM0 for a discrete POVM M0 on Min.
Since Γ∣M0
is concatenation equivalent to Γ and ΓM,
the condition (i) follows from Corollary 4.
∎
Remark 4**.**
In Ref. Holevo, 2012 Holevo points out that
the nonexistence of the continuous analog of the fully quantum channel (12)
is related to the nonexistence of a normal conditional expectation
from a fully quantum space onto its continuous abelian subalgebra,
which is our Lemma 6.
Thus our Theorem 5, together with its proof,
explicitly elucidates this relation.
Remark 5**.**
The reason why Theorem 5
is for the characterization of the discreteness of the postprocessing equivalence class of a POVM M,
not of the POVM M itself,
is that
any discrete POVM is always postprocessing equivalent to a continuous POVM on the real line,
which can be shown as follows.
Let M be a discrete POVM on Min.
Without loss of generality we may assume that the outcome space of M
is (N,2N), where N denotes the set of natural numbers.
We define a mapping κ(⋅∣⋅):B(R)×N→[0,1]
by
[TABLE]
where μ is the Lebesgue measure on (R,B(R)).
We define a POVM (R,B(R),N) by
[TABLE]
By definition we have N⪯M.
On the other hand,
[TABLE]
which implies M⪯N.
Therefore we obtain M≃N.
Furthermore, N is continuous in the sense that
N({x})=0 for all x∈R.
Thus we have shown that M is postprocessing equivalent to a continuous POVM N
on the real line.
Acknowledgements.
The author would like to thank
Takayuki Miyadera (Kyoto University)
for helpful discussions and comments.
He also would like to thank Erkka Haapasalo (Kyoto University)
for valuable comments on the first version of this paper.