Quantum algorithmic randomness

DOI10.1063/5.0003351MaRDI QIDQ5855663zbMATH OpenOpenAlexFDO

Authors Tejas Bhojraj

Publication date 19 March 2021

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.03584

zbMATH Keywords

quantum Solovay randomnessSchnorr randomness

Mathematics Subject Classification ID

Optimality conditions for problems involving randomness (49K45) Central limit and other weak theorems (60F05) Quantum state spaces, operational and probabilistic concepts (81P16) Quantum computation (81P68)

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.

Recommendations

• Martin-Löf random quantum states
• Quantum Kolmogorov complexity
• Prefix-free quantum Kolmogorov complexity
• Quantum algorithmic entropy
• Randomness: quantum versus classical

Cites work

• Algorithmic randomness and complexity.
• Computability and randomness
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Generating randomness from a computable, non-random sequence of qubits
• Incompleteness theorems for random reals
• Martin-Löf random quantum states
• Prefix-free quantum Kolmogorov complexity
• Quantum Complexity Theory
• Quantum Kolmogorov complexity
• Quantum Kolmogorov complexity based on classical descriptions
• Schnorr randomness
• The Shannon-McMillan theorem for ergodic quantum lattice systems

Cited in

(10)

• Prefix-free quantum Kolmogorov complexity
• Randomness and initial segment complexity for measures
• Randomness: quantum versus classical
• Квантовый генератор случайных чисел
• Generating randomness from a computable, non-random sequence of qubits
• Quantum Random Number Generation
• QUANTUM ALGORITHMS FOR GENERATING RANDOM SEQUENCES OF INTEGERS
• scientific article; zbMATH DE number 7701522 (Why is no real title available?)
• Von Neumann entropy and quantum algorithmic randomness
• Quantum process randomness

This page was built for publication: Quantum algorithmic randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855663)