Entropy representation by prefix Kolmogorov complexity
Let be the universal lower-semicomputable semi-density matrix from the preceding conjecture. Let be a computable orthogonal sequence of states, and define real-valued functions by
Here denotes prefix Kolmogorov complexity.
Entropy-complexity conjecture. For or , one has
This is intended as a quantum analogue of the relationship between classical algorithmic entropy and prefix complexity. The supplied text gives no resolution status for this claim.
References
- Toru Takisaka, “On Gács' quantum algorithmic entropy”, arXiv:1412.8547 (2014).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.