Quantum Algorithmic Complexities and Entropy (Q3567165): Difference between revisions

@@ Property / cites work @@
+Quantum Computability
@@ Property / cites work: Quantum Computability / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Dynamical Systems
@@ Property / cites work: Quantum Dynamical Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
+Normal rank
@@ Property / cites work @@
+Mixed-state entanglement and quantum error correction
+Normal rank
@@ Property / cites work @@
+Quantum Complexity Theory
@@ Property / cites work: Quantum Complexity Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Kolmogorov complexity
@@ Property / cites work: Quantum Kolmogorov complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The Shannon-McMillan theorem for ergodic quantum lattice systems
+Normal rank
@@ Property / cites work @@
+On the Length of Programs for Computing Finite Binary Sequences
+Normal rank
@@ Property / cites work @@
+A Theory of Program Size Formally Identical to Information Theory
+Normal rank
@@ Property / cites work @@
+The proper formula for relative entropy and its asymptotics in quantum probability
+Normal rank
@@ Property / cites work @@
+Entropy densities for algebraic states
@@ Property / cites work: Entropy densities for algebraic states / rank @@
+Normal rank
@@ Property / cites work @@
+Logical basis for information theory and probability theory
+Normal rank
@@ Property / cites work @@
+A Short Introduction to Quantum Information and Quantum Computation
+Normal rank
@@ Property / cites work @@
+A formal theory of inductive inference. Part I
@@ Property / cites work: A formal theory of inductive inference. Part I / rank @@
+Normal rank
@@ Property / cites work @@
+A formal theory of inductive inference. Part II
@@ Property / cites work: A formal theory of inductive inference. Part II / rank @@
+Normal rank
@@ Property / cites work @@
+Can an individual sequence of zeros and ones be random?
+Normal rank
@@ Property / cites work @@
+THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s1230161209000025
+Normal rank
@@ Property / OpenAlex ID @@
+W1998083119
@@ Property / OpenAlex ID: W1998083119 / rank @@
+Normal rank