Use the unnormalized Choi matrix
It is positive because is a completely positive map. Take its spectral decomposition, absorbing square roots of nonzero eigenvalues into the vectors:
Expand and define the Kraus operator by . Equivalently,
The preceding relative state identity then gives . Inserting the spectral decomposition into the stated reconstruction identity yields
The conjugated index vector is required here; it is present in the PDF but missing in the converted TeX version of this identity.
Rank-one projectors span all operators by polarization. Explicitly, putting gives
Thus linearity extends the equality to every :
Finally trace preservation and cyclicity of the trace give
For pure-projector inputs this says the Hermitian operator has zero expectation on every vector, so it vanishes. Therefore
This is the spectral Kraus decomposition. Using a normalized Choi state instead would require the extra factor when reshaping its eigenvectors into Kraus operators.
The linear operator acts on the first factor, while the partial inner product acts on the second. They therefore commute in the contraction:
Thus the operated vector is exactly the relative state obtained from the operated bipartite vector using the same conjugate index vector. For a physical normalized pure state, divide by when that norm is nonzero. If , the vector identity still holds, but there is no normalized output state for that zero-probability branch. An arbitrary operator is not assumed unitary or norm preserving.
Write and choose the conjugate index vector
With , the partial inner product gives
This is the relative state construction. The coefficient conjugation is defined relative to the fixed paired bases; it is essential, because the bra conjugates those coefficients again. Using the normalized entangled vector instead would give .
Fix paired orthonormal bases in the two -dimensional Hilbert spaces. A maximally entangled state is
It is normalized, and the partial traces of its rank-one density operator are . Thus all its Schmidt coefficients are and its entanglement entropy is . No pure bipartite state of these dimensions can have larger entanglement entropy: nonnegativity of quantum relative entropy applied to a reduced state and gives . Hence it is maximally entangled.
The Holevo-Schumacher-Westmoreland theorem gives the classical coding formula
Its ensemble-coding statement makes every rate below a one-use output Holevo quantity achievable with product input encodings and collective output decoding. Under this product-input restriction, the capacity is
For any such input ensemble, rates below its output Holevo quantity are achievable with asymptotically vanishing decoding error. Maximization gives the product-state classical capacity. The converse follows from the Holevo bound, entropy bounds on product outputs, and Fano's inequality.
Define the binary entropy . For an input Bloch radius , the output eigenvalues are . Its entropy is
On , is decreasing, so this is minimized by pure inputs . Throughout the completely positive interval , the minimum equals , using symmetry . The average output entropy is at most , because it is a qubit. Hence every ensemble satisfies
Two equally likely orthogonal pure inputs attain this bound: their average output is , and each individual output has entropy . Therefore
This gives the Holevo capacity of a qubit depolarizing channel in the noise-weight convention used here.
For completeness, correlated classical code labels do not evade this upper bound. Each product input to uses has product output entropy at least , whereas the average output entropy is at most . Its Holevo quantity is consequently at most . The Holevo bound and Fano's inequality rule out a reliable rate larger than this value. Combined with HSW achievability, this proves the capacity under the stated product-input restriction. It also remains valid in the extended physical parameter range arising from the original assumption.
For the quantum state ensemble with average , the Holevo quantity is
The second equality follows by expanding the trace definition: . All positive-weight states are supported within , so the expression is finite.
For a CPTP map , the output average is , with unchanged probabilities . The data-processing inequality for quantum relative entropy gives
Thus the Holevo quantity cannot increase under a quantum channel.
The underlying monotonicity can also be seen directly from Strong subadditivity of Von Neumann entropy. Attach the classical label , and realize by a Stinespring representation of a completely positive map with output and discarded environment . The isometry preserves , whose input value is . The difference from the output value is
which is precisely strong subadditivity. This explains why discarding an environment loses accessible ensemble information.
Here “operation” means the unconditional channel, including the classical outcome when a measurement is retained. Conditioning on a selected outcome can increase the Holevo quantity. For instance, take equally likely vectors , with . Their input Holevo quantity is . The filter succeeds on either state with probability and produces the orthogonal states after normalization. The success-conditioned quantity is . This does not violate the unconditional statement.
From the derived formula,
so the action on the Bloch vector is
For , every direction is contracted by the same positive factor. The pure-state Bloch sphere becomes a concentric sphere of radius , and the Bloch ball contracts towards the maximally mixed density operator . The lack of a preferred direction explains the name depolarizing channel.
At all inputs become . For the allowed Pauli-error range , the factor is negative, so there is also an antipodal reversal; the radius is . Thus it would be incorrect to describe the whole printed range as positive radial contraction.
The PDF's first Pauli term contains an undefined . For the stated depolarizing channel, use , consistently with the other two terms. This is the minimal typographical correction needed to define the intended Pauli channel.
Write using its Bloch vector. The Pauli matrices satisfy for and for . Thus conjugating by each nonidentity Pauli matrix leaves one Bloch component unchanged and reverses the other two. Summing the three conjugates gives
Substitution yields
so the Pauli-mixture parametrization of qubit depolarization, with here the total error probability, gives
There is also a genuine range error in the printed claim. For its full assumption, , and holds exactly when . For example gives ; on the output is , with negative Bloch component. No could produce this output from that input, since its component would be .
The corrected channel is still completely positive in the larger range: its original Pauli probabilities are . This is depolarizing noise weight above one; the formula with is not a convex mixture with weights , but it has a valid random unitary channel representation. The subsequent parts can therefore be solved both in the printed regime and in the actual parameter range.
Choose . The preceding construction and the typical subspace theorem give, for all sufficiently large ,
Embed this code into qubits. The unused subspace can be decoded to a fixed source state, making the extended decoder trace preserving; encoded states never enter it. Hence its rate is .
For every , sufficiently large has . The proved fidelity bound yields
Since is arbitrary, . Therefore
This establishes the achievability part of Schumacher compression, including the failure flag and without presuming the source ensemble is orthogonal. If exceeds one, the same rate-budget construction simply uses spare code qubits; no claim of reducing the physical register size is then needed.
For a block with nonzero typical dimension, write and . Let the compressed register be a copy of the typical space plus a one-dimensional orthogonal failure flag. Choose an isometry onto the successful code sector, extended by zero on , and a normalized flag orthogonal to its range. Choose any normalized vector in the source Hilbert space. Define
These are CPTP maps: the first performs the projective test and either encodes or prepares a flag; the second embeds the successful sector and prepares a fixed state on failure. Their trace identities follow from and . Thus typical-subspace compression with a failure flag implements
For a source vector , let . Its overlap with the decoded state is
where the final step is . Averaging proves average pure-source fidelity after typical projection:
No orthogonality of the emitted vectors was used. The code dimension is ; the extra flag has vanishing asymptotic rate cost. Exceptional small block lengths with empty typical space can use any channel, since they do not affect reliability.
For fixed , let the quantum typical subspace be spanned by the product eigenvectors with nonzero eigenvalues satisfying
Equivalently their spectral information lies within of . Denote its orthogonal projection by .
The typical subspace theorem states that for every there is such that for ,
Also the operator bounds on its range are
To see the concentration statement, sample independently with probabilities . The mean of is , so the weak law of large numbers gives typical probability tending to one. Zero-eigenvalue letters have probability zero and are excluded. The dimension bounds follow by summing the upper and lower typical eigenvalue bounds and using the typical mass between and .
Write the spectral decomposition of the one-qubit density operator as . For a word , the tensor product vector
is an eigenvector of , with eigenvalue
These product vectors form an orthonormal eigenbasis, allowing arbitrary orthonormal choices within degeneracies. Using and ,
Thus the Von Neumann entropy is
This calculation uses the spectral ensemble of the memoryless quantum information source; the originally emitted vectors need not equal these eigenvectors.
A compression scheme consists of quantum channels
where each is a CPTP map. The Hilbert space is the compressed register. Its block rate in qubits per source qubit is , with asymptotic rate (or the limit when it exists).
Use the squared quantum fidelity convention for the ensemble overlap:
This definition tests preservation of the emitted vectors themselves, including nonorthogonal ones; preserving only their classical labels would be a different task. The scheme is reliable when as . This is the ensemble-average criterion for reliable quantum source compression. A square root is not taken in this definition, even though an unsquared convention is also used for quantum fidelity.
Omit indices of probability zero. The support of a positive operator of every remaining lies within that of , because is a positive sum containing . Thus is finite.
First suppose , so all quantities are finite. Expand the trace definitions of quantum relative entropy:
Therefore Donald's identity is
If the support condition on fails, at least one positive-weight also fails it. The left side and the final term on the right are then , while the first right-hand sum remains finite. The equality is valid in this extended sense, without taking any undefined difference of infinities.
Introduce an orthonormal classical-label basis and the classical-quantum state
Its reduced density operators are and . If are the eigenvalues of , the eigenvalues of are . Thus the entropy of an orthogonal quantum mixture is
where is the Shannon entropy. Apply the proved Subadditivity of Von Neumann entropy to and and cancel . This gives Concavity of Von Neumann entropy:
Zero-probability terms may simply be omitted. The equality condition from the preceding solution implies that equality holds precisely when all the positive-probability states are the same: the block equations follow from .
Use base-two logarithms, so Von Neumann entropy is measured in bits, and set . Write for the quantum relative entropy, the quantity denoted in the paper. It is unless the support of a positive operator lies within that of .
We first establish nonnegativity of quantum relative entropy, including its equality condition. Let and , and suppose the support condition holds. Put . Concavity of the scalar logarithm gives
Terms with have zero weight here. Working first with natural logarithms, the inequality yields
since the sum to at most . Equality forces for every positive-weight eigenvector, no remaining weight of outside their span, and equality in the logarithm's strict concavity. The latter makes each an eigenvector of with eigenvalue . Thus exactly when .
For the bipartite density operator,
Indeed, a projector onto the kernel of , tensored with , has zero expectation in . Positivity implies that annihilates its range: . The same argument applies to . Hence the quantum relative entropy below is finite. On this support,
Using the partial trace to evaluate the two local terms gives
This proves Subadditivity of Von Neumann entropy:
The proof also identifies equality exactly with the product state .
For finitely many disjoint bounded intervals , all dyadic cells used in their level- sums are disjoint. The independent occupied indicators proved in part (a) form independent groups, so are independent. Their almost-sure limits are also independent: for , bounded convergence gives
This joint probability generating function determines the joint law as that of independent Poisson counts. If an interval is unbounded, truncate all intervals by and let in the joint Laplace transforms. An unbounded interval has infinite count almost surely, since its Poisson means tend to infinity; this extends the independence assertion to such intervals as well.
For an interval-step function with and disjoint bounded intervals, independent Poisson distributions yield
We now extend this to arbitrary nonnegative Borel functions, rather than stopping at interval-step functions. The mean measure is countably additive by Tonelli theorem, is finite on bounded intervals, and agrees with on intervals by the preceding Poisson count calculation. Uniqueness of finite measures on each bounded Borel space, then exhaustion by bounded spaces, gives on every Borel set. Simple-function approximation therefore gives
For bounded supported in a bounded interval, choose nonnegative interval-step functions with . Their existence follows by approximating measurable level sets in finite Lebesgue measure by finite unions of intervals, then approximating by simple functions. The mean-measure identity implies
The function is one-Lipschitz on , so the expectations of the exponentials converge. The deterministic integrals of converge by the same Lipschitz bound. Hence the Laplace formula holds for this bounded Borel .
For general , put . These functions increase to , giving and . Bounded convergence for the exponentials and monotone convergence for the integrals prove the Laplace functional of a Poisson random measure:
with .
Finally take for disjoint Borel sets of finite Lebesgue measure. The formula gives the product joint Laplace transform of independent Poisson counts with means . Uniqueness of that transform proves the required count laws on all Borel sets. For infinite-measure sets the formula gives for , so their counts are infinite almost surely. Together with the given local finiteness, these facts show that is a Poisson random measure with intensity . This completes the exponential void probabilities characterize a Poisson random measure argument; simplicity was used to recover counts from fine-cell occupancy.
Let . For any subset , simultaneous voidness is voidness of the union. Since the intervals are disjoint, the assumed void probability functional gives
This includes the empty subset. To check all event patterns explicitly, apply the inclusion-exclusion principle to the complements in a chosen pattern:
Thus the void events are mutually independent, and their complementary occupied-cell indicators are mutually independent too. This is joint independence, not merely pairwise independence.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact