The algorithmic complexity of long bit-strings is closely related to Shannon entropy and to compressibility. The talk will review such relations and then focus upon some proposed algorithmic complexity quantifiers for qubit strings and upon their relations to quantum entropies.
Aquesta web utilitza cookies per a la recollida de dades amb un propòsit estadístic. Si continues navegant, vol dir que acceptes la instal·lació de la cookie.