reduced density matrix
The matrix obtained by applying the partial trace to a density operator; its diagonal recovers the ordinary marginal probabilities while off-diagonal entries retain information about the discarded subsystem.
As defined in 174 | Tai-Danae Bradley on Algebra, Topology, Language, and Entropy
Where it comes up · 1
Most important claims · 2 of 2Search all claims for “reduced density matrix” →
- By representing a probability distribution as a matrix (density operator) rather than a list of numbers, you can compute a 'marginal probability with memory' via the partial trace: the diagonal of the resulting reduced density matrix recovers the ordinary marginal probabilities, while the off-diagonal entries retain information about the subsystem that classical marginalization discards.174 | Tai-Danae Bradley on Algebra, Topology, Language, and Entropy
- Both marginal reduced density matrices (marginalizing out either variable) together with their off-diagonal entries are sufficient to recover the full joint probability distribution, so no information is lost when using the quantum-style representation correctly.174 | Tai-Danae Bradley on Algebra, Topology, Language, and Entropy