Tejas Bhojraj

activity

20202024

most citedPrefix-free quantum Kolmogorov complexity

5 citations · 13 across the 7 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

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…

math.LO2021

Notions of indifference for genericity: Union and subsequence sets

Tejas Bhojraj

A set $I$ is said to be a universal indifferent set for $1$ -genericity if for every $1$ -generic $G$ and for all $X \subseteq I$ , $G Δ X$ is also $1$ -generic. Miller showed that ther…

quant-ph2021★ 5 cited

Prefix-free quantum Kolmogorov complexity

Tejas Bhojraj

We introduce quantum-K ( $Q 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…