Experiment re quantum randomness

Click For Summary

Discussion Overview

The discussion revolves around the concept of randomness in quantum mechanics, specifically addressing the nature of 'true' randomness versus pseudorandomness. Participants explore the implications of quantum states as examples of true randomness and the potential existence of a deterministic substratum underlying quantum outcomes. The conversation includes references to relevant literature and the definitions of randomness in computational contexts.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants assert that 'true' randomness cannot be generated by efficient algorithms, referencing Kolmogorov's definition, while pseudorandomness can be produced, such as through irrational numbers.
  • There is a discussion on whether quantum states can be considered examples of 'true' randomness, with some questioning if a deterministic substratum could negate this notion.
  • One participant emphasizes the need for clearer definitions of randomness, particularly in relation to acausality and predictability.
  • Another participant highlights the mathematical property of Kolmogorov randomness, noting that true randomness is a characteristic of infinite strings, while finite strings cannot be definitively classified as random.
  • A cited paper discusses the use of entangled quantum particles to certify genuine randomness, suggesting that such randomness is fundamentally different from classical approaches.
  • Participants express varying views on the reliability of random number generators and the challenges posed by theoretical modeling and device failures.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the nature of randomness, with multiple competing views regarding the definitions and implications of true versus pseudorandomness, as well as the existence of a deterministic substratum.

Contextual Notes

Some discussions reference the limitations of finite character strings in defining true randomness and the challenges in characterizing randomness mathematically. The conversation also touches on the reliability of random number generation in quantum systems and the implications of Bell's theorem.

Who May Find This Useful

This discussion may be of interest to those studying quantum mechanics, computational theory, randomness in physics, and the philosophical implications of determinism and randomness.

SW VandeCarr
Messages
2,199
Reaction score
77
"True' randomness cannot be generated by any efficient algorithm (Kolmogorov) while pseudorandomness can be, such as the apparently random digit sequences of irrational numbers. The experimental realization of quantum states is taken to be an example of 'true' randomness in nature. However, if there is a deterministic substratum to such outcomes, then there apparently would be no 'true' randomness' in nature.

The following paper claims experimental evidence for 'true' randomness in quantum outcomes in the Kolmogorov sense. Since the authors concede they cannot 'prove' true randomness, would this evidence carry weight to those who hold that an underlying deterministic substratum must exist?

http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.1521v1.pdf
 
Last edited:
Physics news on Phys.org
SW VandeCarr said:
"True' randomness cannot be generated by any efficient algorithm (Kolmogorov) while pseudorandomness can be, such as the apparently random digit sequences of irrational numbers. The experimental realization of quantum states is taken to be an example of 'true' randomness in nature. However, if there is a deterministic substratum to such outcomes, then there apparently would be no 'true' randomness' in nature.

The following paper claims experimental evidence for 'true' randomness in quantum outcomes in the Kolmogorov sense. While the authors concede they cannot 'prove' true randomness, would this evidence carry weight to those who hold that an underlying deterministic substratum must exist?

http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.1521v1.pdf

I think 'randomness' in any form is a flimsy term. I think 'random' as it relates to acausality, predictability, and deterministically (dependence on prior causes) must be defined more clearly. When one talks of randomness I think this can mean different things to different people.
 
SW VandeCarr said:
"True' randomness cannot be generated by any efficient algorithm (Kolmogorov) while pseudorandomness can be, such as the apparently random digit sequences of irrational numbers. The experimental realization of quantum states is taken to be an example of 'true' randomness in nature. However, if there is a deterministic substratum to such outcomes, then there apparently would be no 'true' randomness' in nature.

The following paper claims experimental evidence for 'true' randomness in quantum outcomes in the Kolmogorov sense. While the authors concede they cannot 'prove' true randomness, would this evidence carry weight to those who hold that an underlying deterministic substratum must exist?

http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.1521v1.pdf

Please note that in forums other than high energy physics and BTSM, we still require peer-reviewed references as valid sources. Unless you have the exact citation, you should wait until it has been published to make references to it.

Furthermore, they will have an interesting time addressing THIS:

https://www.physicsforums.com/showpost.php?p=2673066&postcount=106

Zz.
 
Descartz2000 said:
I think 'randomness' in any form is a flimsy term.

I'm surprised you would say that in the Quantum Physics forum since QM is grounded in probability theory. In any case, I specified Kolmogorov randomness which is the accepted definition in the computationally based sciences. It is true that a finite character string cannot be definitively said to be 'truly' random. It is a mathematical property of an infinite character string which, if truly random, must contain every possible finite substring (or subsequence). So for example, the decimal expansion of pi is indistinguishable statistically from a random string up to some finite n, but we cannot say it is a random string since it is generated by an efficient algorithm and we only have finite examples.
 


ZapperZ said:
S. Pironio et al., "Random numbers certified by Bell’s theorem", Nature v.464, p.1021 (2010).

Abstract: Randomness is a fundamental feature of nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize mathematically, and their generation must rely on an unpredictable physical process. Inaccuracies in the theoretical modelling of such processes or failures of the devices, possibly due to adversarial attacks, limit the reliability of random number generators in ways that are difficult to control and detect. Here, inspired by earlier work on non-locality-based and device-independent quantum information processing, we show that the non-local correlations of entangled quantum particles can be used to certify the presence of genuine randomness. It is thereby possible to design a cryptographically secure random number generator that does not require any assumption about the internal working of the device. Such a strong form of randomness generation is impossible classically and possible in quantum systems only if certified by a Bell inequality violation15. We carry out a proof-of-concept demonstration of this proposal in a system of two entangled atoms separated by approximately one metre. The observed Bell inequality violation, featuring near perfect detection efficiency, guarantees that 42 new random numbers are generated with 99 per cent confidence. Our results lay the groundwork for future device-independent quantum information experiments and for addressing fundamental issues raised by the intrinsic randomness of quantum theory.

Zz.

Thanks for this citation and abstract. Some forums allow arXiv papers. Sorry about linking it, but I'm not making any claims based on it. I do think it's an interesting read and reflects competence in terms of the computational issues. The PF members can decide how it might apply, if it all, to their particular interests.
 

Similar threads

  • · Replies 88 ·
3
Replies
88
Views
10K
  • · Replies 19 ·
Replies
19
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 58 ·
2
Replies
58
Views
5K
  • · Replies 5 ·
Replies
5
Views
542
  • · Replies 6 ·
Replies
6
Views
2K