Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Machine Learning

Experimental Evidence of Quantum Randomness Incomputability

arXiv

Authors: Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Karl Svozil

Year

2010

Paper ID

9001

Status

Preprint

Abstract Read

~2 min

Abstract Words

Citations

N/A

Abstract

In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an asymptotic property --- of quantum randomness by performing finite tests of randomness inspired by algorithmic information theory.

Why This Paper Matters

This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
It adds a 2010 reference point for readers tracking recent quantum research.
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e. it is not exactly reproducible by any algorithm.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:1004.1521 [2] arXiv https://arxiv.org/abs/1004.1521 [3] Publisher https://arxiv.org/abs/1004.1521

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.