Computing complexity measures for quantum states based on exponential families

DOI10.1088/1751-8113/46/12/125301MaRDI QIDQ4920469zbMATH OpenOpenAlexWikidataFDO

Authors Sönke Niekamp, Tobias Galla, Matthias Kleinmann, Otfried Gühne

Publication date 17 May 2013

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1212.6163

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Statistical thermodynamics (82B30)

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.

Recommendations

• Algorithms and Computation
• ALGORITHMIC COMPLEXITY OF QUANTUM STATES
• State complexity and quantum computation
• QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
• Complexity measure: a quantum information approach

Cited in

(10)

• Surveying structural complexity in quantum many-body systems
• A variational principle for ground spaces
• Computational Depth Complexity of Measurement-Based Quantum Computation
• Computational Complexity of Projected Entangled Pair States
• Parametric randomization, complex symplectic factorizations, and quadratic-exponential functionals for Gaussian quantum states
• Maximizing the divergence from a hierarchical model of quantum states
• The face lattice of the set of reduced density matrices and its coatoms
• Krylov complexity of fermionic and bosonic Gaussian states
• Algebraic geometry of quantum graphical models
• Matrix systems, algebras, and open maps

This page was built for publication: Computing complexity measures for quantum states based on exponential families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4920469)