Quantum Mechanics and Algorithmic Randomness
| dc.creator | Yurtsever, Ulvi | |
| dc.date | 1998-06-18 | |
| dc.date | 2000-12-13 | |
| dc.date.accessioned | 2026-07-07T06:15:14Z | |
| dc.date.available | 2026-07-07T06:15:14Z | |
| dc.description | A long sequence of tosses of a classical coin produces an apparently random bit string, but classical randomness is an illusion: the algorithmic information content of a classically-generated bit string lies almost entirely in the description of initial conditions. This letter presents a simple argument that, by contrast, a sequence of bits produced by tossing a quantum coin is, almost certainly, genuinely (algorithmically) random. This result can be interpreted as a strengthening of Bell's no-hidden-variables theorem, and relies on causality and quantum entanglement in a manner similar to Bell's original argument. | |
| dc.description | plain LaTeX, 11 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9806059 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9806059 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93732 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Mechanics and Algorithmic Randomness | |
| dc.type | text |