9.2 Quantum channel capacities 149
AsnotedinSection2.6,theK
i
are generally not unique. In particu-
lar, any pair of decompositions {K
i
} and {
¯
K
j
},ofr and s elements
respectively, for the same operation are related as
K
i
=
s
j=1
f
ij
¯
K
j
, (9.3)
where [f
ij
] is the matrix representing a maximal partial isometry
between the vector spaces H
(r)
and H
(s)
.Apartial isometry is an
operation more general than a unitary transformation, such that
VV
†
= P where P is a projector. In the event that r = s, V is
nonunitary; a maximal partialisometryisaV for which either VV
†
or V
†
V is the identity. The freedom of choice of decomposition can
be viewed in this context as the freedom of choice of the basis for
the environment of the channel [27].
If a quantum channel is noiseless and distortion-free, then it is described
by the identity operator I and fully preserves the quantum coherence of the
input state. At the other extreme, the completely decohering channel destroys
all off-diagonal elements of the statistical operators input to it, so that ρ →
ρ
=
ρ
ii
P (|ψ
i
).
4
The completely decohering channel can transmit classical
information perfectly, but will destroy the coherence properties essential for
transmitting genuinely quantum information.
5
Interestingly, the ratio of the
entanglement-assisted classical capacity to the unassisted classical capacity
generally increases with the amount of noise in the quantum channel, even
when the quantum capacities go to zero. Let us now precisely define a number
of quantum channel capacities and further consider the relationship between
various pairs of them.
9.2 Quantum channel capacities
An information source for a quantum channel provides an ensemble of quan-
tum states; a given state that a quantum source is capable of producing can
be broadcast over a quantum channel using a number of copies of the state. In
the case of two parties sharing such a channel, subsystems of a larger quantum
system can also be prepared in an entangled joint state ρ
AB
, shared by sender
Alice and receiver Bob, the partial trace of which over either subsystem, A or
B, is described by ρ
I
, I = A, B.
6
These two situations reflect the situations
in quantum key distribution using the BB84 and E91 protocols, respectively.
4
This expression corresponds to a transition between states given in Eqs. 11.48–49.
5
Specific examples of quantum channels are given below in Sect. 9.6.
6
Note, however, the existence of constraints on broadcasting, such as the “no-
broadcasting” theorem, described in Sect. 11.1.