A new quantum random number generator certified by value indefiniteness
From MaRDI portal
Publication:1998859
DOI10.1016/j.tcs.2020.08.014zbMath1497.68232arXiv2008.09970OpenAlexW3080787963MaRDI QIDQ1998859
José Manuel Agüero Trejo, Cristian S. Calude
Publication date: 9 March 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.09970
Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
On the complete description of entangled systems. I: Exploring hidden variables and context communication cost in simulating quantum correlations, Bi-immunity over different size alphabets, Prefix-free quantum Kolmogorov complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Physical (a)causality. Determinism, randomness and uncaused events
- Bell-Kochen-Specker theorem: a proof with \(18\) vectors.
- Classical, quantum and biological randomness as relative unpredictability
- On the Unpredictability of Individual Quantum Measurement Outcomes
- Algorithmic Randomness and Complexity
- A variant of the Kochen-Specker theorem localising value indefiniteness
- Algorithmic Information Theory
- The Methodology of Scientific Research Programmes
- Two simple proofs of the Kochen-Specker theorem
- Von Neumann Normalisation of a Quantum Random Number Generator
- From Bi-Immunity to Absolute Undecidability
- On the Problem of Hidden Variables in Quantum Mechanics
- A quantum random number generator certified by value indefiniteness
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- An introduction to Kolmogorov complexity and its applications
