Jaynes principle versus entanglement
classification
🪐 quant-ph
keywords
entanglementinferencejaynesschemecompatibledatadifficultyentropy
read the original abstract
We show, by explicit examples, that the Jaynes inference scheme based on maximization of entropy can produce inseparable states even if there exists a separable state compatible with the measured data. It can lead to problems with processing of entanglement. The difficulty vanishes when one uses inference scheme based on minimization of entanglement.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.