This is the dephased Bell-state mixture with coherence parameter . The Pauli correlation tensor is
so spin measurements along unit vectors have . Choose
Then and . The CHSH inequality expression is therefore
These axes also attain the CHSH optimum from the correlation tensor, since the two largest eigenvalues of are and . At the value is ; at the explicit LHV model in part (c) applies. Thus exactly has correlations incompatible with a local hidden-variable description.
Arbitrarily small positive coherence suffices in this particular one-parameter family, with optimally chosen axes; the violation above two tends to zero quadratically as . This does not imply that every entangled mixed state violates a CHSH inequality.
The equal mixture of and cancels their off-diagonal coherence, leaving the separable quantum state
A trivial LHV model chooses a shared random bit , uniformly zero or one, and prepares both local qubits in . Each party uses the local Born rule for its own chosen spin direction, with independent local random seeds if a deterministic description is desired. This reproduces the entire joint measurement distribution, not merely the -axis correlation.
Since the state has an explicit local hidden-variable theory for these local measurements, it cannot violate the CHSH inequality, by the derivation in part (b). Classical correlation of the shared preparation bit is sufficient; the cancellation of coherence removes the entanglement.
Combining the EPR criterion of reality with perfect predictive correlations and locality motivates pre-existing values for the locally selectable observables. The general local hidden-variable theory additionally assumes a complete shared variable and conditional factorization
The second condition is measurement independence. The reality criterion alone does not prove this factorization for arbitrary imperfect correlations: it motivates the local completion whose consequences are being tested.
A deterministic local hidden-variable model may be used without loss of generality by putting local random seeds into . For each , write its setting responses as . Integrating with the same setting-independent distribution and using the triangle inequality gives
Exactly one of and vanishes and the other has magnitude two. Hence the requested CHSH bound is two. No assumption about the spacelike quantum state enters this local-model derivation.
The EPR criterion of reality proposes that a quantity has an element of physical reality when its value can be predicted with certainty without disturbing the system. It is a sufficient criterion, not a claim that every uncertain prediction is unreal. In the original locality argument, measuring one member of a separated correlated pair allows such a prediction for the other, whose physical condition is assumed unaffected by the remote choice.
Bob uses qudit teleportation to teleport his carrier to Clare through the pair . This transfers Bob's entanglement with Alice to Clare. Explicitly, Bob performs a generalized Bell basis measurement on . Contraction of the two initial pairs gives
The probability is for each outcome. Bob sends to Clare, who applies . Alice and Clare then share with certainty. This is entanglement swapping; neither an additional entangled pair nor a quantum transmission during the protocol is required.
The two initial pairs are consumed, and Bob's measured carriers cease to be entangled with . Without Bob's classical record, averaging the possible generalized Bell states leaves maximally mixed. Thus the conditional entanglement swapping does not supply faster-than-light communication.
The root must be a primitive th root of unity, for example . The printed statement merely says th root; that is insufficient. With and , the states with and coincide. More generally, a root of order repeats the labels modulo . For the construction is trivial.
For a primitive root of unity, the generalized Bell basis obeys
The last equality follows from the finite geometric series: a nonzero exponent difference modulo has sum zero, while zero difference has sum . There are orthonormal vectors in an -dimensional Hilbert space, so they form a complete basis.
For qudit teleportation, Alice's input is . Alice and Bob share . Define the qudit shift and phase operators by and . Alice measures in the generalized Bell basis. On outcome , Bob's unnormalized state is
All outcomes have probability . Alice communicates and Bob applies
which restores exactly. The protocol consumes one maximally entangled pair of -level systems, a local -outcome measurement, and a classical message with possibilities. For a fixed-length binary encoding, bits suffice. No measurement depends on the unknown amplitudes.
Write the arbitrary joint pure state of the input and an external reference as
The reference vectors need not be normalized or orthogonal. Share . Label Alice's Bell states by
Projecting onto this Bell basis gives the unnormalized state
Each outcome has probability . Alice sends and Bob applies , reversing the two Pauli gates. The final state is exactly for every outcome. In particular all input entanglement and other correlations with now belong to , while the reference marginal is unchanged. This is teleportation as an identity channel on a reference.
Conditioned on the record, Alice's two measured carriers are in and factor from . Thus no longer retains its original correlations with . There is no second copy, even when the teleported qubit was initially entangled with a larger system.
Quantum teleportation transfers the quantum state of an unknown qubit from a sender's carrier to a receiver's carrier. It also transfers correlations with any external reference. It does not determine classical amplitudes or send the original particle.
The standard deterministic protocol consumes one shared maximally entangled Bell pair and two classical bits from Alice to Bob. Alice performs a local Bell-basis measurement on the input and her half of the pair; Bob applies the corresponding local Pauli gate. The classical message is essential: before receiving it, Bob has the outcome-averaged density operator and cannot recover or detect the unknown state. The original input is consumed by the measurement, so quantum teleportation is compatible with the no-cloning theorem.
Interpret the requested measurement as distinguishing all four stated orthogonal eigenstates, hence as their rank-one projective measurement. If they have indistinguishable degenerate eigenvalues, this assumption need not hold; the identity observable, for example, cannot reveal the basis and gives no contradiction.
Let Bob initially prepare . Alice encodes a bit by preparing or , without changing Bob's initial reduced density matrix. If Alice prepares zero, the global input is the first eigenstate, so nondemolition leaves Bob in with certainty. If Alice prepares one, the rank-one Lüders rule, after discarding the outcome, dephases Bob in the rotated basis
His output is . A computational-basis measurement then gives
It is positive for every . Repeating the experiment would transmit Alice's choice across a spacelike interval, violating quantum no-signalling. The controlled-basis measurement causality obstruction therefore excludes the entire nonzero interval, including .
At , the basis is the computational product basis, up to an irrelevant sign on the fourth vector. Alice and Bob each measure locally, then compare their results later. Each product eigenstate is preserved. Thus being a product basis is insufficient for an instantaneous quantum nondemolition measurement: a remote party's choice of which local basis is measured can still cause signalling.
Use one shared pair to measure , and the other to measure . The latter entanglement-assisted nondemolition parity measurement is obtained by applying Hadamard gates to both system qubits before and after the -parity circuit. Since at each site, the two minus signs cancel, giving .
The Bell states have joint eigenvalues
and are therefore distinguished uniquely by the two meter parities. For records and , the combined Kraus operator is
Each is the rank-one projector onto the corresponding Bell state. This is a Bell-state nondemolition measurement: an input Bell state remains exactly that state for every possible local record. The local circuits can be scheduled without communication; the identity of the Bell state is known only when the classical records are brought together. Two parity bits distinguish all four Bell states without disturbing them.
Use the nonnegative representative of reduction modulo four. The four product eigenstates and eigenvalues are
because . Consequently the observable is . It has the even sector with value two and the odd sector with value zero.
The entanglement-assisted nondemolition parity measurement needs just the single shared provided in the question. Apply and . For a computational-basis input , the meter becomes
Measuring the meters gives . For an arbitrary coherent system input, its conditional Kraus operator is
It preserves every superposition within the measured sector, so this realizes the Lüders rule for the two degenerate eigenvalues. The answer is two for equal meter bits, zero for unequal meter bits. Each individual meter bit is uniform; only later comparison reveals the parity, respecting quantum no-signalling. This construction is independent of the defective one-pair singlet-verification request in part (a).
Put and . The total-spin sector with spin zero consists of the spin singlet state , not the whole subspace with zero component. These must be distinguished: the Bell state has zero component but total spin one.
There are two meanings of verification to separate here. A one-pair entanglement-assisted statistical singlet verification is possible: choose a shared random axis from , measure that axis's two-spin parity by the meter circuit below, and accept anticorrelation. An or test uses local basis changes before and after the computational-axis circuit. The singlet always passes and is unchanged. Averaging the three acceptance projectors gives
Every triplet state passes with probability , so a failure excludes the singlet, while repeated tests on independently prepared copies can give statistical confidence. A single pass does not certify the singlet with certainty.
Exact single-shot verification cannot be implemented with just one shared Bell pair. Here exact verification means a yes outcome with probability one on the spin singlet state, zero on its orthogonal complement, and preservation of the singlet on yes. If that stronger meaning is intended, the question needs an extra resource. The Bell-pair cost of exact nondemolition singlet verification gives a short proof. For a fully resolved tuple of local measurement records, contraction of the shared gives a system Kraus operator
Local ancillas and locally adaptive operations are included in these operators. Refining any unobserved local environment gives the same form, so the operator Schmidt rank is at most two. On each nonzero yes branch, zero false positives forces to vanish on the entire triplet subspace, and singlet preservation forces
The four Pauli matrices, including the identity, are an orthogonal operator basis. Thus has operator Schmidt rank four, contradicting the rank-two bound. At least one yes branch is nonzero because the singlet must pass with certainty. Shared classical randomness cannot evade this branchwise argument.
With two shared Bell pairs, an explicit corrected protocol is available. On the first meter pair, apply local system-to-meter CNOT gates and measure both meters in the computational basis. If their records are , the Kraus operator is , where and . On the second pair, measure by the same circuit conjugated with local Hadamard gates on the system. The two parities commute, and their joint projectors are the four Bell-state nondemolition measurement projectors. The singlet is exactly the outcome and remains unchanged. Local interactions and readouts fit within the stated interval; the combined verdict becomes available only after the records are compared by classical communication.
This corrected exact protocol resolves the triplet into three Bell states. It preserves the singlet and every Bell state, but generally destroys triplet superpositions. A binary Lüders rule measurement preserving all triplet coherence is a different operation: it violates the singlet-triplet measurement causality obstruction. The one-pair protocol used below measures a single parity and supplies the statistical test above; it does not give exact single-shot singlet verification.
The final printed direction is reversed under the majorization convention stated in the same part. A completely depolarizing unital quantum channel sends a pure qubit state to , giving spectra and . The proposed fails already at the first partial sum, since . The valid conclusion is
Here is its general proof. Choose eigenbases and , and define the eigenvalue mixing matrix of a unital quantum channel
Its entries are nonnegative by positivity. Trace preservation gives for every column. Unitality gives for every row. Thus is a doubly stochastic matrix, and linearity gives
The supplied doubly stochastic characterization of majorization then yields , completing the intended corrected result. This proves spectral majorization under a unital quantum channel. A unital quantum channel can make a spectrum more uniform; it cannot generally make the output spectrum majorize the input. The counterexample resolves the false printed assertion rather than treating the reversed inequality as a convention change.
Write a bipartite pure state in fixed product bases as . The Schmidt decomposition theorem, equivalently the singular value decomposition of , says that its Schmidt rank equals . A branch of local operations is a product operator , so its coefficient matrix is
The elementary rank inequality proves Schmidt-rank contraction under product operators. Normalizing a nonzero branch does not change matrix rank.
For an adaptive LOCC protocol, a complete classical transcript selects one local Kraus operator at each stage. Multiplying the local operators along that transcript still gives one product . Consequently
Classical communication changes which product operator is chosen, not this rank bound. If the overall output is a pure state, every nonzero branch must be proportional to that same vector, so its Schmidt rank also cannot increase. If the outcome is discarded and the output is mixed, pure-state Schmidt rank is not defined; the induced decomposition instead shows that its Schmidt number is at most the original rank. This includes probabilistic filtering as well as deterministic pure-state conversion.
Apply a Hadamard gate to qubit , followed by a controlled-NOT gate with controlling . The resulting Bell-basis conversion circuit is and gives
Thus map respectively to . The first input bit becomes the phase bit and the second becomes the parity bit.
Both gates are self-inverse, but inversion of their product reverses the order:
So the same two gates convert the Bell basis back to the computational basis when applied in reverse order: first the controlled-NOT, then the Hadamard. Using the forward order twice does not generally work, since these gates do not commute. For example, , which is not a computational-basis state.
The Bell basis consists of
Let , . The Pauli operators and commute: each of the two local anticommutations contributes a minus sign, so they cancel. Their eigenvalue table is
To make the bit values literally zero or one rather than signed eigenvalues, the commuting Bell parity and phase observables are
They distinguish all four states jointly. The parity bit records whether the computational bits agree; the phase bit records the relative sign.
Diagonalize the source average , using its positive eigenvalues. For fixed , let project onto product eigenvectors whose eigenvalues obey
The typical subspace theorem states that, for every and all sufficiently large ,
The probability statement is the weak law of large numbers applied to ; the dimension bounds follow by summing the typical eigenvalue bounds. This explains why the quantum typical subspace retains almost all probability using about qubits.
For choose . Measure . On success, encode the projected state isometrically into a space of dimension ; on failure, output a separate fixed flag. Decode the successful sector by the inverse isometry, and map the flag to a fixed state . The compressed dimension is at most , hence fits within rate for all sufficiently large . Both maps are trace-preserving quantum channels, not merely successful postselected operations.
Writing , the composite channel is
For a pure source signal , set . Its squared quantum fidelity after the composite channel is at least . Since the source is memoryless, its average state on uses is . Convexity of the square gives
The Kraus formula for entanglement fidelity gives the same lower bound for , because one Kraus operator is and the other terms are nonnegative. Taking proves reliable compression at every , in both average pure-signal fidelity and the stronger entanglement-fidelity sense. This is typical-subspace compression with a failure flag.
Put . The state is well defined for , with eigenvalues . The first state is pure and has zero Von Neumann entropy, so the exact difference is
This is the entropy of a binary diagonal qubit mixture. Its trace distance from the pure state is , not . An explicit elementary upper bound follows from :
At zero the limit is zero. For small , the sharp exact answer behaves as , displaying the logarithmic continuity of entropy near a pure state.

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