Quantum algorithmic randomness
Quantum Physics
2021-02-11 v2 Information Theory
Logic in Computer Science
math.IT
Abstract
Quantum Martin-L\"of 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\"of 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.
Cite
@article{arxiv.2008.03584,
title = {Quantum algorithmic randomness},
author = {Tejas Bhojraj},
journal= {arXiv preprint arXiv:2008.03584},
year = {2021}
}
Comments
This is the final version, to appear in a journal. 17 pages