COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH
From MaRDI portal
Publication:4904811
DOI10.1142/S0219749912500475zbMath1257.68067OpenAlexW2033871747MaRDI QIDQ4904811
Yuri Cassio Campbell-Borges, José Roberto Castilho Piqueira
Publication date: 11 February 2013
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219749912500475
Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- A Mathematical Theory of Communication
- Fisher-Shannon plane and statistical complexity of atoms
- LMC complexity for the ground states of different quantum systems
- Entropy and algorithmic complexity in quantum information theory
- The renormalized entropy -- an appropriate complexity measure?
- Measures of statistical complexity: why?
- Comment on the Shiner-Davison-Landsberg measure
- Concurrence-based entanglement measure for Werner states
- Dynamics, information and complexity in quantum systems
- QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
- SECOND QUANTIZED KOLMOGOROV COMPLEXITY
- GENERALIZED STATISTICAL COMPLEXITY MEASURE
- On the Complexity of Finite Sequences
- Conditionalq-entropies and quantum separability: a numerical exploration
- Negative Entropy and Information in Quantum Mechanics
- Conditional entropies and their relation to entanglement criteria
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- Complex and Adaptive Dynamical Systems
- ALGORITHMIC COMPLEXITY OF QUANTUM STATES
- EXTENDED ENTROPIES AND DISORDER
- Complexity Invariance by Replication in the Quantum Square Well
- Information and self-organization. A macroscopic approach to complex systems.
- Entropic nonextensivity: A possible measure of complexity
