Complexity measure: a quantum information approach
From MaRDI portal
Recommendations
Cites work
- A Mathematical Theory of Communication
- ALGORITHMIC COMPLEXITY OF QUANTUM STATES
- Comment on the Shiner-Davison-Landsberg measure
- Complex and Adaptive Dynamical Systems
- Complexity Invariance by Replication in the Quantum Square Well
- Concurrence-based entanglement measure for Werner states
- Conditional entropies and their relation to entanglement criteria
- Conditionalq-entropies and quantum separability: a numerical exploration
- Dynamics, information and complexity in quantum systems
- Entropic nonextensivity: A possible measure of complexity
- Entropy and algorithmic complexity in quantum information theory
- EXTENDED ENTROPIES AND DISORDER
- Fisher-Shannon plane and statistical complexity of atoms
- Generalized statistical complexity measure
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Information and self-organization. A macroscopic approach to complex systems.
- LMC complexity for the ground states of different quantum systems
- Measures of statistical complexity: why?
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- Negative Entropy and Information in Quantum Mechanics
- On the Complexity of Finite Sequences
- QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
- SECOND QUANTIZED KOLMOGOROV COMPLEXITY
- The renormalized entropy -- an appropriate complexity measure?
Cited in
(4)
This page was built for publication: Complexity measure: a quantum information approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904811)