Quantum algorithmic randomness

DOI10.1063/5.0003351zbMath1459.81029arXiv2008.03584OpenAlexW3126376469MaRDI QIDQ5855663

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

Schnorr randomnessquantum Solovay randomness

Mathematics Subject Classification ID

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

Related Items (2)

Prefix-free quantum Kolmogorov complexity ⋮ Randomness and initial segment complexity for measures

Cites Work

• Unnamed Item
• Unnamed Item
• Incompleteness theorems for random reals
• The Shannon-McMillan theorem for ergodic quantum lattice systems
• Prefix-free quantum Kolmogorov complexity
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Algorithmic Randomness and Complexity
• Quantum Complexity Theory
• Quantum Kolmogorov complexity based on classical descriptions
• Martin-Löf random quantum states
• Schnorr randomness
• Quantum Kolmogorov complexity

This page was built for publication: Quantum algorithmic randomness