For a bounded positive operator , the form is positive semidefinite and Hermitian. Expanding for complex and minimizing its quadratic polynomial gives the displayed inequality. If , varying along the negative direction of forces , covering the degenerate case. In particular implies , by testing against arbitrary .
For bounded positive operators satisfying the hypotheses, , so vanishes on the closure of the range of . The kernel of a sum of positive operators identity shows that it also vanishes on . Self-adjointness and the Hilbert projection theorem decompose the whole Hilbert space as that closed range plus that kernel. Thus . This proves the commuting case of uniqueness of a positive square root without using a spectral representation.
Expectation value Created 2026-09-24 Updated 2026-10-14
The expectation value of a quantum observable is the expected value of its measurement outcome random variable in a specified quantum state. It predicts the mean of outcomes from many identical quantum state preparations. It need not equal any one possible outcome: for a spin one-half particle, equal probabilities of and give mean zero even though zero is never an outcome of that spin component. Here is the reduced Planck constant.
Let be a Hermitian operator on a finite-dimensional Hilbert space, and let be a normalized pure state, . The spectral theorem writes
The are distinct real eigenvalues, are orthogonal projections onto their eigenspaces, and is the identity operator. For an ideal projective measurement of , the Born rule and the expectation value give
Thus the expectation value is a probability-weighted average of eigenvalues, including all vectors in a degenerate eigenspace in its . In an orthonormal eigenbasis, , this is , where repeated are allowed. The weighted average lies between the smallest and largest eigenvalues; it can lie in a gap between them. The statistical meaning and operator expression are connected in this way in the authored treatment of average energies.[ref]
If a nonzero vector has not been normalized, use ; the denominator is essential. A global phase cancels between the bra and ket, so and have the same expectation value and outcome probabilities.
The outcome variance measures the spread about this mean, whereas the quantum uncertainty is its standard deviation:
For a pure state, zero variance means that lies entirely in one eigenspace. That eigenspace need not be one-dimensional. Knowing only a mean generally does not determine the entire outcome probability distribution.
For a mixed state, the same formulas use its density matrix , a positive operator with trace one:
A pure state is the special case . For a quantum state ensemble , the expectation value is . This linearity is useful when preparations vary between trials; different quantum state ensembles can have the same density matrix.
These formulas require no operator-domain qualifications in finite dimension. For an unbounded self-adjoint operator, the spectral theorem instead gives a spectral probability measure; a finite mean requires an integrable absolute first moment, and finite variance requires a finite second moment. Writing as an operator inner product additionally requires in the operator domain of . The quadratic form of a positive quantum Hamiltonian explains the useful wider form-domain version.
Filtering preserves existing frustration freeness Created 2026-10-06 Updated 2026-11-05
If each local term is already minimized by the global ground state, subtract its minimum to obtain a positive operator. Nonnegative normalized spectral filtering of Hamiltonian terms preserves positivity and leaves the ground eigenvalue unchanged. Thus the same state minimizes every filtered term. This preserves frustration freeness but does not create it for an initially frustrated decomposition.
Frustration freeness 2026-10-06
A decomposition has frustration freeness when a global ground state minimizes every term simultaneously. For finite-dimensional Hermitian terms this implies . Shifting each term by its minimum produces positive operators with a common null vector. The property depends on the decomposition, not only the total operator.
Hermitian operator Created 2026-09-24 Updated 2026-10-14
A bounded operator on a real or complex Hilbert space is Hermitian, or self-adjoint, when . Equivalently,
Its directional values are real, since this identity makes equal its complex conjugate. Reality allows either sign; a positive operator additionally requires nonnegative values in every direction.
Figure 1.
Self-adjoint directional values may change sign, touch zero, or stay strictly positive
. Details.
The diagram compares Hermitian quadratic forms along paths of unit vectors. The Hermitian matrix takes the values and on the standard basis vectors; takes the values and ; and
satisfies and . These eigenvectors form an orthonormal basis, and every has . Thus is a positive operator, with eigenvalues and operator norm .
Three conditions describe different geometry. A Hermitian operator satisfies ; a normal operator satisfies ; a unitary operator satisfies , where is the identity operator. Every Hermitian operator and every unitary operator is a normal operator. Concrete matrices separate the conditions:
The spectrum of a bounded Hermitian operator is real. In finite dimension, the spectral theorem supplies an orthonormal basis of eigenvectors, turning its action into independent real scalings. This makes the geometry easy to interpret: each eigenvalue records a signed response along an orthogonal direction. An arbitrary bounded Hermitian operator in infinite dimension need not have any eigenvectors; the general spectral theorem uses a projection-valued measure. MIT's lecture 21 develops the real spectrum and the orthogonality of eigenspaces.[ref]
A historical connection is the study of forms with conjugate variables. In his 1901 account of Charles Hermite's work, Camille Jordan describes these forms and emphasizes their role in reducing forms with real or complex coefficients. In today's notation, is the diagonal value of a Hermitian form; the conjugate variables make a real-valued expression possible even with complex coefficients.[ref]
For a densely defined operator outside this bounded setting, the displayed pairing identity alone defines a symmetric operator. A self-adjoint operator must also have the same operator domain as its adjoint operator.
Input penalty of a history Hamiltonian Created 2026-10-06 Updated 2026-11-05
The input penalty of a history Hamiltonian tests prescribed ancilla qubits at clock time zero while leaving the quantum witness unrestricted. A zero ancilla qubit is tested by the bad-state projector ; a plus ancilla qubit is tested by .
Let , where each tests a different ancilla qubit. These orthogonal projections commute because they act on separate tensor product factors. Thus is a positive operator with integer eigenvalues between zero and . Zero is essential: its kernel contains exactly the valid ancillary input subspace, tensored with arbitrary quantum witness states. Only the nonzero eigenvalues are positive integers.
The clock-conditioned term is . For a normalized computational history state with clock labels forming an orthonormal basis,
Together with correct propagation, zero input penalty selects histories with valid initial data. The displayed expectation concerns this fixed history state; a bound on the full Hamiltonian's lowest eigenvalue also has to account for propagation penalties.
For bounded positive operators , membership gives . Both terms are nonnegative, so both vanish. The Cauchy-Schwarz inequality for a positive operator makes . The reverse inclusion is immediate. Commutativity is not required.
Kitaev geometrical lemma Created 2026-10-06 Updated 2026-11-05
Let be positive operators on a finite-dimensional Hilbert space, with every nonzero eigenvalue at least . Let be the orthogonal projections onto and define . Then
When the kernels have no common nonzero vector, this gives a positive lower bound. The projection formula also covers a zero kernel without taking a supremum over an empty unit sphere.
Indeed, and . For , , . The map consequently has squared operator norm at most , so . Combining these inequalities proves the result. With common kernel , restrict to and use the kernel projections there to bound the positive spectral gap.
In infinite dimension, replace the eigenvalue condition by the actual operator inequalities and . An assertion only about eigenvalues can be vacuous in the presence of continuous spectrum, and does not ensure this uniform gap.
Modular operator 2026-10-14
The positive operator in the polar decomposition of the Tomita operator. In a matrix-algebra standard representation with cyclic vector , it is . For a tracial vector it is the identity.
Negative part of a Hermitian operator Created 2026-10-06 Updated 2026-11-05
For a bounded Hermitian operator , its negative part of a Hermitian operator is
It is a positive operator, despite the word negative: its eigenvalues in a finite-dimensional diagonalization are the magnitudes of the negative eigenvalues of . For such a diagonalization, . The spectral-integral formula also covers a continuous spectrum without eigenvectors. Its support is orthogonal to the support of the positive part of a Hermitian operator, and .
Operator monotonicity of the square root Created 2026-09-28 Updated 2026-11-05
For bounded positive operators in the Löwner order, one has even if and do not commute. A useful proof uses
For , put to obtain before the factor . The zero case is immediate. The continuous functional calculus therefore gives the corresponding operator integral.
For , inverse order yields . This follows by conjugating by and inverting its spectrum. Consequently
Integration with positive weight proves the result. The integral converges in operator norm: near zero the integrand is bounded by , and near infinity by , or the corresponding bound for .
Partial trace positivity from product vectors Created 2026-10-14 Updated 2026-11-05
The partial trace of a positive operator is positive by this sum of nonnegative expectations in an orthonormal basis of the traced factor. Its trace equals the original trace, using the product orthonormal basis. Basis independence follows from , which uniquely determines the reduced operator. Thus reductions of density matrices remain density matrices. For a positive trace-class operator the same argument uses convergent nonnegative basis sums.
For a positive operator, . We show directly that every nonreal or negative real lies in the resolvent set.
If , the Cauchy-Schwarz inequality and reality of give
Thus is bounded below, hence injective with closed range: a convergent sequence of outputs has Cauchy preimages, whose limit maps to that output. Its adjoint is , which has trivial kernel by the same estimate. The identity , proved by the same inner-product calculation as in (i), makes its range dense. Being closed and dense, it is all of , and the lower bound makes the inverse bounded.
If is real, positivity gives , so the same argument applies with lower bound . Here the operator is self-adjoint, so its range is dense because its own kernel is zero. Hence
For ,
Both terms are nonnegative because are positive operators. Their sum is zero, so each vanishes. In particular,
Let and take the reduced positive operator . Choose orthonormal eigenvectors for its positive eigenvalues . Define
The defining identity of the partial trace gives , so the are orthonormal. Expansion in a full eigenbasis of yields ; zero-eigenvalue terms have zero squared norm and contribute nothing. Thus
The zero vector has the empty decomposition. Unit normalization would give , but no normalization is needed for the theorem itself.
For the given vector, the coefficient matrix is . Its second reduced operator is , whose eigenvalues are and eigenvectors , . The corresponding normalized first-factor vectors are
Their norms are one and their inner product is zero. Hence
Expanding the two terms returns the original three contributions. The vector has squared norm ; if a normalized state is wanted, divide by two and the Schmidt coefficients become and .
Write both the input and output integer labels in most-significant-bit-first order, and . Factoring the Fourier phase over the bits of gives the product decomposition of a Fourier phase state:
Here denotes the binary fraction ; the integer part of does not affect the phase.
Build a dyadic quantum Fourier transform circuit as follows. Process wires in that order. First apply a Hadamard gate to wire . Then, for each , apply the controlled phase gate with control wire and target wire . On a computational-basis state, every unprocessed control is still the bit , so wire becomes
Once a wire has been processed it is not touched by later stages. Reversing the order of the output wires gives exactly the Fourier product above. Agreement on every computational-basis state proves agreement as linear operators on all superpositions, even though the intermediate operation on a general input can create entanglement.
There are Hadamard gates and controlled phase gates. Output reversal may be treated as wire relabelling. If it must instead be implemented physically while using only the requested gate family, use swap operators. Each swap is three controlled-NOT gates, and
Thus the swaps use only Hadamard gates and Controlled-Z gates, which are controlled gates. An exact physical network has
elementary gates from the stated family. This implements the positive-exponent Fourier transform with the correct output order in quadratic size. Omitting the output reversal without relabelling the wires would produce the reversed-order transform instead.
For the perturbation bound, the operator norm in the source is equivalently . It satisfies the triangle inequality, is unchanged by left or right multiplication by a unitary operator, and a unitary operator has norm one. The exact telescoping identity is
It follows by replacing one factor at a time; alternatively all intermediate products cancel in the sum. Taking the operator norm and using unitary invariance gives the quantum circuit gate-error telescoping bound
The original PDF assumes strict , so its strict conclusion is justified. If the hypothesis were weakened to a non-strict inequality, the conclusion would likewise be . The TeX aid misreads this hypothesis; the PDF resolves it.
Apply the non-strict version to each approximate unitary gate in the Fourier network. Extending a gate by the identity on other wires leaves its operator norm error unchanged. Including the physical swap decompositions, all gates are of the required type and can obey the stated accuracy. Hence
With exact output relabelling rather than physical swaps the numerator is just . The proof retains gate phases and makes no assumption of cancellation between coherent errors.
For every normalized input the output-state norm error is at most this same bound. If is any positive operator satisfying , the change in its measurement in quantum mechanics outcome probability is at most , where : expand the difference of the two expectations into two terms, each bounded by using the Cauchy-Schwarz inequality. Thus inverse-polynomial gate accuracy gives an inverse-polynomial total error, rather than requiring exponential precision in the number of qubits. For the phase gates this corresponds to specifying angles with bits of precision, since . This is a robustness statement for unitary gate approximations; it does not by itself correct quantum decoherence, correlated stochastic faults, or limitations of hardware connectivity.
For a positive operator , the spectral theorem writes with . Hence its unique positive square root of an operator is . Conjugating this spectral decomposition shows for a unitary operator .
Let and . Then and . The square-root covariance and the cyclic property of the trace give
For the quantum fidelity, covariance first gives . Therefore
Apply the same square-root identity and the cyclic property of the trace to obtain
Thus unitary invariance of trace distance and fidelity gives
The same acts on both quantum states: these quantities depend on the relative distinguishability of the quantum states, not on a choice of basis.
A linear map is a completely positive map if sends every positive operator to a positive operator for every finite-dimensional auxiliary system . Positivity of alone tests only inputs without an auxiliary system and is weaker.
For the Kraus representation, let be any operator on the auxiliary system and the input system. Then
For any vector , its expectation is . Every amplification is therefore positive, proving the Kraus-form map is completely positive. No normalization condition on the is needed for this positivity proof. To make it a deterministic quantum channel, one additionally requires ; a physical outcome branch instead obeys .
Transposition is positive on one system: for any positive and any , is the complex conjugate of , hence is real and nonnegative. It fails complete positivity already for a qubit. Apply partial transposition to the second subsystem of the Bell state . The resulting operator is
On the antisymmetric vector , its eigenvalue is . Thus the partial transpose is not positive on this entangled input, and
The same witness embeds into any larger input dimension; in the exceptional one-dimensional case transposition is simply the identity.
For a unital star-subalgebra , the Von Neumann double commutant theorem states
Here is the commutant of an operator algebra, consisting of operators commuting with every element of . The double commutant is closed in either topology: multiplication by a fixed bounded operator is continuous in both. Therefore both closures of lie in .
For the converse, let and choose finitely many vectors . In put
It is invariant under the diagonal action of and its adjoints, so its orthogonal projection commutes with that diagonal action. Consequently each matrix entry belongs to . The diagonal operator with entry therefore commutes with . Since , the tuple belongs to , and hence so does . By the definition of , one element approximates this entire tuple arbitrarily closely. This is exactly approximation in every strong-operator neighborhood of . It proves and thus both asserted equalities. In particular, is a Von Neumann algebra.
The Kaplansky density theorem strengthens the result by preserving norm bounds:
It also holds for the self-adjoint and positive unit balls; the full ball can in fact be approximated in the strong-star topology, meaning strong convergence of both operators and adjoints. We prove the bound rather than merely scaling the unbounded approximants furnished by the double commutant theorem.
First put , a unital C-star algebra. Its self-adjoint part is weak-operator dense in : symmetrize any weak approximating net. For a convex subset, strong and weak operator closures agree. To see this explicitly, separation from a strong closure supplies a continuous real functional on finitely many image vectors, hence one of the form , which is also weak-operator continuous. The Hahn-Banach separation theorem would then separate the point from the weak closure as well. Thus every self-adjoint is a strong limit of self-adjoint , initially without a common norm bound.
The needed functional-calculus continuity follows directly from resolvents. The resolvent identity gives
The first factor has norm at most one, so the right side tends strongly to zero. The same holds at . Both resolvent nets are uniformly bounded, so their products converge strongly. Their scalar functions generate a self-adjoint algebra separating points of and vanishing at infinity. The Stone-Weierstrass theorem, applied to the one-point compactification, makes this algebra uniformly dense in . Uniform approximation and the functional-calculus norm bound therefore show
This proves strong continuity of functional calculus through resolvents without an unjustified uniform bound on the original .
If and , choose a real compactly supported continuous equal to the identity on and bounded in absolute value by one. Then are self-adjoint contractions and converge strongly to . For a positive contraction , choose instead equal to the identity on ; this gives positive contractions. These prove the two restricted versions for .
For an arbitrary contraction , apply the self-adjoint result in the matrix algebra to
The strong closure of is , since finitely many entries may be approximated simultaneously. The upper-right entries of the approximating self-adjoint contraction matrices belong to , satisfy , and converge strongly to . The lower-left entries are and converge strongly to . This proves the full strong-star assertion for .
Finally transfer the bounds from to the possibly nonclosed algebra . A contraction has an approximant with , so is an -contraction within of . Self-adjoint approximants are obtained by symmetrizing first. For a positive contraction, approximate by and use the positive contraction , which tends in norm to as . Combining these norm approximations with each finite-vector strong approximation proves all versions for . The reverse inclusions follow because the relevant norm bounds and the inequalities defining a positive operator are preserved by strong limits.