Work

Entropy and Algorithmic Complexity in Quantum Information Theory: a Quantum Brudno's Theorem

Year: 2005

Type: preprint

Abstract: In classical information theory, entropy rate and algorithmic complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of quantum algorithmic complexity, both based on the shortest qubit descriptions of qubit strings that, run by a universal quantum Turing machine, reproduce them as outputs.

Source: arXiv (Cornell University)

Authors: Fabio Benatti, Tyll Krueger, Markus P. Mueller, Rainer Siegmund‐Schultze, Arleta Szkoła

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W19408317

Cites: 23

Cited by: 1

Related to: 10