On the complexity of finding the maximum entropy compatible quantum state
arXiv:2005.13371 · doi:10.3390/math9020193
Abstract
Herein we study the problem of recovering a density operator from a set of compatible marginals, motivated from limitations of physical observations. Given that the set of compatible density operators is not singular, we adopt Jaynes' principle and wish to characterize a compatible density operator with maximum entropy. We first show that comparing the entropy of compatible density operators is QSZK-complete, even for the simplest case of 3-chains. Then, we focus on the particular case of quantum Markov chains and trees and establish that for these cases, there exists a quantum polynomial circuit that constructs the maximum entropy compatible density operator. Finally, we extend the Chow-Liu algorithm to the same subclass of quantum states.
arXiv comment21 pages, 2 figures
References in corpus (13)
- Quantum Machine Learning
- Towards a Formulation of Quantum Theory as a Causally Neutral Theory of Bayesian Inference
- Quantum conditional mutual information and approximate Markov chains
- Hamiltonian Learning and Certification Using Quantum Resources
- Learning a local Hamiltonian from local measurements
- Monotonicity of quantum relative entropy revisited
- Quantum Overlapping Tomography
- One-qubit reduced states of a pure many-qubit state: polygon inequalities
- Entropic Inequalities and Marginal Problems
- Universal recovery map for approximate Markov chains
- Learning the dynamics of open quantum systems from their steady states
- Characterizing ground and thermal states of few-body Hamiltonians
- Recoverability from direct quantum correlations