QUANTUM ALGORITHMIC ENTROPY ´ PETER GACS A BSTRACT. We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (“universal probability”) as a starting point, and - Algorithmic probability - Document - PDFSEARCH.IO

First Page	Meta Content
	QUANTUM ALGORITHMIC ENTROPY ´ PETER GACS A BSTRACT. We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (“universal probability”) as a starting point, and Add to Reading List Document Date: 2005-03-01 13:02:46 Open Document File Size: 255,06 KB Share Result on Facebook City Amsterdam / / Company Kraft / / IndustryTerm self-adjoint positive semidefinite operator / inner product / quantum computing / linear operator / computing / / Person PETER GACS / / Position author / rt / limt rt / / Technology cryptography / cloning / PKI / simulation / / SocialTag Information theory Quantum information science Models of computation Quantum complexity theory Kolmogorov complexity Quantum computer Entropy Computational complexity theory Semicomputable function Theoretical computer science

QUANTUM ALGORITHMIC ENTROPY ´ PETER GACS A BSTRACT. We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (“universal probability”) as a starting point, and Add to Reading List