To calculate the entropy of a subalgebra or of a channel with respect to a state, one has to solve an intriguing optimalization problem. The latter is also the key part in the entanglement of formation concept, in which case the subalgebra is a subfactor. I consider some general properties, valid for these definitions in finite dimensions, and apply them to a maximal commutative subalgebra of a full matrix algebra. The main method is an interplay between convexity and symmetry. A collection of helpful tools from convex analysis for the problems in question is collected in an appendix.
Understanding and classifying multipartite entanglement is fundamental to quantum information processing. This work focuses on absolutely maximally entangled (AME) states, a class of highly entangled states characterized by their maximal entanglement across any bipartitions. To analyze and classify AME states, we employ the minimal decomposition entropy, defined as the minimum Rényi entropy
Sq associated with the state's decomposition over all local product bases. This quantity identifies the product bases in which the state is maximally localized, thereby yielding optimal representations for analyzing properties of AME states.
We develop an efficient algorithm for computing the minimal decomposition entropy for finite
q>1 and compare AME and Haar-random states for
q=2 and
q=∞ in qubit, qutrit, and ququad systems. For
q=2, AME states of four qutrits and ququads show lower minimal entropy than generic states, indicating sparser optimal forms. For
q=∞ -- related to the geometric measure of entanglement -- AME states exhibit higher entanglement. The algorithm also simplifies known AME states into sparser representations, aiding in distinguishing genuinely quantum AME states from those constructible from classical combinatorial designs. Our results advance the classification of AME states and demonstrate the utility of minimal decomposition entropy as both a local unitary invariant and a tool for state simplification.
We propose the Wigner separability entropy as a measure of complexity of a quantum state. This quantity measures the number of terms that effectively contribute to the Schmidt decomposition of the Wigner function with respect to a chosen phase-space decomposition. We prove that the Wigner separability entropy is equal to the operator space entanglement entropy, measuring entanglement in the space of operators, and, for pure states, twice the entropy of entanglement. The quantum to classical correspondence between the Wigner separability entropy and the separability entropy of the classical phase-space Liouville density is illustrated by means of numerical simulations of chaotic maps. In this way, the separability entropy emerges as an extremely broad complexity quantifier in both the classical and quantum realms.