Application of true randomness

Click For Summary

Discussion Overview

The discussion centers around the concept of true randomness, particularly in the context of quantum mechanics (QM) and its potential applications in technology. Participants explore the limitations of current computer-generated randomness and the possibility of utilizing quantum randomness to achieve true unpredictability.

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification

Main Points Raised

  • One participant asserts that current computers can only simulate pseudo-randomness through complex functions that can be predicted if the underlying mechanism is known.
  • Another participant suggests researching "quantum random number generator" as a potential solution to the problem of achieving true randomness.
  • A participant expresses gratitude for the suggestion and acknowledges difficulty in finding relevant information through general searches.
  • One participant shares their experience with searching for information online, emphasizing the importance of effective search queries in learning.
  • A technical explanation is provided regarding how computers generate pseudo-random sequences from a seed, noting that while the output appears random, it is ultimately deterministic and predictable if the seed is known.
  • The same participant speculates on the operation of quantum random generators, questioning whether they rely solely on quantum randomness or if they still produce pseudo-randomness by generating a seed from quantum sources.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the effectiveness of quantum randomness in achieving true unpredictability, and multiple viewpoints regarding the nature of randomness in computing are presented.

Contextual Notes

The discussion highlights the distinction between pseudo-randomness and true randomness, but does not resolve the implications of using quantum mechanics in randomness generation. There are also unresolved questions about the functioning of quantum random generators.

Xori
Messages
46
Reaction score
0
My understanding is that today's computers aren't able to simulate true randomness, only complex functions that appear random but can be predicted if someone knows how they work.

Is there any way to incorporate the "true" randomness of QM into technology to achieve true unpredictable randomness?
 
Physics news on Phys.org
It would be better if you first googled "quantum random number generator" (and at least read, for example, the wikipedia hit), and then afterward asked any further questions you might have here.
 
Last edited:
I guess that phrase is what I was looking for. Googling "random" was kind of fuitile :( Thanks
 
I must say that the skill I gained most at college was learning what to type in the google search box. That has helped me more than anything I learned (especially since a lot of what I learned was from what I searched on google...).

Then there's also blackle.com and cantfindongoogle.com. Endless hours of searching enjoyment.

As for the topic, I'd like to explain a bit about computer randomness. The basic idea is that the computer takes some seed (some sequence of 1s and 0s) and performs some operation on it. The output is the pseudo-random sequence of 1s and 0s (easily converted to a pseudo-random number or numbers or words, etc). It's not techniquely random because the operation is a deterministic process -- give it the same seed again, and it will output the same pseudo-random sequence again. Even if the source for the seed is or seems random, the operation treats it the same as a non-random seed.

However, it is practically random. That is, given the sequence up to a certain point, there's no way to predict the next number in the sequence without knowledge of the seed and operation. If the output is long enough, it's around 50/50 1s and 0s. Each number seems independent of all the others.

There are also variations on this theme, but they're not really important for discussing how random a deterministic algorithm could be. I admit that I don't yet know how a quantum random generator would work (I have to use google after this post...), but if it used the quantum randomness alone, then it would be random. If it only used the quantum randomness to generate a seed, then we'd be just as pseudo-random as we are now.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
8K
  • · Replies 88 ·
3
Replies
88
Views
10K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
4K