Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Letters in Mathematical Physics

Optimal Decompositions with Respect to Entropy and Symmetries

Fabio Benatti, Heide Narnhofer, Armin Uhlmann

Published Feb 1, 1999• 6 citations
Publisher
DOI
10.1023/a:1007537800344

Related papers

Optimal decompositions of quantum states with respect to entropy

Fabio Benatti, Heide Narnhofer, Armin Uhlmann

Reports on Mathematical Physics•Aug 1, 1996•29 citations

Entropy and optimal decompositions of states relative to a maximal commutative subalgebra

Armin Uhlmann

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.

arXiv:quant-ph/9704017•Apr 8, 1997•70 citations

Statistical systems with well-defined entropy

Gisela A. Lassner

Czechoslovak Journal of Physics•Mar 1, 1979•0 citations

Broken symmetries in the entanglement of formation

Fabio Benatti, H. Narnhofer, A. Uhlmann

We compare some recent computations of the entanglement of formation in quantum information theory and of the entropy of a subalgebra in quantum ergodic theory. Both notions require optimization over decompositions of quantum states. We show that both functionals are strongly related for some highly symmetric density matrices. Indeed, for certain interesting regions the entanglement of formation can be expressed by the entropy of a commuting subalgebra, and the corresponding optimal decompositions can be obtained one from the other. We discuss the presence of broken symmetries in relation with the structure of the optimal decompositions.

arXiv:quant-ph/0209081•Journal of Mathematical Physics•May 21, 2003•6 citations

Classical symmetries and the Quantum Approximate Optimization Algorithm

Ruslan Shaydulin, Stuart Hadfield, Tad Hogg +1 more

arXiv:2012.04713•Quantum Information Processing•Oct 26, 2021•90 citations

Optimising the relative entropy under semidefinite constraints

Gereon Koßmann, René Schwonnek

npj Quantum Information•Jan 1, 2026•0 citations
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.
We compare some recent computations of the entanglement of formation in quantum information theory and of the entropy of a subalgebra in quantum ergodic theory. Both notions require optimization over decompositions of quantum states. We show that both functionals are strongly related for some highly symmetric density matrices. Indeed, for certain interesting regions the entanglement of formation can be expressed by the entropy of a commuting subalgebra, and the corresponding optimal decompositions can be obtained one from the other. We discuss the presence of broken symmetries in relation with the structure of the optimal decompositions.