Quantum algorithmic randomness
arXiv:2008.03584 · doi:10.1063/5.0003351
Abstract
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.
arXiv commentThis is the final version, to appear in a journal. 17 pages
References in corpus (9)
- Quantum Kolmogorov Complexity
- Quantum Kolmogorov Complexity Based on Classical Descriptions
- Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem
- Entanglement of genuinely entangled subspaces and states: exact, approximate, and numerical results
- Quantum Kolmogorov Complexity and the Quantum Turing Machine
- Prefix-free quantum Kolmogorov complexity
- Entangled subspaces and quantum symmetries
- Quantum algorithmic randomness
- Generating Randomness from a Computable, Non-random Sequence of Qubits