Computing complexity measures for quantum states based on exponential families

Abstract

Given a multiparticle quantum state, one may ask whether it can be represented as a thermal state of some Hamiltonian with k-particle interactions only. The distance from the exponential family defined by these thermal states can be considered as a measure of complexity of a given state. We investigate the resulting optimization problem and show how symmetries can be exploited to simplify the task of finding the nearest thermal state in a given exponential family. We also present an algorithm for the computation of the complexity measure and consider specific examples to demonstrate its applicability.

19 pages, 3 figures

References in corpus (18)

• Quantum entanglement
• Entanglement detection
• The classical-quantum boundary for correlations: discord and related measures
• The Bloch Vector for N-Level Systems
• Normal forms and entanglement measures for multipartite quantum states
• Characterization of the Positivity of the Density Matrix in Terms of the Coherence Vector Representation
• Entanglement properties of multipartite entangled states under the influence of decoherence
• Making Sense of the Legendre Transform
• Separability properties of tripartite states with UxUxU-symmetry
• Knowledge and ignorance in incomplete quantum state tomography
• Irreducible multi-particle correlations in states without maximal rank
• Supersinglets
• Geometric phase of an atom in a magnetic storage ring
• Complexity Measures from Interaction Structures
• Maximizing Multi-Information
• Multiparticle entanglement in graph-diagonal states: Necessary and sufficient conditions for four qubits
• Irreducible multiparty correlation can be created by local operations
• Complexity measures, emergence, and multiparticle correlations

Cited by in corpus (17)

• Quantifying genuine multipartite correlations and their pattern complexity
• Reconstructing quantum states from local data
• Trade-off between information and disturbance in qubit thermometry
• Supervised learning in Hamiltonian reconstruction from local measurements on eigenstates
• Maximizing the divergence from a hierarchical model of quantum states
• Characterizing ground and thermal states of few-body Hamiltonians
• Determining system Hamiltonian from eigenstate measurements without correlation functions
• Canonical divergence for measuring classical and quantum complexity
• Irreducible many-body correlations in topologically ordered systems
• Geometry and symmetry in quantum Boltzmann machine
• An efficient numerical algorithm on irreducible multiparty correlations
• A variation principle for ground spaces
• Weaving and neural complexity in symmetric quantum states
• Quantum marginals, faces, and coatoms
• Analysing multiparticle quantum states
• Matrix systems, algebras, and open maps
• Canonical divergence for flat $\alpha$-connections: Classical and Quantum