Let be the orthogonal projection onto the good linear subspace , and let be a prepared unit vector with . For , define
The amplitude amplification theorem states that, if the reflection operators about the initial state and the good subspace can be implemented, the iteration
satisfies
To prove it, the two reflections preserve the linear span of . In this ordered orthonormal basis, direct multiplication gives
Multiplying this rotation matrix by replaces by , proving the formula by mathematical induction.
For known , choose to be a nearest nonnegative integer to . Then , so measurement finds the good subspace with probability at least , using iterations. For , measurement of the initial state already has constant success probability. If success is certain; if these reflections cannot create any good component. If , the initial-state reflection is , implemented using quantum state preparation and its inverse quantum circuit.
Figure 1. . Each iteration adds the angle in the good-bad plane. The probability rises near one and then falls again, so the stopping time matters. Details.
The distinct values in one period imply that is the least positive period, , and . Write , where and . Use the positive-exponent quantum Fourier transform convention already used in the concept article. The amplitude of first-register value is
By the root-of-unity filter, the inner sum vanishes unless . Define
The distinct give an orthonormal basis of the second register, and the transformed state is
Reindexing modulo shows
Consequently measurement in this common eigenbasis returns each with probability ; the corresponding eigenvalue of is a uniformly sampled th root of unity. A single measured phase reveals the denominator , which need not be . Repeated samples permit exact period recovery from a Fourier sample, for example by taking the least common multiple of their reduced denominators. The simultaneous eigenspaces and their probabilities depend on , not on the particular labels .
By Donald's identity, the objective equals
The nonnegativity of quantum relative entropy makes the last term at least zero, with equality exactly when . Hence the unique minimizing density operator is the ensemble average and
For the classical-quantum state , its marginal on has entropy , its marginal on is , and its joint entropy is . Substituting in the definition of quantum mutual information gives
This is the relative-entropy barycenter of a quantum ensemble: the average state minimizes mean distinguishability from the ensemble. Its minimal value is exactly the Holevo quantity.
Let . When the relative entropies are finite, expanding their trace definitions gives
Thus Donald's identity is
For every , the support of a positive operator lies in that of , so the first sum on the right is finite in finite dimension. If the support of is not contained in the support of , at least one positive-weight also violates the support condition. Both sides of the identity are then . This extends the conclusion without subtracting infinite quantities.
Write a qubit density operator in Bloch vector form, , with . The quantum depolarizing channel maps to , so its output eigenvalues are . The output Von Neumann entropy is minimized on pure inputs, where it equals .
For any input ensemble, its output Holevo quantity is at most the maximum qubit entropy minus this minimum output entropy:
Equality is attained by two equiprobable orthogonal pure inputs: their average output is , while each output has the minimum entropy. Thus
This uses the question's retention parameter ; in the usual convex-mixture range, . The expression also holds throughout the full completely positive qubit range , since .
The supplied additivity of Holevo capacity gives . The Holevo-Schumacher-Westmoreland theorem expresses the unassisted classical capacity of a quantum channel as the regularized Holevo capacity, so
Therefore entangled inputs across channel uses cannot increase this classical capacity.
First prove monotonicity for a partial trace. Let and define the Heisenberg-Weyl twirling channel
The supplied identity on individual operators extends to bipartite operators by expanding them in a tensor-product basis. The joint convexity of quantum relative entropy and its unitary invariance imply
The additivity of quantum relative entropy makes the left side , proving the partial-trace case.
For a general deterministic quantum operation, meaning a quantum channel, use a Stinespring dilation with . An isometric embedding preserves quantum relative entropy, because restricting the output to the common image of preserves the eigenvalues and trace formula. Applying the partial-trace result gives
The other properties used are unitary invariance and invariance under adjoining an identical ancillary state; both follow directly from the relative-entropy trace formula. This is the Lindblad-Uhlmann monotonicity theorem. The proof applies to deterministic channels; normalized postselection is not such a linear channel.
Choose the trace-distance-preserving binary measurement from the previous part. Let be its output probability distributions, so . The data-processing inequality for quantum relative entropy gives
For diagonal density operators, the quantum expression is the classical Kullback-Leibler divergence. Applying the supplied Pinsker's inequality gives
Consequently the quantum Pinsker inequality is
The factor converts natural-logarithm relative entropy to bits. If the relative entropy is infinite because its support condition fails, the inequality holds automatically.
Let be the maximizing projection in the variational characterization of trace distance. Use the binary POVM and its measurement channel. The difference between its two output probability vectors is
where and the second equality uses . Since trace distance between diagonal density operators is half the L1 norm of their probability-vector difference,
Thus a binary quantum measurement can preserve the distinguishability of this particular pair exactly. This is the trace-distance-preserving binary measurement, which may depend on the two states.
Choose an orthonormal basis of the input space and define operators from the input to the -dimensional outcome register by
These give a Kraus representation:
The POVM completeness relation gives
Therefore is a completely positive map and is trace preserving: it is a quantum channel representing a deterministic measurement channel.
Let be its positive-negative decomposition. Since , the positive and negative parts have equal trace, namely . For every positive contraction ,
Here both products have nonnegative trace, and bounds the first term. Equality is attained by the orthogonal projection onto the positive spectral subspace of , since and . Thus the variational characterization of trace distance is
Put . Since is a positive contraction, the successful post-measurement state is the pure state represented by . Its squared quantum fidelity with the input is
The finite-dimensional spectral theorem and give , so . Therefore the pure-state gentle measurement bound is
The positive-operator assumption matters: an arbitrary unitary measurement operator can have success probability one while rotating the state to an orthogonal vector.
Assume a finite-dimensional memoryless quantum channel, no shared entanglement, and a code of messages with . Use a uniform message to relate average and maximum error. Each permitted input is a product state , giving output . The factors may depend on both the message and the channel use.
Let denote the one-use Holevo capacity in the question. The Subadditivity of Von Neumann entropy for the average output, and entropy additivity for each product output, imply
This is the key step of the product-input classical-capacity converse; it does not assume that the average output itself is a product.
Bob may measure all outputs jointly. The Holevo bound still gives . Let be his average message-error probability. Fano's inequality gives
Since the maximum error is at least ,
when . Thus the maximum error cannot vanish asymptotically.
Assume no previously shared entanglement. Alice's encoded ensemble lives in a Hilbert space of dimension . Its Holevo quantity satisfies
using nonnegativity of Von Neumann entropy and the maximum entropy of a quantum state. The data-processing inequality for quantum relative entropy implies for the transmission quantum channel. Finally, the Holevo bound applied to Bob's quantum measurement gives
This argument also works when the output system has larger dimension than the input. Prior shared entanglement changes the communication resource: superdense coding can transmit two classical bits per sent qubit, so the absence of that resource is part of this bound's setting.
Let indicate whether the outcome differs from . Then . The chain rule for information entropy gives
since is determined when . The remaining conditional distribution has at most outcomes, so the maximum entropy on a finite alphabet is . Therefore the Shannon source coding theorem limit obeys
Here is the binary entropy function; equality holds when the rare outcomes are equiprobable. A convenient explicit small- bound is
because . For a fixed alphabet, this upper bound tends to zero as .

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