5 citations · 13 across the 7 of their papers we have counts for
Showing 2021 · quant-phShow all
2 papers · 2 filters
quant-ph2021★ 1 cited
Algorithmic Randomness and Kolmogorov Complexity for Qubits
Tejas Bhojraj
Nies and Scholz defined quantum Martin-Löf randomness (q-MLR) for states (infinite qubitstrings). We define a notion of quantum Solovay randomness and show it to be equivalent to q…
quant-ph2021★ 5 cited
Prefix-free quantum Kolmogorov complexity
Tejas Bhojraj
We introduce quantum-K (), a measure of the descriptive complexity of density matrices using classical prefix-free Turing machines and show that the initial segments of weak So…