Efficiently Compressible Density Operators via Entropy Maximization
release_n63zzbzlq5bdnijpkgfcckunyi
by
Serena Di Giorgio, Paulo Mateus
Abstract
We address the problem of efficiently and effectively compress density operators (DOs), by providing an efficient procedure for learning the most likely DO, given a chosen set of partial information. We explore, in the context of quantum information theory, the generalisation of the maximum entropy estimator for DOs, when the direct dependencies between the subsystems are provided. As a preliminary analysis, we restrict the problem to tripartite systems when two marginals are known. When the marginals are compatible with the existence of a quantum Markov chain (QMC) we show that there exists a recovery procedure for the maximum entropy estimator, and moreover, that for these states many well-known classical results follow. Furthermore, we notice that, contrary to the classical case, two marginals, compatible with some tripartite state, might not be compatible with a QMC. Finally, we provide a new characterisation of quantum conditional independence in light of maximum entropy updating. At this level, all the Hilbert spaces are considered finite dimensional.
In application/xml+jats
format
Archived Files and Locations
application/pdf 212.3 kB
file_ccjqozmt4rgi3j3rfjp72wn3va
|
res.mdpi.com (publisher) pdfs.semanticscholar.org (aggregator) web.archive.org (webarchive) web.archive.org (webarchive) |
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:
2504-3900
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar