arXiv subjects
Publications and source records attributed to Fabio Benatti.
In classical information theory, entropy rate and Kolmogorov 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 Kolmogorov complexity, both based on the shortest qubit descriptions of qubit strings that, run by a universal quantum Turing machine, reproduce them as outputs.
We study the presence of a logarithmic time scale in discrete approximations of Sawtooth Maps on the 2--torus. The techniques used are suggested by quantum mechanical similarities, and are based on a particular class of states on the torus, that fulfill dynamical localization properties typical of quantum Coherent States.
We use open quantum system techniques to construct one-parameter semigroups of positive maps and apply them to study the entanglement properties of a class of 16-dimensional density matrices, representing states of a 4x4 bipartite system.
We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit Boolean function. We compare the classical and the quantum case, and we determine for how many oracle-queries k and for how many bits n one querying procedure is more efficient than the other.
We study whether the entanglement of formation is additive over tensor products and derive a necessary and sufficient condition for optimality of vector states that enables us to show additivity in two special cases.
Direct CP-violating effects in the neutral kaon system result in violations of certain Bell-like inequalities. The new experimental results on the determination of the phenomenological parameter epsilon' allow to dismiss a large class of ``hidden variable'' alternatives to quantum mechanics.