The terminal term is the objective reward. With the Hilbert-Schmidt inner product , a Hermitian target observable gives its final expected value. The vector is the density operator represented as a vector in operator space; it retains the same physical content as the density matrix, not a wavefunction of the system.
The term imposes the dynamical equation by a time-dependent costate . It is a Lagrange-multiplier operator in the same operator space, propagated backward from a terminal condition. It is not required to be a positive, trace-one density matrix. Define
Then the enforced state equation is . The uncontrolled coherent part is , the dissipative contribution is , and each describes a control coupling. For Quantum Hamiltonian control, .
The term is a quadratic field-energy or fluence penalty. For the positive scale and positive weights , larger make a given control amplitude more costly. Thus maximizing trades terminal performance against control fluence while enforcing the dynamics. The multiplier term vanishes on any dynamically feasible trajectory. The weights do not represent decoherence rates; they specify control-resource preferences.
The Kraus operators of the generalized measurement postulate must obey
For a normalized pure state, the Born rule gives the outcome probability and the normalized conditional state:
Here the dagger denotes the Hermitian conjugate. Completeness ensures . An outcome with never occurs for that input, so no conditional state is required there. The positive operators form a POVM, but the actual operators also specify the post-measurement states.
Let be the initial joint density operator, and its reduced density matrix on the accessible subsystem. If the first experimenter performs the measurement, the conditional joint state for outcome is . The second experimenter does not know that outcome. The relevant nonselective quantum measurement state is therefore the probability-weighted average
To compare the accessible states, take any operator on the second subsystem. Cyclicity of the trace and the fact that operators on different tensor factors commute give
By the defining property of the partial trace, this says for every . Matrix units, or arbitrary Hermitian test operators, distinguish any two different density matrices, so
This proves remote state invariance under a local trace-preserving operation directly from completeness.
In particular, if the accessible experiment has POVM elements , its probabilities are whether the distant measurement happens or not. Attaching an independent local ancilla, evolving locally, or performing a sequence of local measurements cannot help: these operations act on the identical input density operator and therefore give identical outcome distributions. No experiment confined to the second subsystem can distinguish whether the unannounced measurement occurred. This is a derivation of the no-communication theorem, not an appeal to a signalling postulate.
The qualification is that the outcome is not communicated. A selective quantum measurement can give different conditional remote states, as happens when measuring one half of a Bell state; their probability-weighted average is still . An observer supplied with the distant outcome has extra classical information and is no longer restricted to the unannounced local experiment considered here.
Use base-two logarithms, so entanglement entropy is measured in bits. Write for the binary entropy, with . Taking a partial trace over any two parties removes the off-diagonal terms: the two traced strings are orthogonal. Consequently all three one-party reduced density matrices of the first pure state are
Each division into two groups is one party versus the other two. The Schmidt coefficients are and , so the entanglement entropy across each of , and is . For the second pure state, set : every one-party reduced density matrix is , and all three entanglement entropies are one bit.
For every pair , the first pure state instead gives the reduced density matrix
This is a separable quantum state, explicitly a convex combination of two product states. Its relative entropy of entanglement is therefore zero: in , choose to attain zero, while nonnegativity of quantum relative entropy excludes a negative value. The same argument with equal weights applies to the second pure state. Thus
The pairwise density matrices contain classical correlations, despite the entanglement of the global pure state; discarding a party loses the coherence between its two branches.
The entanglement entropy of independent source copies across any cut is , whereas copies of the target GHZ state have entanglement entropy . Average monotonicity of pure-state entanglement entropy under LOCC gives for exact successful forward branches. In a reversible asymptotic conversion the reverse direction similarly prevents a first-order deficit, since . For asymptotically faithful outputs, a continuity bound for quantum conditional entropy with trivial conditioning changes these inequalities only by . Hence the reversible leading-order rate is
The zero pairwise relative entropies of entanglement are consistent with this conversion: no independent pairwise resource has to be supplied or removed.
There is a qualification to the literal finite-block formulation in the source. For , the Schmidt rank of the exact state of source copies is , whereas target GHZ states have Schmidt rank . Every refined LOCC branch acts by a product of local linear operators and cannot increase this Schmidt rank. For , the displayed rate has for sufficiently large blocks when , so an exact successful reverse conversion is impossible, irrespective of its claimed probability. The exact dilution obstruction from Schmidt rank is avoided in the usual asymptotic formulation by allowing outputs approaching the desired pure state. The leading-order rate above and the exact forward protocol below remain valid; neither establishes the source's stronger exact round-trip claim. At the two states are identical. At or , the source is a known product state, the rate is zero, and local preparation supplies any desired number of source copies.
Use base-two logarithms throughout, so classical rates are measured in bits and quantum compression rates in qubits. A memoryless classical information source is a sequence of independent and identically distributed random variables on a finite alphabet , with fixed probability mass function . A length- word has probability , and the one-symbol Shannon entropy is , with .
For , the typical set is
This is weak typicality: it constrains the normalized self-information, not each empirical symbol count separately.
The typical sequence theorem gives the following three facts for fixed . The probability tends to one; each word in the set has probability between and ; and, once the set has probability at least ,
The concentration assertion follows from the weak law of large numbers applied to the iid information variables , whose finite-alphabet mean is . The probability bounds are the definition of typicality exponentiated. Summing the lower bound over the typical words and using total probability at most one proves the cardinality upper bound; summing the upper bound and using total typical probability at least proves the lower bound.
Fix and choose . Enumerate all words in and assign a distinct fixed-length binary index to each. Reserve one more index as a failure symbol for every atypical input. For all sufficiently large ,
so these indices can be transmitted using bits. The decoder inverts the typical-word enumeration; on the failure index it returns any fixed word. This describes both the compressor and decompressor, and its block error probability obeys
Its rate tends to bits per symbol. Thus every permits reliable fixed-rate compression, with no claim that atypical words are reconstructed correctly.
For the memoryless quantum information source, the average one-use density matrix is
Its trace is one and determinant , so its two eigenvalues are
The source-coding limit in Schumacher compression is the Von Neumann entropy of this average state: every larger qubit rate allows asymptotically faithful recovery of the emitted states, and a smaller rate cannot do so. Applying that limit gives
where is the binary entropy. The quantum typical subspace of has dimension about and carries asymptotically all source weight, which explains the compression rate. The entropy of the classical emission label is one bit; it is not the quantum rate because the two emitted pure states are nonorthogonal.
For probability distributions and on a finite alphabet, their classical relative entropy in bits is
A zero- term contributes zero, including when ; a term with and makes the result . In that infinite case nonnegativity is immediate. Otherwise on the support of . For every , : the function has derivative and its minimum zero at . Apply this with to obtain
The last inequality uses normalization of . Thus . Equality requires wherever and no -mass outside that support, hence occurs precisely when .
For density matrices, use
when the support of a positive operator is contained in that of , and set it to otherwise. The data-processing inequality for quantum relative entropy states that for any quantum channel ,
Thus the relative entropy of the two output states cannot exceed that of the inputs.
For the states with a classical flag, omit indices of weight zero. On a positive-weight block, the matrix logarithms obey
on the relevant supports. The logarithms of cancel. Taking the trace block by block therefore gives the relative entropy of classically flagged states:
If support inclusion fails in a positive-weight block, both sides are infinite. A zero-weight block makes no contribution, even if its unweighted relative entropy is infinite.
Tracing out the flag is a quantum channel with operators , since . It sends the two flagged states to and . Applying the data-processing inequality for quantum relative entropy to this partial trace proves joint convexity of quantum relative entropy:
For a bipartite state, set and . Its quantum mutual information is
where is the Von Neumann entropy. The support of lies in . To justify this when marginals are singular, let project onto . Then ; positivity implies . Applying the same argument on proves the claimed support inclusion.
On that support, product eigenvectors show
The definition of the partial trace therefore gives
Consequently .
For completeness, nonnegativity of quantum relative entropy also follows from the classical proof above. Diagonalize in a basis , with eigenvalues , and put . These are two classical probability distributions. Scalar concavity of the logarithm applied to the spectral weights of gives whenever and support inclusion holds. Hence
The support-failure case is again infinite. Applying this to the product of the marginals proves without requiring an additional entropy inequality.
Take the vectors in the quantum state ensemble to be normalized, with and . The corresponding density matrix is
Each rank-one projector is a self-adjoint operator, so . For every in the Hilbert space,
proving that is positive semidefinite. The trace is .
Conversely, diagonalize a self-adjoint operator in an orthonormal eigenbasis, writing . Its positive semidefiniteness implies , and its unit trace gives . Thus is a quantum state ensemble with precisely this density matrix. Terms with zero eigenvalue may be omitted. This argument includes rank-one pure states; an ensemble representation need not describe a genuinely mixed state.
The stated condition is the definition of an extreme point in the convex set of density matrices. Suppose first that with , and consider any convex combination with all . For every orthogonal to ,
Every term is nonnegative, so for each . To see that this implies , expand , . The equality implies for every , which kills . Thus each density matrix vanishes on . By self-adjointness its range lies in the line , so . Its unit trace forces , establishing the required purity.
Conversely, suppose is not rank one. In its spectral decomposition, at least two eigenvalues are positive. Select a normalized eigenvector with positive eigenvalue ; then . Define
The remaining eigenvalues show that is a density matrix. The decomposition is a convex combination of two different density matrices, neither equal to . This violates the given purity condition. Hence the extreme points of the density-operator state space obey
Let and choose an orthonormal basis of . The reduced density matrix on is the partial trace
Here is the identity on , and the bras and kets in the sum contract only the second tensor factor. Equivalently, if , then . The definition is independent of the chosen basis: it is characterized by for every operator on .
The generalized measurement postulate takes to be operators on satisfying . The Born rule and the conditional state update give
If the outcome is not supplied to , the appropriate post-measurement density matrix is . For any local operator , cyclicity of the full trace gives
Since this holds for every , . This is the no-communication theorem.
The invariance concerns the nonselective measurement in quantum mechanics. A conditional reduced density matrix can change, although . For example, measuring one half of a Bell pair in the computational basis changes the other half conditionally to or ; before learning the outcome, its density matrix remains . Thus distant measurement in quantum measurements cannot transmit a controllable signal without classical communication. This quantum no-signalling is compatible with special relativity, even though some entangled states have correlations incompatible with a local hidden-variable theory.
A secure key can be produced, at one ideal secret bit per copy. Denote Alice's additional flag qubit by . Alice can measure in the computational basis and, when its outcome is , apply the Pauli Z gate to her half of the shared pair. The two flag outcomes each have probability , and ; either branch therefore supplies the same pure Bell pair.
Equivalently, Alice applies the local controlled unitary
This local flag correction of a Bell-state phase mixture changes the full density matrix into
The corrected pair is pure, so every purification factors between and . Eve may know the flag without knowing the key bit obtained from . Alice need not disclose the flag, but even disclosing it does not compromise the corrected pure Bell pair. Tracing out the flag before correction would give the nonprivate mixture in the preceding case; retaining Alice's local side information is essential.
Impossible to implement as written: Bob is never given the basis string. Step 7 requires him to know which incoming qubits were acted on by a Hadamard gate, but the announcement contains only the check positions. Since , knowing that a transformation is its own inverse does not identify which qubits need it.
Bob cannot recover the missing information from the qubits alone. For each encoded Bell pair, his reduced density matrix is
for either or . His entire received register has the same density matrix for every string , so every local measurement in quantum mechanics has statistics independent of . Nor can one fixed unitary undo both possibilities: preserving requires that unitary to be proportional to , whereas decoding requires it to be proportional to . Supplying the missing basis announcement after receipt would repair the protocol and make it the third one, but that communication is absent from the printed sequence.
Photon polarization 2026-10-14
For a photon in a fixed spatial mode, the two transverse photon polarizations span a qubit space. A pure photon polarization state is with , and a general state is a two-dimensional density matrix. Its Bloch vector gives the normalized Stokes parameters. Polarization-dependent path separation can correlate this internal degree of freedom with a path qubit.
// Target: quantum-error-correction.bigb
A 2018 photonic experiment makes the distinction between populations and quantum coherence controllable. A 400-nm laser pumped a crystal to generate paired photons, filtered near 800 nm. One photon triggered collection; the other entered the apparatus. A half-wave plate and polarizing beam splitter selected horizontal photon polarization; another half-wave plate prepared balanced quantum superpositions. Separated polarization paths and diffraction gratings let a spatial light modulator control their frequency-dependent quantum phases and spectral weights. Recombined paths passed through quartz plates whose adjustable thickness controlled polarization–frequency coupling. Quarter- and half-wave plates plus a polarizing beam splitter selected tomography bases; jointly registered photodetector events supplied the readout. Quantum state tomography inferred polarization density matrices at each thickness. The dephasing model preserves diagonal populations while changing off-diagonal quantum coherence. Here the unobserved photon frequency acts as the environment for the polarization qubit. Finite modulator resolution and imperfect spectral shaping limited agreement with the intended dynamics; this experiment does not establish exact preparation or the ideal probabilities above. [ref]
Write each pure density matrix as . The trace identities of the Pauli matrices, and , make the trace of their product equal to the displayed overlap. Antipodal unit vectors represent orthogonal states; vectors at right angles correspond to squared overlap one half. For mixed states the same trace formula gives Hilbert–Schmidt overlap, not in general quantum fidelity.
Quantum state Created 2026-09-24 Updated 2026-10-14
A quantum state describes a preparation through its predicted measurement in quantum mechanics probabilities. In the Hilbert space formulation, a pure state is a quantum state ray: a normalized vector representative satisfies , and representatives differing by a global phase describe the same quantum state. [ref]
Both pure states and mixed states are represented by a density operator on the chosen complex Hilbert space:
Thus is Hermitian, positive semidefinite and of unit trace; in infinite dimension it must also be a trace-class operator. For a normalized pure state, is a rank-one orthogonal projection. A mixed state has no single such vector representative. Its density matrix is the matrix of in a chosen orthonormal basis. [ref] For a discrete POVM with effects and , the Born rule reads
These constraints and Born rule probabilities describe arbitrary finite-dimensional preparations. [ref]
Randomly choosing normalized pure states with probabilities and forgetting the label gives
This quantum state ensemble averages probabilities; a quantum superposition adds probability amplitudes. Several ensembles can give the same density operator. Quantum entanglement can make a reduced density matrix mixed while the joint quantum state is pure. [ref]
The preparation, the choice of basis, and the measurement are separate ingredients. A wavefunction is the position representation of a pure state; a general mixed state requires a density operator. For a closed quantum system, a unitary operator evolves it as , preserving its eigenvalues and purity of a density operator. [ref] The Bloch sphere and Bloch ball give the qubit geometry; quantum state tomography connects repeated preparations to an estimated density matrix; projective measurement treats the conditional state after an outcome.