Under the intended assumption that one use of the quantum channel transmits one qubit without noise, Alice can communicate two classical bits with certainty if she and Bob already share a Bell pair. She uses superdense coding. The prior distribution of the Bell pair must be a resource available before the permitted channel use; distributing it through that same channel would consume another use.
Take the shared Bell state to be , with Alice holding the first qubit. For a two-bit message , Alice applies the local unitary operation to her qubit. The four encoded pure states are, up to irrelevant global phases,
They are orthogonal: for any matrix on the first qubit, , and the four Pauli operators are orthogonal in the trace inner product. Explicitly,
Alice sends her qubit through the quantum channel once. Bob now holds both qubits and performs a Bell-basis measurement. Its four orthogonal projectors identify with certainty, giving
Before the transmission, Bob's reduced density matrix is for every message, so shared entanglement alone does not convey the message.
Without shared entanglement, a noiseless single-qubit transmission cannot perfectly distinguish four messages: perfect discrimination requires orthogonal state supports, and its two-dimensional Hilbert space has room for at most two nonzero mutually orthogonal supports. The Holevo bound also limits its accessible classical information to one bit. For the usual protocol starting with a shared two-qubit pure state and using local unitary encodings, exact two-bit transmission requires a maximally mixed Bob marginal. Indeed all encoded joint states are pure and have the same , while Subadditivity of Von Neumann entropy gives their average entropy at most . Four equally likely perfectly distinguishable messages have average Von Neumann entropy two, forcing and hence a maximally entangled state.
The specification “quantum channel” alone does not determine its dimension or noise, so the one-qubit, noiseless interpretation is needed for this particular conclusion. A noiseless four-dimensional channel could send four orthogonal states without any shared entanglement; a completely depolarizing qubit channel cannot transmit the message even with a shared Bell pair, since its output is independent of Alice's encoding. Shared entanglement is therefore the extra resource for the intended single-qubit channel, not a guarantee for every unspecified quantum channel.
There is a normalization error in the original PDF: the first term contains rather than . For a normalized qubit density operator, that printed expression has trace , so it is not a quantum channel except at . The intended depolarizing channel is the Pauli channel that leaves the input unchanged with probability and applies each nonidentity Pauli matrix with probability , for . Its Kraus operators are
and , proving that it is trace-preserving and a completely positive map.
Write the input in its Bloch vector representation,
Conjugation by a Pauli matrix keeps its own Bloch vector component and reverses the other two. More explicitly, for and for . Hence
The corrected quantum channel therefore gives
Thus its action is
The Bloch sphere is sent to a sphere of radius about the origin of the Bloch ball. At the action is the identity. For the Bloch vector shrinks without changing direction. At every input becomes the maximally mixed density operator . For , the Bloch vector reverses direction and shrinks, reaching factor at . The reversal is compatible with complete positivity because this remains a probabilistic mixture of Pauli matrices. The parameter here is the total nonidentity-error probability, not the retention parameter used in some definitions of the quantum depolarizing channel.
For completeness, retain the PDF literally and call its output . The same calculation gives
This has no normalized-output Bloch ball interpretation as printed. If it is manually normalized, then
That different transformation sends to , rather than to the input, and agrees with the intended answer only at . The literal and corrected conventions therefore cannot be silently identified.
A discrete memoryless channel is specified by discrete input and output alphabets and a transition probability , with and . Its successive outputs are conditionally independent given the inputs, with the same transition rule at every use:
Operationally, its channel capacity is the supremum of communication rates in bits per use attainable by increasingly long block codes with decoding error probability tending to zero. For finite alphabets, the equivalent Shannon characterization is
where is Shannon entropy, is classical conditional entropy, and the maximization is over the input probability distribution.
For the channel in question, the transition matrix, with input symbols indexing rows, is
Every row has the same Shannon entropy, namely the binary entropy . Consequently for every input probability distribution. Since the output has three symbols, the maximum entropy on a finite alphabet gives
Choose a uniform input. Each column of sums to one, so for every output symbol and the upper bound is attained. Finally
Thus the cyclic ternary channel capacity is
achieved by a uniform input probability distribution. This is a weakly symmetric channel capacity calculation: the matrix rows are permutations and the column sums agree. The channel is not the usual ternary symmetric-error channel, since an error has only one possible changed output for each input.
Expand an initial bipartite pure state in local orthonormal bases as
By the Schmidt decomposition, or equivalently the singular value decomposition of , its Schmidt rank is . In a specified local measurement branch, the product Kraus operator changes the coefficient matrix to
Indeed the coefficient of is . The elementary matrix rank inequality gives
Normalizing a nonzero branch multiplies by a scalar and therefore leaves its matrix rank unchanged.
Now refine a complete LOCC transcript to record every individual Kraus operator. Although later choices depend on the earlier classical outcomes, fixing a transcript fixes all those choices. Composing the local operations therefore gives a single product Kraus operator in that branch. Each nonzero branch obeys the same Schmidt-rank contraction under product operators. Local auxiliary systems prepared independently are included by local isometries and do not add entanglement. Discarding a local auxiliary system is included by resolving its partial trace in an orthonormal basis; this again yields refined product Kraus operators.
If the protocol produces a specified pure state deterministically, its output density operator is a sum of positive rank-one branch density operators. Every nonzero branch vector must be proportional to that output vector: its squared overlap with any vector orthogonal to the output sums to zero, so each such overlap is separately zero. Thus the output Schmidt rank equals that of each surviving branch, and
This proves monotonicity of Schmidt rank under LOCC, even for a nonzero branch selected by postselection. If the classical transcript is instead discarded and the result is mixed, the refined branch vectors supply an ensemble with Schmidt ranks at most ; by definition its Schmidt number is at most . This is the correct mixed-state extension, rather than a bound on the ranks of its reduced density matrices. In finite dimensions, any limiting exact protocol obeys the same pure-state bound because the set of coefficient matrices of rank at most is closed, being defined by vanishing minors.
Yes: a deterministic LOCC protocol exists for every allowed value of the parameter. Here is an explicit implementation, so existence does not depend on merely quoting a pure-state conversion theorem.
First convert the input Bell state to by local unitary operations:
Write and . Alice performs the two-outcome measurement in quantum mechanics with Kraus operators
They define a physical measurement in quantum mechanics because
Acting on , the unnormalized branch vectors are
Both branches have probability . Alice communicates the outcome to Bob. If it is one, both apply the Pauli X gate; this turns the normalized second branch into . If it is zero, neither applies this correction. Finally Bob applies a Pauli X gate in either branch, obtaining
Every outcome produces the same target pure state, so this is deterministic local operations and classical communication, not a successful branch selected by postselection. This two-outcome LOCC dilution of a Bell pair remains valid at , where the output is a product state, and at , where it is another Bell state.
The target Schmidt coefficients are , while those of the input are both . For an interior value , local unitary operations alone could not change these Schmidt coefficients; the local measurement in quantum mechanics is the step that reduces the entanglement.
Diagonalize the reduced density matrix on Alice's Hilbert space:
For every positive eigenvalue, define a vector on Bob's Hilbert space by
The definition of the partial trace gives
Thus the are orthonormal. Extend the to an orthonormal basis of Alice's Hilbert space. If lies in the zero-eigenvalue subspace of , then
There is therefore no component of in those additional basis directions. Expansion in Alice's orthonormal basis yields the Schmidt decomposition
Its positive Schmidt coefficients are and its Schmidt rank is . Taking the two partial traces and using the orthonormality of both families gives
Hence the two reduced density matrices have exactly the same nonzero eigenvalues, including multiplicities. Their numbers of zero eigenvalues may differ when the local Hilbert spaces have different dimensions. In particular their Von Neumann entropies agree.
Let a density operator on a Hilbert space have the spectral decomposition
Introduce an auxiliary Hilbert space with an orthonormal basis containing vectors , and set
This vector has norm one. Its partial trace is
This explicitly constructs a purification of a density operator. The same construction works for an arbitrary trace-class density operator: its nonzero eigenvalues form a finite or countable summable family, and the displayed vector converges in the Hilbert space norm. The entropy inequality below is understood with finite Von Neumann entropies, avoiding undefined differences of infinities.
Apply this construction with to obtain a joint pure state on . The Schmidt decomposition across , and respectively gives
Now apply Subadditivity of Von Neumann entropy to the reduced density matrices on and :
These inequalities say and . Replacing by proves the Araki–Lieb inequality:
The subadditivity used here concerns the actual reduced density operators, rather than statistical independence. In particular it follows from nonnegativity of quantum relative entropy, since
and similarly for . Thus no independence assumption on the purification of a density operator is needed.
Use base-two logarithms for Von Neumann entropy, so the units are bits, and adopt . All systems here may be taken finite-dimensional; the entropy arguments also apply when the displayed Von Neumann entropies are finite. The density operator of the joint pure state is . It is a rank-one orthogonal projector, whose only nonzero eigenvalue is one. Consequently
The reduced density matrices are and . The quantum conditional entropy is defined by the entropy difference
For the pure state under consideration this becomes . To determine when it is negative, write the Schmidt decomposition
The eigenvalues of are the , together with possible zeros. Each contribution is nonnegative, and their sum vanishes exactly when one eigenvalue equals one. Equivalently the Schmidt rank is one and is a product state. If the pure state is entangled, then , every nonzero eigenvalue is strictly below one, and the Von Neumann entropy is strictly positive. Thus the pure-state negative conditional entropy criterion gives
The purity assumption matters: for mixed density operators, negative quantum conditional entropy is not necessary for entanglement.
For the amount of work offered by one flow in a time interval of length , its effective bandwidth at parameter and timescale is
Its units are work per unit time. The parameter measures the price placed on bursts: a stringent rare-overflow target generally requires a larger value of than a loose target. The timescale describes the duration of the congestion episode. When the limit exists, write
This is the long-time effective bandwidth. It includes a burstiness cost, rather than just the mean offered rate. For a finite-time flow with the required moments, , and effective bandwidth is increasing in . If is bounded, its limit as is the essential supremum of that interval's input rate, the peak-rate limit. The analogous long-time mean limit requires the usual interchange or regularity assumptions.
For independent flows their cumulant-generating functions add, so
The Chernoff bound therefore gives, for any in the common domain,
Optimizing over produces the relevant Legendre-Fenchel transform. The Cramér theorem states that sample means of independent and identically distributed inputs whose moment-generating function is finite near zero have a large deviation principle, with rate function equal to the Legendre-Fenchel transform of their cumulant-generating function. More generally, the Gärtner–Ellis theorem applies to a convergent scaled log moment-generating function when zero lies inside its domain and the limit is lower semicontinuous and essentially smooth. It gives the same transform as a good rate function. A sample-path version, together with the contraction principle for large deviations for the queue workload, translates input deviations into overflow deviations. The compact-time and infinite-horizon continuity/tail hypotheses must be checked for the chosen traffic model.
A particularly useful rigorous queue bound holds for inputs with stationary increments and independent increments, such that . If , then
is a nonnegative supermartingale, since its conditional increment factor is . The maximal inequality for a nonnegative supermartingale on , followed by , gives the continuous-time exponential workload bound
Here is the stationary queue workload of the stable infinite-buffer queue, represented by input from the past. This directly bounds the supremum over time; applying a one-time Chernoff bound alone would not establish it.
For a nonzero Compound Poisson process with bounded positive packet sizes and mean input rate less than , a positive root of exists and is unique. Here the root theorem can be made explicit:
The upper bound was just proved. For the lower bound, use exponential tilting with density at time . Under the tilted law the net input has positive mean drift , by strict convexity and the positive-root equation. The strong law of large numbers then makes the first crossing time finite almost surely under that law. Its overshoot is at most . Changing measure at , first on and then letting , gives
Dividing the logarithmic bounds by proves .
Thus the familiar admission rule compares with , choosing from the desired buffer-tail exponent. For more general inputs, a logarithmic root theorem requires its own light-tail and renewal or sample-path hypotheses; the displayed supermartingale upper bound needs only the moment and increment assumptions stated above.
Write . The answer is
The sum of exponential variables with linearly increasing rates has the distribution of the maximum of independent rate- exponential random variables. To prove this identity, start independent rate- exponential clocks. The first rings after a rate- exponential time; the memoryless property leaves fresh independent clocks. Repeating this argument shows that the successive order statistic gaps are independent, with rates . Their sum has the distribution of . Therefore
For , , and hence
If , subtracting the two tails gives the interval exponent , since the tail at is exponentially smaller. Also , so the Markov inequality gives in probability. Local lower bounds at positive points and at zero follow; the tail estimate gives the closed-set upper bound exactly as in part (a). This proves the full large deviation principle.
There is also a deduction from part (b). For fixed and , a rate- exponential random variable is stochastically smaller than a rate- one. Coupling by the same uniform variables therefore gives with independent additional copies. For fixed and sufficiently large , the upper-tail exponent from part (b) is . Let to obtain ; the lower tail estimate matches it. The exact maximum identity additionally supplies all local lower bounds.
Interpret the additional copies in as independent of the initial , as well as of one another. Set . The Cramér theorem for rate- exponential random variables gives the rate function
Indeed their cumulant-generating function is for , and the maximizer in its Legendre-Fenchel transform is . For , replacing summands by does not change either the speed or this rate function. One can also see this directly from and the Gärtner–Ellis theorem.
The product large-deviation principle, followed by the contraction principle for large deviations under addition, now gives
For this is the minimum over of
If , its derivative with respect to is . Hence the optimum is , and
The two expressions agree at the transition and have the same derivative . The minimum rate zero occurs at the typical value . If , the minimand is , decreasing in , so instead
These are good rate functions. The affine branch for is the slow exponential plus an exponential sample mean mechanism: the bulk ceases to carry additional excess, which instead comes from . In particular, blindly applying the full Gärtner–Ellis theorem to the combined sum would be unjustified. Its limiting cumulant-generating function is only for , with a finite boundary slope when ; essential smoothness fails. The product and contraction argument proves the missing lower bounds.
The printed mean is , so has exponential distribution of rate . Let , with fixed . Then
Here is a direct proof, which also identifies the exceptional role of the slowest exponential clock. For , independence and the moment-generating function give
Letting proves the tail upper bound . For a local lower bound at , fix and with ; for this probability is one. For large , the event
puts in . Its logarithmic probability divided by tends to . Shrinking gives the local lower bound . At zero, almost surely and neighborhoods have probability tending to one.
For any closed set excluding zero, its nonnegative part is bounded away from zero; the tail upper bound applies at its infimum. Sets outside the support have probability zero. Together with the local lower bounds this proves the full large deviation principle, with a good rate function. Equivalently, the product large-deviation principle for the fixed vector and the contraction principle for large deviations minimize subject to and ; all the excursion is assigned to .
Use the large-deviation speed from part (a). For every , the Chernoff bound for a normal distribution gives, for all sufficiently large ,
Consequently
because the exponent has order , exceeding by a factor . Thus and satisfy exponential equivalence. This conclusion does not require independence between and , since their difference is exactly .
The exponential equivalence theorem transfers the large deviation principle and its good rate function, giving
Large positive excursions are cheapest through the single exponential random variable; a negative excursion would require the Gaussian random variable sum to move on its faster scale. If , the deterministic shift gives the same conclusion directly.
Assume ; otherwise the scaled sum is deterministic and no nontrivial rate function is possible. The sum has normal distribution . For , use the faster large-deviation speed . The moment-generating function of a normal distribution yields
The limiting cumulant-generating function is finite and differentiable on all of , hence satisfies the Gärtner–Ellis theorem. Its Legendre-Fenchel transform is obtained by maximizing , whose maximizer is . Thus
The drift disappears because the scaled mean is . The rate function is nontrivial and good. The corrected scaled cumulant-generating function used here contains an expectation; the corresponding formula in the paper's reference material omits it.
Write and assume . The large-deviation speed is , and the answer is
Here and below a large deviation principle at speed means the open-set lower bound and the closed-set upper bound . The displayed rate function is nontrivial and is a good rate function.
For , the exponential distribution gives
Shrinking an interval about any supplies the local lower bound ; neighborhoods of zero have probability tending to one. Every open set intersecting the nonnegative half-line contains one of these neighborhoods, giving the open-set bound. If a closed set contains zero, its upper bound is just . If it meets but excludes zero, closedness gives , and . A closed set disjoint from the support has probability zero. This proves the full large deviation principle, including the boundary at zero.
The fixed exponential tail explains the speed: an excursion of size costs . The full Gärtner–Ellis theorem is unnecessary here; the limiting cumulant-generating function is flat on and infinite at , so it fails the theorem's essential smoothness hypothesis.
Disjoint time strips of the Poisson random measure are independent, and its intensity is translation invariant in time. The construction and its limits therefore give independent increments and stationary increments, with
For the scaling actually printed in the original PDF,
For example, , , gives rather than . Thus the requested equality of process laws is false unless .
The intended self-similarity of a Cauchy process rescales space and time in opposite directions:
Indeed, for ,
The transformed process retains independent increments. For any ordered times, the joint characteristic function of its successive increments is therefore the same product as for ; cumulative summation proves equality of all finite-dimensional distributions. Both constructions have càdlàg paths, so these distributions also determine their laws on the usual path space. This derives the corrected invariance and explicitly diagnoses the false printed assertion.
For a finite-intensity Poisson random measure, independence of counts gives the exponential characteristic function formula. Apply it to the cutoff construction from part (a), including the deterministic compensation, and pass to the L2 space limit of the small jumps. The compensated integrand is at zero and bounded on the large-jump region, so its integral converges absolutely:
Symmetry makes the absolutely integrable imaginary part zero. Substituting in the real part and using the specified normalization gives
Thus , and this construction is the standard Cauchy process. To calculate the density, its integrable characteristic function permits Fourier inversion:
This is the standard Cauchy distribution. The normalization also gives : integration by parts turns into . For completeness, with exponential damping the latter integral equals , because its derivative in frequency is and its value at is zero. Let ; integration by parts bounds the undamped and damped tails uniformly by a constant divided by the lower cutoff, justifying the limit.
For , define the compensated small-jump Poisson integral
This is an ordinary compensated finite-intensity sum. Independent Poisson random variables give mean zero and the L2 construction of compensated Poisson integrals gives, for ,
Thus is Cauchy in L2 space as , defining the first integral. It is not the difference of two separately convergent integrals. On a compact time interval , the Doob L2 maximal inequality bounds the squared supremum of the same difference by . Hence the truncated martingales are Cauchy in the expected squared supremum norm. A sufficiently rapidly decreasing sequence of cutoffs converges uniformly almost surely; its limit has càdlàg paths, so the construction also supplies a consistent process.
For large jumps, . There are only finitely many such atoms before any fixed time, almost surely, and each atom has a finite mark. The uncompensated large-jump integral is therefore a finite random sum, even though its absolute first moment is infinite. The two terms are well-defined for these different reasons.
There is also a literal signed-integral defect in the PDF: on either symmetric region is not . Its positive and negative parts both have infinite mass, so the ordinary signed Lebesgue integral is undefined. The correct divergence statement is
A symmetric principal value may be zero, but is not an ordinary signed integral. Square-integrable compensation defines the small jumps; finite activity defines the large jumps.

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