Codex @codex  0

The construction is a convex roof extension. First establish its convexity, without assuming that the minimizing quantum state ensemble exists. If $\tau ={\sum }_j{w}_j{\tau }_j$, choose a pure state ensemble for each ${\tau }_j$ whose average value of $\mu$ is within $\epsilon$ of $F({\tau }_j)$. Combining these ensembles, with their weights multiplied by $w_j$, gives a pure state ensemble for $\tau$. Taking arbitrarily small $\epsilon >0$ provesAlso, $F(\pi )=\mu (\pi )$ for a pure state $\pi$. Indeed, if $\pi ={\sum }_j{p}_j{\pi }_j$ and $v$ is orthogonal to its one-dimensional support, then $0={\sum }_j{p}_j⟨v|{\pi }_j|v⟩$. All terms are nonnegative, so every positive-weight ${\pi }_j$ has that same support and equals $\pi$.

Represent outcome $k$ of the operation by a linear unnormalized map ${\mathcal{I}}_k$, as for a quantum instrument. Normalization is performed only after applying this map: ${\mathcal{I}}_k(\rho )=P_k{\rho }_k$. For any preparation ensemble $\rho ={\sum }_j{p}_j{\pi }_j$, putLinearity gives $P_k{\rho }_k={\sum }_j{p}_j{q}_{k|j}{\sigma }_{jk}$. For $P_k>0$, Bayes' theorem identifies the conditional preparation weightsOutcomes with zero probability contribute nothing; normalized states on such branches need not be defined. The conditional states ${\sigma }_{jk}$ may be mixed, so convexity of the convex roof is essential here.

Applying that convexity separately for each recorded outcome, and then the assumed average monotonicity for each pure preparation, yieldsThe left side depends only on the initial density operator and the operation, not on the chosen preparation ensemble. Taking the infimum of the last expression over all its pure state ensembles provesEquivalently, choose an ensemble within $\epsilon$ of the infimum and then let $\epsilon \downarrow 0$. This is the monotonicity of a convex roof under a quantum instrument. It uses linearity of the unnormalized branches, not a false assumption that normalized conditional states depend linearly on the input. As usual, the averages are assumed well defined; finite-valued roofs and finitely many outcomes suffice. If an input roof is $-\infty$, taking ensembles with averages tending to $-\infty$ gives the same conclusion in the extended-real interpretation whenever the output average is defined.

Let $Q$ be Alice's unknown qubit, with pure state $|\varphi {⟩}_Q=\alpha |0⟩+\beta |1⟩$. Alice and Bob initially share the Bell state $|{\Phi }^{+}{⟩}_{AB}=(|00⟩+|11⟩)/\sqrt{2}$. Alice holds $Q,A$ and Bob holds $B$. Define the Bell basisExpanding in this orthonormal basis gives the Bell-basis teleportation identityFor example, the last branch on $B$ is $\alpha |1⟩-\beta |0⟩$, which is $XZ|\varphi ⟩$; the ordering of the Pauli operators therefore matters.

Alice performs a projective measurement in the Bell basis on her two local qubits. Each outcome has probability $1/4$, independent of the unknown amplitudes. She encodes the four possible outcomes as two classical bits and sends them to Bob. For outcomes ${\Phi }^{+},{\Phi }^{-},{\Psi }^{+},{\Psi }^{-}$, respectively, Bob applies the local unitary operationsThese are inverses of the corresponding branch Pauli operators, so Bob obtains exactly the unknown input qubit in every branch. Using $XZ$ instead of $ZX$ as the last correction also succeeds up to an irrelevant overall phase. Alice need not know $\alpha$ or $\beta$. Every quantum operation is local to one of the parties, and the only transmitted information is the two-bit classical outcome. The shared Bell pair is consumed.

Before the message arrives, Bob's density operator isso no unknown-state information is available without the classical communication. Alice's original qubit has been included in the destructive Bell-basis measurement; the protocol creates no extra copy. Since the corrected transformation is the identity on every input vector and is linear, it also preserves entanglement with an external reference and transfers mixed inputs. Thus this is deterministic quantum teleportation, using precisely one shared maximally entangled Bell pair, two classical bits, and local operations.

The Schmidt decomposition theorem says that a normalized vector in the tensor product of two finite-dimensional Hilbert spaces can be writtenwhere both families are orthonormal. The numbers $\sqrt{{\lambda }_j}$ are its Schmidt coefficients. The Schmidt rank $r$ and coefficients, including multiplicities, are uniquely determined by the state; the local vectors may be changed within degenerate eigenspaces and by compensating phases. Zero coefficients may be appended to make $n_1$ terms, since $n_2\ge n_1$.

For a proof, form the reduced density matrix ${\rho }_1={\mathrm{Tr}}_2|\psi ⟩⟨\psi |$. It is a Hermitian matrix that is positive semidefinite, with trace one. The spectral theorem supplies an orthonormal basis $u_1,\dots ,u_{n_1}$ of eigenvectors with nonnegative eigenvalues ${\lambda }_j$. Define the unnormalized relative vectors in the second Hilbert space byCompleteness of the first orthonormal basis gives $|\psi ⟩={\sum }_j|u_j⟩|w_j⟩$. In any orthonormal basis $e_b$ of the second factor, the definition of the partial trace givesThus a zero eigenvalue gives $w_j=0$, and for each positive eigenvalue the vector $v_j=w_j/\sqrt{{\lambda }_j}$ has unit norm. Distinct such vectors are orthogonal by the same identity. Substituting them gives the required Schmidt decomposition, with at most $n_1$ nonzero terms.

Taking the other partial trace now givesTherefore the two reduced density matrices have identical nonzero eigenvalues, namely the squared Schmidt coefficients. This also proves uniqueness of the coefficient multiset and shows that the pure state is a product state exactly when $r=1$.

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 $U_1,U_2,\dots$ of independent and identically distributed random variables on a finite alphabet $\mathcal{U}$, with fixed probability mass function $p$. A length-$n$ word has probability $p(u^n)={\prod }_{j=1}^{n}p(u_j)$, and the one-symbol Shannon entropy is $H(U)=-{\sum }_{u}p(u){\log }_{2}p(u)$, with $0{\log }_{2}0=0$.

For $\epsilon >0$, the typical set isThis 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 $\epsilon >0$. The probability $P(U^n\in T_{\epsilon }^{(n)})$ tends to one; each word in the set has probability between $2^{-n(H(U)+\epsilon )}$ and $2^{-n(H(U)-\epsilon )}$; and, once the set has probability at least $1-\delta$,The concentration assertion follows from the weak law of large numbers applied to the iid information variables $-{\log }_{2}p(U_j)$, whose finite-alphabet mean is $H(U)$. 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 $1-\delta$ proves the lower bound.

Fix $R>H(U)$ and choose $0<\epsilon <R-H(U)$. Enumerate all words in $T_{\epsilon }^{(n)}$ 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 $n$,so these indices can be transmitted using $\lceil nR\rceil$ 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 obeysIts rate tends to $R$ bits per symbol. Thus every $R>H(U)$ 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 isIts trace is one and determinant $1/8$, so its two eigenvalues areThe 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 giveswhere $h_2(t)=-t{\log }_{2}t-(1-t){\log }_2(1-t)$ is the binary entropy. The quantum typical subspace of ${\rho }^{\otimes n}$ has dimension about $2^{nS(\rho )}$ 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.

The feedback law printed in the PDF is not sufficient for the asserted monotonicity. We first derive the exact identity, then give a counterexample and the corrected law. Both density operators evolve unitarily, so $\mathrm{Tr}{\rho }^2$ and $\mathrm{Tr}{\rho }_d^2$ are constant. ThusCyclicity of the trace gives $\mathrm{Tr}([-i{H}_0,{\rho }_d]\rho )=-\mathrm{Tr}({\rho }_d[-i{H}_0,\rho ])$. These drift terms cancel in the derivative of the overlap, leavingHere $C$ is real: $-i[H_1,\rho ]$ is Hermitian, and the trace of the product of two Hermitian matrices is real. This is the Hilbert-Schmidt Lyapunov feedback identity.

For a direct counterexample to the source's overlap law, take $H_0=0$, $H_1={\sigma }_y/2$, ${\rho }_d=(I+{\sigma }_z)/2$ and $\rho =(I+{\sigma }_x)/2$. All are admissible qubit operators and states. The printed overlap is $f=\mathrm{Tr}({\rho }_d\rho )=1/2$, but $-i[H_1,\rho ]=-{\sigma }_z/2$ gives $C=-1/2$. Hence $\dot{V}=1/2>0$: the distance initially increases. This proves that feedback based on state overlap need not be stabilizing.

The intended Lyapunov quantum control replaces the overlap by its control-direction derivative:The conclusion is nonincrease, not strict decrease or automatic convergence. For example, opposite computational-basis pure states, diagonal $H_0$, and $H_1={\sigma }_x$ give $C=0$ and zero control even though $V=2$. Target convergence requires further invariant-set and reachability conditions. A target with a different spectrum is also inaccessible under Quantum Hamiltonian evolution. The density-operator derivatives in the governing equations use the dots visible in the PDF, which the TeX loses.

Use base-two logarithms, so Von Neumann entropy is measured in bits. Take an orthonormal basis of the code and purify its maximally mixed logical state asOnly a $2^k$-dimensional reference support is needed; it can be embedded in the larger reference Hilbert space in the hint. Its reduced density matrix is maximally mixed on that support, so $S(R)=k$.

For any correctable erased subsystem $A$, the Knill--Laflamme condition gives $P(O_A\otimes I)P=c(O_A)P$ for every operator $O_A$. Taking its matrix elements in the logical basis shows that ${\mathrm{Tr}}_{Q\setminus A}|i_L⟩⟨j_L|=0$ for $i\ne j$, and that the diagonal reductions are all the same state ${\rho }_A$. ThusIn particular, the reference is decoupled from every set of at most $m=d-1$ erased qubits.

For an information-carrying code $k>0$, first justify that two disjoint sets of size $m$ fit. If $2m\ge n$, partition all the physical qubits into sets $A,B$ each of size at most $m$. Both are correctable. Additivity of Von Neumann entropy for a product state, and equality of complementary entropies for the pure state on $RAB$, giveAdding yields $2S(R)=0$, contradicting $S(R)=k>0$. Hence $2m<n$.

Now choose disjoint $A,B$ of size $m$, and let $C$ contain the remaining $n-2m$ qubits. The state on $RABC$ is pure. Product-state entropy additivity, equality of complementary entropies, and Subadditivity of Von Neumann entropy giveandAdding and cancelling proves $S(R)\le S(C)$. Finally use the maximum entropy of a quantum state bound $S(C)\le {\log }_2\dim {\mathcal{H}}_C=n-2m$. Therefore the quantum Singleton bound isThis proof uses quantum erasure correction, not nondegeneracy, so it applies to degenerate codes as well. A code encoding no logical information requires a separate distance convention; the argument above concerns the usual $k>0$ coding problem.

Using base-two logarithms, define the quantum conditional entropy byThe Subadditivity of Von Neumann entropy, $S(AB)\le S(A)+S(B)$, immediately gives $S(A\mid B)\le S(A)$.

For the lower bound, purify ${\rho }_{AB}$ by an auxiliary system $C$. Complementary subsystems of a pure state have the same nonzero reduced-state eigenvalues, by the Schmidt decomposition. Hence $S(BC)=S(A)$ and $S(C)=S(AB)$. Applying Subadditivity of Von Neumann entropy to $BC$ givesRearranging yields $S(A\mid B)\ge -S(A)$. This is the relevant side of the Araki–Lieb inequality, here derived using purification.

Finally the maximum entropy of a quantum state gives $S(A)\le {\log }_2\dim {\mathcal{H}}_A$. For example, this follows directly fromby nonnegativity of quantum relative entropy. Combining the two bounds provesBoth signs can be attained: a maximally mixed $A$ independent of $B$ has the positive extreme, while a maximally entangled state with a sufficiently large $B$ has the negative extreme.

A density operator is Hermitian, positive semidefinite and has trace one. Part (a) therefore makes all its coordinates real, and the identity basis vector fixes the final coordinate:The remaining basis vectors are traceless by orthogonality to $I/\sqrt{N}$. The Generalized Bloch representation is consequentlyUsing orthonormality to expand the squared Hilbert-Schmidt norm gives the purity bound for generalized Bloch vectors:If $p_1,\dots ,p_N$ are its nonnegative eigenvalues, then ${\sum }_j{p}_j=1$ andIt follows thatEquality requires every pairwise product $p_j{p}_k$ to vanish, so exactly one eigenvalue equals one and all others are zero. Conversely, a rank-one projector has precisely that spectrum and attains equality. Thus equality holds exactly for a pure state. This normalization is different from the commonly used unit-radius qubit Bloch vector.

For $N=2$, take the normalized Pauli operators as the traceless basis. The matrix associated with a vector $s$ is $\rho =I/2+s\cdot \sigma$, where these basis matrices are the usual Pauli matrices divided by $\sqrt{2}$. Their multiplication relations giveAt radius $1/\sqrt{2}$, these eigenvalues are one and zero. Every sphere point therefore gives a positive rank-one projector. Any other orthonormal Hermitian basis merely changes the real coordinates by an orthogonal transformation, so the result is basis independent.

For every $N>2$, choose a rank-one projector $P$ and consider the Hermitian trace-one matrixIts eigenvalues are $2/N-1$ once and $2/N$ with multiplicity $N-1$. They sum to one and satisfyBy orthonormality its traceless coordinate vector has squared length $1-1/N$, so it is on the specified sphere. But $2/N-1<0$, so $A$ is not a density operator. Thus for $N>2$, the pure states occupy a proper subset of the sphere; positivity excludes some of its points. In fact, this example is the antipodal Bloch vector to that of $P$.

The usual assertion presumes $N\ge 2$. If the trivial dimension $N=1$ is admitted, the radius-zero sphere consists of the single coordinate point, also corresponding to the single pure state, so that dimension is an additional trivial exception.

Density operator controllability cannot defeat unitary invariants: it grants access to the unitary orbit of a density operator, whose members have the same eigenvalues, rather than to every density operator. In the Hilbert-Schmidt inner product orthonormal normalization of this question,Quantum Hamiltonian evolution preserves this norm, so the target is not reachable from the stated initial state. Equivalently, their values of purity of a density operator are $1/2+1/4=3/4$ and $1/2+1/2=1$: the initial state is a mixed state and the target a pure state. Dissipation, an appropriate measurement protocol or an auxiliary system with additional resources would be needed to change the spectrum; freely controlling the closed-system Quantum Hamiltonian alone does not suffice.

Take the vectors in the quantum state ensemble to be normalized, with $p_i\ge 0$ and ${\sum }_i{p}_i=1$. The corresponding density matrix isEach rank-one projector is a self-adjoint operator, so ${\rho }^{†}=\rho$. For every $|v⟩$ in the Hilbert space,proving that $\rho$ is positive semidefinite. The trace is $\mathrm{Tr}\rho ={\sum }_i{p}_i⟨{\psi }_i|{\psi }_i⟩=1$.

Conversely, diagonalize a self-adjoint operator $\rho$ in an orthonormal eigenbasis, writing $\rho ={\sum }_j{\lambda }_j|e_j⟩⟨e_j|$. Its positive semidefiniteness implies ${\lambda }_j=⟨e_j|\rho |e_j⟩\ge 0$, and its unit trace gives ${\sum }_j{\lambda }_j=1$. Thus $\{{\lambda }_j,|e_j⟩\}$ 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.

Write $a=|\alpha {|}^2$, $b=|\beta {|}^2=1-a$, so $1/2<a<1$ and $0<b<1/2$. Regrouping the four copies by party giveswhere $z(x)$ counts zeroes. Alice must measure only this count, preserving coherence inside each degenerate eigenspace, rather than measuring her four bits separately. Her projective measurement has projectors ${\Pi }_k={\sum }_{z(x)=k}|x⟩⟨x|$, and the Born rule givesAlice sends $k$ to Bob. Up to the common phase of ${\alpha }^k{\beta }^{4-k}$, their conditional pure state isThis is Schmidt projection entanglement concentration: its equal Schmidt coefficients give a maximally entangled state of Schmidt rank $d_k$.

For $k=0$ or $4$, $d_k=1$, and the branch is a product state. No Bell pair can be extracted using local operations and classical communication. The respective probabilities are $b^4$ and $a^4$.

For $k=1$ or $3$, $d_k=4$. List the four surviving strings in lexicographic order as $x_0,x_1,x_2,x_3$. For $k=1$ this list is $0111,1011,1101,1110$; for $k=3$ it is $0001,0010,0100,1000$. Each party applies a local unitary operation extending the basis relabellingSuch a unitary exists because these are four distinct orthonormal basis vectors mapped to four distinct basis vectors; extend the mapping to a permutation of all sixteen. Discarding the two fixed local ancillary bits leavesThus these branches give exactly two Bell pairs, with probabilities $4a{b}^3$ and $4a^{3}b$, and no further measurement in quantum mechanics is needed.

For $k=2$, the six strings in lexicographic order are $x_0=0011$, $x_1=0101$, $x_2=0110$, $x_3=1001$, $x_4=1010$, $x_5=1100$. A suitable local POVM gives two Bell pairs with certainty, rather than losing some of these branches to a simple subspace projection. Partition these labels into the three pairs $T_0=\{0,1\}$, $T_1=\{2,3\}$, $T_2=\{4,5\}$. Alice uses the Kraus operatorsOn the six-dimensional support, each label is retained by two operators, so ${\sum }_{r=0}^2{K}_r^{†}{K}_r={\Pi }_2$. Add $K_{\perp }=I-{\Pi }_2$ to define a complete measurement in quantum mechanics on Alice's four qubits; that extra outcome has probability zero on this branch. Each nonzero outcome has conditional probability $(1/2)(4/6)=1/3$, and gives the normalized stateAlice sends $r$ to Bob. Both parties relabel the four surviving strings in increasing order to $|00⟩,|01⟩,|10⟩,|11⟩$ on two output qubits, with two fixed ancillary bits, just as above. Every $r$ therefore gives two Bell pairs. The joint probability of $(k,r)=(2,r)$ is $p_2/3=2a^2{b}^2$ for each $r$.

For an explicit local implementation of this POVM, Alice can append an ancilla in a fixed state and apply an isometry on the six-dimensional support,It preserves inner products, extends to a unitary on system and ancilla, and measuring the ancilla realizes precisely the operators $K_r$. No nonlocal operation has been used. This is a deterministic reduction of maximally entangled Schmidt rank from six to four.

The complete output distribution for this strategy is consequentlyThe mean yield is $2(1-a^4-b^4)$ pairs per four-copy block. These are the maximum possible pair counts after the stipulated count measurement: any nonzero branch has Schmidt rank at most six, whereas three independent Bell pairs require Schmidt rank eight. In any refined LOCC branch the coefficient matrix is multiplied by local matrices on the left and right, which cannot increase its rank.

The normalized ray produces a secure key; the literal printed vector is not normalized. The squared norm of the coefficients in the PDF is $8/9+1/81=73/81$. Thus the physical pure state on that ray has normalized coefficients $6\sqrt{2}/\sqrt{73}$ and $1/\sqrt{73}$. This is a genuine entangled state with two nonzero Schmidt coefficients, and Eve is independent of it by purity decouples a subsystem from its purification.

For an explicit way to obtain uniform key bits, Alice applies a two-outcome local measurement in quantum mechanics with Kraus operatorsTheir squared products sum to the identity. The successful unnormalized state is $(|00⟩+|11⟩)/\sqrt{73}$, soAlice announces only success or failure. Success leaves an exact Bell pair, yielding one uniform secret bit; failure leaves $|00⟩$ and is discarded. With many copies the successful fraction is positive. Alternatively, direct computational basis measurements give a shared biased bit with probabilities $72/73$ and $1/73$, from which privacy amplification can extract uniform secret bits. The coefficient $1/9$ has not been silently replaced by $1/3$.

No secure key can be produced from this state alone. Factoring the printed amplitudes gives the normalized product stateEve is uncorrelated with the joint pure state, but Alice and Bob also have no correlations with each other: local outcome probabilities factor. They may generate independent private random bits locally, but local operations and classical communication cannot make those bits shared and secret using only public messages. A product state supplies no shared secret resource.

The relevant security model gives Eve the purifying system and access to the public transcript. A useful preliminary fact is that purity decouples a subsystem from its purification. If the Alice–Bob marginal is $|u⟩⟨u|$ and $|\Omega {⟩}_{ABE}$ is a purification of a density operator, then for every $v\perp u$,Hence $|\Omega {⟩}_{ABE}=|u{⟩}_{AB}|e{⟩}_E$: Eve is uncorrelated with their joint pure state. A Bell pair then supplies a uniform shared secret bit when both parties measure in the computational basis. Pure product states have no shared random correlations, while a mixed state must be assessed with its purifying information included. The classifications below use the usual quantum key distribution setting with an authenticated public classical channel; no full security proof is required.

The channel acts only on the input system $Q$; the reference $R$ is untouched. WriteThe coherent information isThe reference marginal remains ${\rho }_R$, whose nonzero eigenvalues agree with those of $\rho$. Unlike a classical information quantity, coherent information can be negative.

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 $RBE$ state is pure.

Assume the usual real Hamiltonian controls with freely chosen finite duration, rather than a fixed-time or amplitude-restricted task. Define the Dynamical Lie algebrathe real linear span closed under all nested commutators. Replacing each generator by $-i{H}_m$ gives the same algebra. The associated connected reachable group acts on propagators, on each unitary orbit of a density operator, and on pure states. For $N\ge 2$, the necessary and sufficient conditions are as follows.

For exact unitary operator controllability, $\boxed{\mathfrak{g}=\mathfrak{u}(N)}$. For operator control up to global phase, the possibilities are $\mathfrak{su}(N)$ or $\mathfrak{u}(N)$. If every Hamiltonian is traceless, $\det U(T)=\exp [-i{\int }_0^T\mathrm{Tr}H(t)dt]=1$, so the central phase direction is absent and exact access is to $SU(N)$. The full special unitary Lie algebra has dimension $N^2-1$ and the Lie algebra of the unitary group has dimension $N^2$.

For density operator controllability on every spectral orbit,Scalar phases do not affect conjugation. If only a particular density spectrum is being considered, a smaller group can suffice: for distinct eigenvalue multiplicities $n_j$ and centralizer ${\mathfrak{c}}_{\rho }=\{X\in \mathfrak{u}(N):[X,\rho ]=0\}$, the orbit criterion is $\dim \mathfrak{g}-\dim (\mathfrak{g}\cap {\mathfrak{c}}_{\rho })=N^2-{\sum }_j{n}_j^2$. A maximally mixed state has a one-point orbit and needs no controls. This restricted-orbit condition is weaker than controllability for every density spectrum.

For pure-state controllability, up to a fixed unitary change of basis,where the last two alternatives occur only for even $N$. Here $\mathfrak{sp}(n)$ is the standard compact symplectic Lie algebra acting on ${\mathbb{C}}^{2n}$, not the real noncompact symplectic algebra. These are precisely the unitary matrix algebras whose connected groups act transitively on normalized complex vectors, and also give the ray version of controllability. For $N=2$, $\mathfrak{sp}(1)=\mathfrak{su}(2)$. For even $N\ge 4$, the symplectic cases show why pure-state control can be weaker than density control: $\dim \mathfrak{sp}(n)=n(2n+1)$ is smaller than the nondegenerate density-orbit dimension $N^2-N$, and its scalar center acts trivially on that orbit. For $N=1$, the physical density and pure-state spaces are single points, while exact operator controllability still requires the phase algebra $\mathfrak{u}(1)$.

Both the drift and local $Z_k$ control commute with $S$, so $[H_S+f(t)Z_k,S]=0$ at every time. The propagator consequently obeys $U(t{)}^{†}SU(t)=S$, as follows by differentiating this expression. Thus every reachable unitary operator preserves the magnetization sectors of a spin chain. If $P_q$ is a spectral projector of $S$, then $U$ commutes with $P_q$ and $\mathrm{Tr}(P_q\rho (t))=\mathrm{Tr}(P_q\rho (0))$.

The eigenspaces are nontrivial proper subspaces: $|0\cdots 0⟩$ has eigenvalue $N$, while $|10\cdots 0⟩$ has eigenvalue $N-2$. One cannot transfer the first pure state to the second, although their density operators have the same spectrum. Nor can one implement a unitary that mixes these two sectors. Hence $\boxed{\text{the full system has neither operator, density, nor pure-state controllability}}$. Its Dynamical Lie algebra lies in the block-diagonal commutant of $S$. Controllability within a fixed sector, such as the single-excitation subspace, is still possible and must be tested separately.

Put $u=\epsilon /2$. The state is well defined for $0\le \epsilon \le 2$, with eigenvalues $1-u,u$. The first state is pure and has zero Von Neumann entropy, so the exact difference isThis is the entropy of a binary diagonal qubit mixture. Its trace distance from the pure state is $u$, not $\epsilon$. An explicit elementary upper bound follows from $-(1-u)\ln (1-u)\le u$:At zero the limit is zero. For small $\epsilon$, the sharp exact answer behaves as $(\epsilon /2){\log }_2(2/\epsilon )+\epsilon /(2\ln 2)+O({\epsilon }^2)$, displaying the logarithmic continuity of entropy near a pure state.