Both output states have the same reference marginal, and . Expand quantum mutual information to obtain the mutual information and coherent information identity
The input-entropy term is identical in the two expressions. Subtract them and use the preceding data-processing inequality for coherent information:
Thus the final quantum channel cannot increase the reference-output quantum mutual information, as required by data processing for quantum mutual information.
Dilate the second quantum channel by an isometry , and set . Its marginal is the final output. Isometry invariance of Von Neumann entropy gives and . The difference between the two values of coherent information is therefore
Nonnegativity follows from Strong subadditivity of Von Neumann entropy. This proves the data-processing inequality for coherent information:
The dilated state here need not be pure. The proof uses only isometry invariance and strong subadditivity, so it applies even when the first channel has already entangled the input with its own discarded environment.
Subadditivity of Von Neumann entropy applied to gives . Together with the environment expression for coherent information,
The channel does not act on . Its reduced state has the same nonzero eigenvalues as the original input , because initially purifies that input. Hence
More precisely, : the coherent information upper bound by input entropy is a consequence of nonnegative quantum mutual information with the environment. Equality holds when and are uncorrelated.
Choose a Stinespring dilation of the quantum channel. Applying it to the input purification gives the pure vector
Its marginal is the output state in the definition of coherent information. Complementary subsystems of a pure state have the same nonzero eigenvalues, by the Schmidt decomposition. Thus and . It follows that
Here denotes quantum conditional entropy, evaluated on the complementary output . This is coherent information as an environment conditional entropy. Equivalently ; the environment expression has the positive sign, while the receiving-system expression has the negative sign.
Take a Stinespring dilation of the local quantum channel and define . Tracing out gives the prescribed output, with . An isometry preserves the nonzero eigenvalues of a density operator; therefore , , and .
Consequently . The loss of quantum mutual information is
The last inequality is Strong subadditivity of Von Neumann entropy, or nonnegativity of quantum conditional mutual information. Hence
This mutual-information loss as conditional mutual information shows exactly which correlations are discarded into the environment. No purity assumption on the original state is needed.
For any tripartite density operator, Strong subadditivity of Von Neumann entropy is
Use quantum relative entropy , with the usual support condition. The equivalent relative-entropy comparison is
Indeed the two sides expand respectively as and . Subtracting cancels and leaves exactly the strong-subadditivity gap. Marginal-product supports contain the support of the joint state, so these expressions are finite; singular marginals can also be handled by full-rank regularization and a limit.
Finally, tracing out sends the numerator and denominator of the first relative entropy to those of the second. The data-processing inequality for quantum relative entropy therefore proves the comparison. This is strong subadditivity from relative-entropy monotonicity, rather than an assumption that classical entropy proofs automatically apply to quantum states.
Let be the input Schmidt rank, so for and . If , the output rank is already at most . Otherwise, Nielsen's pure-state conversion theorem and majorization at give
Thus all output coefficients beyond vanish, proving
This is monotonicity of Schmidt rank under LOCC. It also holds separately in any nonzero postselected branch: represent the input amplitudes by a matrix ; a local branch maps it to , whose rank cannot exceed the rank of . The deterministic result requested here follows already from the majorization criterion.
Nielsen's pure-state conversion theorem gives the exact deterministic LOCC criterion. Let the Schmidt decompositions be and . The vectors consist of squared Schmidt coefficients, equivalently the eigenvalues of either reduced density operator. Order each in decreasing order and pad with zeros to a common length .
Then deterministic conversion is possible if and only if
This is majorization, with the input vector majorized by the output vector. The direction matters: a maximally entangled state has a uniform vector, which is majorized by a product state's vector , so entanglement can be discarded by LOCC. The criterion is for certain exact conversion, without catalysts or postselection on a successful branch.
Use Klein's inequality, or equivalently nonnegativity of quantum relative entropy. First check the support needed for the logarithm. If , positivity gives for every ; the corresponding row and column vanish. Thus support inclusion under rank-one dephasing gives , and the logarithms may be evaluated on this support.
Since is diagonal in the dephasing basis,
The relative-entropy identity for rank-one dephasing follows:
Klein's inequality gives . Therefore
Equality holds precisely when , meaning that the input was already diagonal in the chosen basis. This quantifies why rank-one dephasing removes coherence without reducing the entropy.
Let . Positivity and normalization of the density operator imply and . The completely dephasing channel produces
which is already a spectral decomposition. Its Von Neumann entropy is therefore
The quantum output entropy is exactly the Shannon entropy of the basis-measurement probabilities, including possible zero eigenvalues via .
Set . The map is in Kraus representation:
For any ancillary Hilbert space and positive operator on ,
This verifies complete positivity directly, not merely positivity on unextended states. Cyclicity of the trace gives . Thus is a CPTP map, the completely dephasing channel in the given basis.
Fix an orthonormal basis of the input Hilbert space, where , and a reference copy . Use the normalized maximally entangled vector . The normalized Choi–Jamiołkowski state is
Complete positivity makes , and trace preservation gives , hence . It is therefore a genuine density operator. In the unnormalized Choi matrix convention the factor is omitted and the trace is ; specifying normalization distinguishes a Choi state from that matrix convention. The reference basis also fixes the transpose in the Choi reconstruction formula, .
For each , choose purifications of and of in a common reference space. By Uhlmann's theorem, the second can be chosen, including its overall phase, so that
Construct the two flagged purifications of a quantum ensemble
Their reduced states are the respective mixtures, and orthogonality of the flags gives . A particular purification overlap cannot exceed the maximizing overlap in Uhlmann's theorem. Hence
This proves joint concavity of quantum fidelity. Choosing each overlap nonnegative prevents cancellation of different phases; the same probability weights in the two mixtures yield rather than distinct square-root weights.
Embed the given purifications into a common reference Hilbert space , enlarging it if necessary, and add a flag register with orthonormal basis . A flagged purification of a quantum ensemble is
Orthogonality of the flags gives . Moreover,
Thus it is a purification of a density operator. The extra flag is essential: simply superposing the purifications without orthogonal labels would generally leave unwanted cross terms.
Uhlmann's theorem identifies quantum fidelity with the largest absolute overlap of purifications of a density operator. Choose a common reference Hilbert space of dimension at least that of the original system. Then
where have reduced density operators . One purification may be fixed in advance: the maximum is over the other, with the freedom to apply a unitary on the reference system. This is the unitary freedom of purification. Enlarging the reference by unused dimensions does not change the maximum.
Take maximizing purifications of on . Their overlap has magnitude . Regard these same vectors as purifications of with reference system . They are candidates in the larger optimization, so Uhlmann's theorem gives
This is monotonicity of quantum fidelity under partial trace: discarding a system cannot make two states more distinguishable according to their quantum fidelity.

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