Graph explorer

Quantum algorithmic randomness

Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz. We define a notion of quantum Solovay randomness which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic result about approximating density matrices by subspaces. We then show that random states form a convex set. Martin-Löf absolute continuity is shown to be a special case of q-MLR. Quantum Schnorr randomness is introduced. A quantum analogue of the law of large numbers is shown to hold for quantum Schnorr random states.

6 nodes6 linksoverview previewQuantum algorithmic randomness
6 nodes6 links
Quantum algorithmic randomness6 visible / 6 total nodes / 6 links
AuthorshipTopic signalTopic signalTopic signalTopic signalRelated contextWQuantum algorithmic randomnesspreprint / 2021ATejas BhojrajResearcherTquant-ph17817 worksTInformation Theory6710 worksTmath.IT6610 worksTLogic in Computer Science2208 works
PaperSignal 105 links

Quantum algorithmic randomness

preprint / 2021

Open