Use two-bit remote state preparation on a graph-state path. Alice performs the first two measurements from the preceding measurement-based quantum computation: angle on her first qubit, giving , then angle on her second, giving . She sends the pair to Bob, using exactly two classical communication bits.
The branch calculation already gives Bob's state as , where . Bob applies first and second, so his correction operator is . Since ,
Thus
The final state is exactly the desired state up to the irrelevant global phase. No postselection is used: all four measurement branches have probability and are corrected. Bob does not need the angles themselves; Alice uses them in her measurement choices, while the two bits specify his Pauli correction.
First expand the result of the first gate in the computational basis:
Using and , this becomes
Apply and to obtain
For example, its quantum measurement in the computational basis has probabilities and , obtained by squaring the two basis amplitudes.
Prepare the three-vertex graph-state wire: start all three qubits in and apply Controlled-Z gates on edges and . In this paper's equatorial qubit measurement convention the basis vectors can be chosen as
The given identity means that measuring an input qubit at angle , with outcome , teleports its state to the next qubit as . Each outcome has probability , since is unitary. This is one-bit teleportation with a known Pauli frame.
Measure vertex 1 at angle and record . Then measure vertex 2 at angle , taken modulo , and record . The controlled-Z on edge commutes with the first measurement, so the two teleportation steps can be applied successively. The remaining normalized state is
For this is . For , the relation proved above gives . Thus in every branch the remaining state is
The scalar is a global phase and has no effect on probabilities.
Finally measure vertex 3 in the computational basis, obtaining , and report
The byproduct changes only computational-basis phases; changes the output label by . Hence the corrected bit has exactly the ideal circuit's probability distribution in every branch, not merely on average. The procedure uses only single-qubit measurements after preparing the graph state, adaptive classical angle selection, and deterministic classical output processing.
The Pauli Z gate exchanges the two Hadamard basis states: and . Multiplying the displayed gate by the Pauli X gate gives
On the other hand,
The two operators agree, proving
Also in the J gate convention. Keeping this angle sign explicit avoids confusing the two conventions for equatorial qubit measurements.
Use a verified Grover promise test. Since , . Choose
This is a nearest integer to , so . Run the Grover search algorithm for iterations and measure the candidate . Make one further oracle query with input and measure the answer bit . Declare that a marked entry exists exactly when this bit is one.
In the zero case the verification always returns zero, so the decision is correct with certainty. In the single-marked-entry case, verification returns one exactly when the candidate is , and
Finally, on gives . Hence
The verification query is necessary for this decision rule: an unverified search-register label does not itself say whether it is marked.
If there is no marked entry, the Boolean quantum oracle is the identity. The uniform superposition state is a positive eigenstate of the Grover diffusion operator:
Thus every iteration leaves the full state unchanged. The measured search bits have the uniform distribution
Only the first qubits are measured in the printed circuit. If the untouched ancilla were also measured in the computational basis, its bit would be an independent fair bit, giving probability for each joint outcome.
Write and . The initial Hadamard gates prepare in the search register and in the final quantum ancilla. Since the Pauli X gate satisfies , the Boolean quantum oracle acts by quantum phase kickback:
For a single marked entry this is the marked-state phase oracle on the search register. The ancilla stays separate and unchanged throughout.
The Grover diffusion operator is , because . The PDF circuit places one diffusion after each oracle call, so the state before measurement is
In the supplied amplitude amplification theorem, take and . Their overlap has modulus , so the Grover rotation angle is . A quantum measurement in the computational basis therefore gives
The inverse sine here is applied to the overlap of the two different states. The converted TeX's self-overlap in the angle definition is a transcription error; the original PDF has .
The two displayed amplitudes have modulus . Absorb their phases into Bob's basis rather than use complex Schmidt coefficients. Take , , and
Both local bases are orthonormal. A Schmidt decomposition is therefore
The two Schmidt coefficients are , the Schmidt number is two, and both reduced density operators are . Their equal eigenvalues make this decomposition nonunique.
In the computational product bases, the coefficient matrix is
Its determinant is , so it has rank two. Therefore the Schmidt number is . As a check, the reduced density operator has eigenvalues and , both positive.
The Schmidt decomposition of a normalized bipartite pure state is
The two sets of local vectors are orthonormal. The Schmidt coefficients are the nonnegative numbers , and the Schmidt number for this pure state, also called its Schmidt rank, is , the number of nonzero coefficients. It equals the rank of either reduced density operator and of the coefficient matrix in any product bases. The general mixed-state Schmidt number specializes to this same value on a pure state.
In the generalized measurement postulate, outcome is described by a Kraus operator , with . On a density operator its probability and conditional output, for nonzero probability, are
For a pure input the conditional vector is . The effects are positive and sum to the identity, defining a positive operator-valued measure.
More generally an outcome can have several Kraus operators . Then sum over in both the numerator and the probability, and require .
The usual projective measurement with the Lüders rule is recovered when the measurement operators are mutually orthogonal projections, , for , and . Projector-valued effects alone give projective outcome statistics; to obtain the Lüders state update as well, the instrument must implement , without an additional conditional state change.
For an ensemble , write its channel-output Holevo quantity as
Take ensembles and independently, giving the product ensemble . Its average output factors:
The Von Neumann entropy of a tensor product is the sum of its entropies. Applying this both to the average and to every labelled output gives
Choose each ensemble within of its supremum. The supremum for the joint channel includes this product ensemble, so its value is at least . Let . The superadditivity of Holevo capacity follows:
This argument does not restrict the joint supremum to product ensembles and does not require the individual suprema to be attained.
They need a pre-shared entanglement resource that permits deterministic production of a Bell pair. In particular, one shared Bell pair and two classical bits suffice for exact quantum teleportation. This condition is stronger than merely having some entanglement.
Let Alice's input be , and let her system and Bob's system share . Use the Bell states and . Direct expansion gives
Alice performs a projective measurement in this Bell basis and sends its two-bit outcome. Each outcome has probability . Bob applies respectively , recovering exactly, without either party knowing . Before he receives the outcome, his averaged state is , so the protocol does not communicate without the classical message. Alice's measurement consumes the input and the shared entanglement.
For necessity, exact transmission of every pure qubit means the induced quantum channel is the identity: pure-state projectors span the operator space, and a physical channel is linear. Alice can therefore prepare a Bell pair locally and transmit one half by the proposed protocol, leaving a Bell pair shared with Bob. The protocol would itself be a deterministic local operations and classical communication conversion of their resource into a Bell pair. This proves the exact teleportation resource criterion. With no shared entanglement, it is impossible: local operations and classical communication preserve separable quantum states, whereas the resulting Bell pair would be entangled.
Write a qubit density operator as , with Bloch vector . The depolarizing channel sends to . Its output eigenvalues are , so its Von Neumann entropy is minimized at . Define
The minimum output entropy is , since binary entropy is symmetric under . The usual probabilistic-mixture convention has . The argument also holds throughout the physical qubit CPTP range , where this still lies in .
To handle multiple channel uses, let a classical message select a product input with probability . Memorylessness gives product outputs . Additivity of Von Neumann entropy on tensor products gives . The average output acts on qubits, so . Thus the Holevo quantity obeys the product-input block bound for a qubit depolarizing channel
The Holevo bound says the classical mutual information obtained by any measurement, including a joint measurement on all outputs, is at most .
For a reliable code with equiprobable messages and decoding error , Fano's inequality gives . Consequently . Letting the error tend to zero proves .
The bound is tight: equal use of and computational-basis output measurements produce a binary symmetric channel with crossover probability . Ordinary classical coding achieves bits per use.
After the first quantum channel, denote the joint reference-output state by . Dilate the second CPTP map as an linear isometry , with the resulting state denoted . Linear isometries preserve nonzero eigenvalues, both globally and on the transformed output, giving
Tracing out implements the second channel, so
The Strong subadditivity of Von Neumann entropy for gives . Rearranging proves the data-processing inequality for coherent information:
Implement the quantum channel by a unitary dilation with a pure initial environment. The final state on is pure. The Schmidt decomposition across either bipartition gives equal complementary Von Neumann entropies, so and . By the Subadditivity of Von Neumann entropy,
The reference is untouched and purifies the input, hence . Therefore .
The channel acts only on the input system ; the reference is untouched. Write
The coherent information is
The reference marginal remains , whose nonzero eigenvalues agree with those of . Unlike a classical information quantity, coherent information can be negative.
Figure 1.
Quantum channel acting on one half of a purification, with untouched reference and discarded environment
. Details.
The lower diagram uses a Stinespring dilation: append an environment in a fixed pure state, apply a joint unitary operator, and discard the environment by partial trace. Before discarding it, the global state is pure.

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