This work extends the theories of algorithmic randomness and Kolmogorov complexity of
bitstrings to the quantum realm. Nies and Scholz defined quantum Martin-Löf randomness (q …

We introduce quantum-K (QK), a measure of the descriptive complexity of density matrices
using classical prefix-free Turing machines and show that the initial segments of weak …

Nies and Scholz introduced the notion of a state to describe an infinite sequence of qubits
and defined quantum-Martin-Lof randomness for states, analogously to the well known …

A state ρ=(ρn) n is a sequence such that ρn is a density matrix on n qubits. It formalizes the
notion of an infinite sequence of qubits. The von Neumann entropy H (d) of a density matrix …

Random sequences of quantum bits Two ways to study Martin-Löf randomness for objects other
than infinite bit sequences Infinite Page 1 Random sequences of quantum bits André Nies …

A Complete Bibliography of Publications in the Journal of Mathematical Physics: 2020–2024
Page 1 A Complete Bibliography of Publications in the Journal of Mathematical Physics …