Relative Entropy for QFT States
Relative entropy asks how well two states can be distinguished using the observables in one declared algebra. This algebra-first definition is the natural one in continuum QFT: it works for type-III local algebras, needs no reduced density matrix or local trace, and often remains finite even when the individual local von Neumann entropies do not exist. The order matters throughout: treats as the state being tested and as the reference.
Required background. Use operator algebras and normal positive functionals and restricted states on subregions. Helpful background. Type-III local algebras explain why the density-matrix formula is not the continuum definition.
Before applying a formula, use the chapter’s validity map to check algebra, support, regulator, and resource assumptions. The claim-comparison table separates algebraic relative entropy from hypothesis testing, fidelity, recovery, and channel distances.
The algebraic comparison
Section titled “The algebraic comparison”Let and be normal states on a von Neumann algebra . In standard form, let and be their natural-cone representatives. For faithful states, close the antilinear operator
and define
With the second state as reference,
Araki’s extension to arbitrary normal states incorporates their support projections and interprets the logarithm spectrally. If , the value is . If support inclusion holds, the logarithmic quadratic form may still diverge in infinite dimensions. See Araki 1976, Eqs. (1.1)–(1.2), p. 809 and Araki 1977, Definition 3.1 and Remarks 3.4–3.5, pp. 177–178.
For normalized normal states,
with equality exactly when as states on the declared algebra; see Araki 1977, Theorem 3.6(1), pp. 178–179.
The density-matrix expression follows from this construction rather than replacing it. For faithful density matrices and on a finite-dimensional Hilbert space, represent on Hilbert–Schmidt operators and write . Then
where and . Left and right multiplication commute, so
Consequently,
After extending to nonfaithful finite-dimensional matrices,
For trace-class density operators on an infinite-dimensional Hilbert space, the first branch means the extended Umegaki functional, not a subtraction of two separately infinite traces. Support inclusion removes the automatic singular branch but does not guarantee a finite value.
For commuting matrices it is simply the classical Kullback–Leibler divergence . For noncommuting QFT states, the relative modular operator is the replacement for the ratio .
What distinguishability means locally
Section titled “What distinguishability means locally”The algebra specifies which measurements are allowed. For a finite-outcome POVM , define and . Data processing gives
Thus algebraic relative entropy bounds the classical distinguishability available to every such local measurement; it is not itself a one-shot error probability and need not be attained by one measurement. A many-copy error exponent requires an explicitly declared product-state experiment, treated on Hypothesis Testing and Asymptotic Distinguishability.
Likewise, if is a genuine inclusion and both pairs are literal restrictions of the same two states, then
This statement does not compare unrelated cutoff systems; its proof and channel form belong to Positivity, Monotonicity, and Data Processing. Two globally different preparations can nevertheless have when their restrictions agree on . Relative entropy compares states as seen by the stated observer, not vectors in an unspecified global Hilbert space.
The diagram shows which conclusions start from the same algebraic core and which extra inputs they need.
Araki relative entropy is the central state comparison. Hypothesis tests, overlap bounds, mutual information, and recovery statements are related but distinct tasks with their own copy, algebra, channel, and resource assumptions. Schematic.
The type-I modular balance
Section titled “The type-I modular balance”For faithful density matrices, define the reference modular Hamiltonian and
When the displayed traces are defined and finite, a direct rearrangement gives
At each finite type-I regulator this identity is exact. It does not prove that a sequence of regulators converges: identifying a cutoff limit with continuum Araki relative entropy requires compatible algebras and states plus an applicable convergence theorem, as explained on Araki Relative Entropy and Regulated Limits. On a type-III algebra, the separate regulated quantities and must not be promoted to intrinsic local von Neumann entropies.
At a finite Gaussian regulator, a Weyl displacement changes first moments but not covariance, so the displaced state and its reference have identical reduced Gaussian entropy and . The continuum statement is instead direct: for the CCR coherent perturbations covered by the entropy-form theorem, relative entropy is a positive closed quadratic form of the displacement difference and is finite exactly when that difference lies in its form domain; see Bostelmann, Cadamuro, and Del Vecchio 2022, Theorem 2.13 and Eq. (2.32), p. 670.
Exact interval result and regulated comparison
Section titled “Exact interval result and regulated comparison”Take the vacuum causal-diamond algebra of the massless real scalar in dimensions at . The continuum target uses compactly supported classical Cauchy data. The finite Dirichlet box introduced below is the chosen infrared regulator for the lattice comparison, and its sweep is not a proof of a limit. For the interval , choose the time-symmetric coherent data
where . The choice satisfies the relevant zero-mode restriction. Inside the support,
The extension by zero is smooth, with all derivatives vanishing at , so the weighted energy integral below is finite. With the coherent restriction as the first argument and the vacuum restriction as reference,
This is a relative-entropy formula on the causal-diamond algebra, not a reduced-density-matrix ansatz; the energy density and vacuum bounded-interval relative entropy are given in Garbarz and Palau 2023, Eq. (91), p. 125016-9, and § IV.B.2, Eq. (95), p. 125016-10.
For , , and , the binary64 rendering of a 90-digit quadrature is
Two independent JavaScript quadratures agree with it within nats. The integral is quadratic in , so changing multiplies the answer by .
The matched harmonic chain has Dirichlet endpoints at and , spacing , and interior canonical variables
Writing
the vacuum covariances are
For grid phase , the interval center is , the coherent displacement is
and the interval retains precisely the oscillator centers satisfying . Restriction takes principal submatrices and the corresponding slice . Since the two restricted Gaussian states have identical covariance, their relative entropy reduces to
where is the Gibbs matrix of the restricted vacuum covariance, evaluated here by Williamson decomposition. This is the equal-covariance specialization of Wilde et al. 2017, Eqs. (3)–(6) and (9), pp. 120501-2–120501-3.
At , phase zero, and the preferred symplectic-gap floor , the spacing study is
| Global sites | Interval sites | (nats) | (nats) | |
|---|---|---|---|---|
| 127 | 15 | 7.29165056 | −1.12431393 | |
| 191 | 23 | 7.91635461 | −0.49960988 | |
| 255 | 31 | 8.14361217 | −0.27235232 |
These values empirically move toward the continuum target, but they are different finite systems and are neither a data-processing sequence nor a proof of convergence. At the point, symplectic-gap floors , , and give , , and nats, a spread of nats. The sweep spans nats, and a half-cell phase shift changes the value by nats. Linear and quadratic spacing fits extrapolate to and nats, so their -nat disagreement is not an error bar. No single lattice continuum uncertainty is claimed.
By contrast, the benchmark’s seven interval restrictions inside one fixed 255-site master system are literal principal restrictions and are nondecreasing, with minimum increment nats; the data-processing page interprets that separate check.
The machine-readable interval benchmark records the profile, state order, site rules, all , , phase, and conditioner sweeps, matrix residuals, quadratures, and adversarial tests. The regulated-limit page supplies the exact convergence theorem.
Support failure and mismatched questions
Section titled “Support failure and mismatched questions”Support is not a numerical nuisance. Let
Then , so
The reverse orientation is finite:
Projecting onto the support of and renormalizing would give zero, but it replaces the original state by and therefore answers a different question. Replacing the reference by the faithful
also changes the problem; for fixed , the finite value contains and diverges as .
A different failure occurs when one state is defined on the two-outcome commutative observable algebra and another on the three-outcome commutative observable algebra . Without a specified common algebra, embedding, restriction, or channel, their relative entropy is undefined, not infinite. Support mismatch concerns two states already defined on one algebra.
For the standard-form and noncommutative-divergence machinery behind this page, continue to the rigorous mathematical treatment.
Common pitfalls
Section titled “Common pitfalls”Forgetting the state order. The reference is the second argument. Reversing the arguments changes both the support test and the numerical value.
Assuming local density matrices exist in continuum QFT. A lattice region may have a density matrix; the sharp continuum local algebra is typically type III. Use the algebraic definition as the target.
Treating support inclusion as a finiteness proof. It removes the automatic singular branch. In infinite dimensions, the logarithmic quadratic form can still diverge.
Calling one close cutoff value convergence. Discretization, box size, grid placement, and matrix conditioning are independent controls. Report them before assigning an uncertainty.
Exercises
Section titled “Exercises”1. Reverse the support test
Section titled “1. Reverse the support test”For , evaluate both orientations of the two-level example above. Explain why the answers differ.
Solution
Because has weight on the null space of ,
In the reverse direction, the pure state’s support is contained in that of , and
Relative entropy is directed: only the first experiment assigns probability to an event that the reference declares impossible.
2. Derive the modular balance
Section titled “2. Derive the modular balance”Starting from , show that .
Solution
Using ,
The two reference-state terms cancel. The derivation assumes the traces exist. The algebraic relative-modular expression defines continuum relative entropy directly; it does not make the two subtracted terms intrinsic.
3. Scale the coherent profile
Section titled “3. Scale the coherent profile”If the interval profile is replaced by and , predict the relative entropy for and from the benchmark.
Solution
The integrand contains , so the answer scales as . Therefore
The regulator code separately verifies exact quadratic scaling of its finite-chain displacement result.
References
Section titled “References”- Araki, Huzihiro. “Relative Entropy of States of von Neumann Algebras.” Publications of the Research Institute for Mathematical Sciences 11 (1976): 809–833. DOI.
- Araki, Huzihiro. “Relative Entropy for States of von Neumann Algebras II.” Publications of the Research Institute for Mathematical Sciences 13, no. 1 (1977): 173–192. DOI.
- Bostelmann, Henning, Daniela Cadamuro, and Simone Del Vecchio. “Relative Entropy of Coherent States on General CCR Algebras.” Communications in Mathematical Physics 389 (2022): 661–691. DOI. Open preprint.
- Garbarz, Alan, and Gabriel Palau. “Relative Entropy of an Interval for a Massless Boson at Finite Temperature.” Physical Review D 107 (2023): 125016. DOI. Open preprint.
- Wilde, Mark M., Marco Tomamichel, Seth Lloyd, and Mario Berta. “Gaussian Hypothesis Testing and Quantum Illumination.” Physical Review Letters 119 (2017): 120501. DOI. Open PDF.
Original QFT.org content:CC BY 4.0, unless an item supplies different terms. Third-party material retains its own terms.