5 ms·
Quantum mechanics provide truly random numbers on demand
- perching_aix 1y agoHow would we know ontic randomness when we see it? I can understand how we would epistemic randomness, but not ontic.
- kgwgk 1y agohttps://www.americanscientist.org/sites/americanscientist.org/files/20144141249210337-2014-05TechnologueFp170.jpg https://www.americanscientist.org/sites/americanscientist.or...
- abdullahkhalids 1y agoPhysicists have thought long and hard about this. This is very far outside my area, but here is a ten year old review paper that discusses some of these issues [1]. [1] https://arxiv.org/pdf/1409.1570 https://arxiv.org/pdf/1409.1570
- perching_aix 1y ago89 pages is intimidating, but I guess if this bothers me so much, I may as well dive in. Thanks, will take a peek in a bit.
- dr_dshiv 1y agoReport back please!
- perching_aix 1y agoMade it 2 pages in so far. As just a potential consumer of True (tm) Random (tm) Numbers (tm) [0] rather than a physicist, I'm still only vaguely sure this meta-review is actually assessing what I'm having a problem with. I'm also struggling with the language and layout a bit, but it's not too bad, and I do see that my phrasing above is incorrect (should have said ontic and epistemic). Not sure what kind of report are you hoping to hear though, sounded a bit like you're waiting for a laughter? [0] got a degree in compsci but I don't work in academia, or any industry fields where reading papers on the regular is a thing (AI, graphics, physics sim, etc.)
- mjburgess 1y agoOntic randomness, which may be better called physical indeterminism, is given as the best explanation for epistemic randomness for which no conditional variable exists (in the best theories of physics, etc.) to remove the epistemic randomness. So, for a given epistemic-random Y, "0 < P(Y) < 1" => Y is ontic-random iff there is no such X st. P(Y|X) = 1 or P(Y|-X) = 1 where dim(X) is abitarily large The existence of X is not epistemic, and is decided by the best interpretation of the best available science. Bell's theorem limits the conditions on `X` so that either (X does not exist) or (X is non-local). If you take the former branch then ontic-randomness falls out "for free" from highly specific cases of epistemic; if you take the latter, then there is no case in all of physics where one implies the other. Personally, I lean more towards saying there is no case of ontic randomness, only "ontic vagueness" or measurement-indeterminacy -- which gives rise to a necessary kind of epistemic randomness due to measurement. So that P(Y|X) = 1 if X were known, but X isn't in principle knowable. This is a bit of a hybrid position which allows you to have the benefits of both: reality isn't random, but it necessarily must appear so because P(X|measure(X)) is necessarily not 1. (However this does require X to be non-local still). This arises, imv, because I think there are computability constraints on the epistemic P(Y|X, measure(X)), ie., there has to be some f: X -> measure(X) which is computable -- but reality isn't computable. ie., functions of the form f : Nat -> Nat do not describe reality. This is not an issue for most macroscopic systems because they have part-whole reductions that make "effectively computable" descriptions fine. But in systems whether these part-whole reductions dont work, including QM, the non-computability of reality creates a necessary epistemic randomness to any possible description of it.
- whatshisface 1y agoThe word ontic makes it sound more esoteric than it is. In quantum mechanics, you could have a model that predicts everything you can practically know and calls the rest "random," or you could have a model with far more complexity and a lot of unusual internal mechanisms, that predicts everything you can practically know and explains the rest as not knowing the initial conditions. If you simulate quantum measurement on a computer, you're doing the latter - computers have nothing to do with nondeterminism, and would be choosing the results with a PRNG. "A PRNG decides everything between each step of the universal process," is an example of the kind of unusual internal mechanism that deterministic QM must have. In classical mechanics these are the same model. So what is presented as physical evidence for metaphysics is actually quantum mechanics splitting apart two ways of looking at randomness, which classically are equally complex and hard to tell apart (thinking of the future as a probability distribution vs. believing that the future is a definite point about which your knowledge is described by a probability distribution), but in quantum mechanics are not.
- btilly 1y agoIt isn't quantum, but as far as I know https://www.random.org/ https://www.random.org/ is sufficiently random for any purpose that I can think of for publicly verifiable random numbers. (Most of the demand for random numbers, of course, comes from cryptography. In which case public verifiability of what the random thing was is the last thing that you want.)
- zokier 1y agoNIST has operated public random beacon since at least 2013, and League of Entropy has operated distributed beacon from 2019. Public randomness does have uses in cryptography, crypto is not only secret keys.
- btilly 1y agoCan you illuminate what uses public randomness has in cryptography? If I think about it, I can come up with some. But they seem pretty niche relative to secret keys.
- dist-epoch 1y agoSome crypto algorithms need some random data in their construction. Typically "nothing up my sleeve" random numbers are used - digits of pi, sqrt(2), ...
- JKCalhoun 1y agoFor simple electronics circuits, reverse-biasing a transistor past its breakdown voltage will give you "noise" — an ADC will give you random values. I don't know how statistically random it is — suspect it is quantum in nature though since we're dealing with transistors. (EDIT: checked with ChatGPT, has a sense of humor: "Be careful not to exceed the maximum reverse voltage ratings, or you’ll get more “magic smoke” than white noise.")
- sandworm101 1y agoMost any sensor attached to a realworld physical system can produce sufficient randomness. Put a vibration sensor on my clothes dryer, plug the output into an md5 hash, and voila. Or setup a webcam aimed at a tree blowing in a breeze. Or pour out some m&ms onto a table and photograph that. We dont need to go quantum when sufficiently random systems like turbulance exist in the macro world.
- oneshtein 1y ago> "Mathematic model of quantum world" provide truly random numbers on demand
- m-watson 1y agoI'm not really sure if this is what you are getting at but it is using physical properties associated with QM to create the random numbers. Not just a mathematical model. "This is the first random number generator service to use quantum nonlocality as a source of its numbers, and the most transparent source of random numbers to date."
- ang_cire 1y ago> When researchers measure an individual particle, the outcome is random, but the properties of the pair are more correlated than classical physics allows, enabling researchers to verify the randomness. Is this not possibly just random-seeming to us, because we do not know or cannot measure all the variables? > The process starts by generating a pair of entangled photons inside a special nonlinear crystal. The photons travel via optical fiber to separate labs at opposite ends of the hall. > Once the photons reach the labs, their polarizations are measured. The outcomes of these measurements are truly random. I understand that obviously for our purposes (e.g. for encryption), this is safely random, but from a pure science perspective, have we actually proven that the waveform collapsing during measurement is "truly random"? How could we possibly assert that we've accounted for all variables that could be affecting this? There could be variables at play that we don't even know exist, when it comes to quantum mechanics, no? A coin toss is completely deterministic if you can account for wind, air resistance, momentum, starting state, mass, etc. But if you don't know that air resistance or wind exists, you could easily conclude it's random. I ask this as a layman, and I'm really interested if anyone has insight into this.
- 613style 1y agoBell's Theorem (1964) describes an inequality that should hold if quantum mechanics' randomness can be explained by certain types of hidden variables. In the time since, we've repeatedly observed that inequality violated in labs, leading most to presume that the normal types of hidden variables you would intuit don't exist. There are some esoteric loopholes that remain possibilities, but for now the position that matches our data the best is that there are not hidden variables and quantum mechanics is fundamentally probabilistic.
- ang_cire 1y agoSo to make sure I am understanding correctly, the normal distribution of the outcomes is itself evidence that other hidden factors aren't at play, because those factors would produces a less normal distribution? I.e. if coin toss results skew towards heads, you can conclude some factor is biasing it that way, therefore if the results are (over the course of many tests) 'even', you can conclude the absence of biasing factors?
- kazinator 1y agos/provide/provides/
- JKCalhoun 1y agoWrite an array of random values to a hard drive — terabytes of them. Dupe the drive. You now have a matching pair of "one-time pads" for, I have heard, the hardest form of encryption to decrypt. I would think expect there is a business already doing this.
- Someone 1y agoUsed properly, encryption using one time pads produces data streams that are indistinguishable from uniformly distributed random noise and cannot be cracked (https://en.wikipedia.org/wiki/One-time_pad https://en.wikipedia.org/wiki/One-time_pad)
- dist-epoch 1y agoIt's harder to ensure that no one messed with the drives during transport than to give a small private key to the other party.
- gblargg 1y agoYou also can't verify that the contents are genuinely random and not some re-creatable sequence by compromised generation hardware.
- cortesoft 1y agoThere aren't a ton of use cases for this that aren't met better by other cryptographic solutions.
- gregfjohnson 1y agoOne possible definition of "random" in this context: Is there any conceivable algorithm, perhaps one that models the entire universe in all of its particulars, that predicts the next string produced by the NIST quantum beacon?
- goatlover 1y agoDepends on the interpretation of QM. Many Worlds and Bohmian (Pilot Wave) are deterministic, but most interpretations are not. For MWI, you'd need your universal quantum computer to calculate all the branches/worlds. There's also Superdeterminism, which means you'd have to calculate everything from the big bang.
- nathan_compton 1y agoYes, but it has a variety of very unappealing physical properties. I mean for one thing, no one has all that information in the first place, but it would also be a theory were large scale correlations between outcomes would exist with space-like separations which would be weird, though clearly not impossible. T'Hooft's cellular automata approach has these properties and I guess its valid, although I don't know if it can be used to make non-trivial predictions.
- jmyeet 1y ago"Random" is a really interesting concept because it's intuitive yet hard to define. It's really a definition by exclusion, that is if you can't describe something in any way then it's random by default. But how do you know you just haven't found the way to define it yet? This is somewhat related to the idea of complexity. So if you have a sequence of "random" numbers, how do you know they're random? Take a look at a Mandelbrot Set and you wouldn't guess it's not that complex. I really like the idea of Kolomogorv complexity [1], which is to say that the complexity of an object (including a sequence of numbers) is defined by the shortest program that can produce that result. So a sequence of number generated by a PRNG isn't complex because an infinite sequence of such numbers can be reduced to the (finite) size of the program and initial seed. There are various random number generators that use quantum effects to create random numbers. One interesting implication of this is that it ends the debate about whether quantum effects can affect the "classical" or "macro" world. [1]: https://en.wikipedia.org/wiki/Kolmogorov_complexity https://en.wikipedia.org/wiki/Kolmogorov_complexity
- pharrington 1y agoThis is a press release for the University of Colorado's CURBy - CU Randomness Beacon @ https://random.colorado.edu/ https://random.colorado.edu/
- EastLondonCoder 1y agoMany years ago I used to work for a company in the gambling domain. There was a story going around from years before I joined that hardware TNRGs where used. And one day they failed. I can't remember precisely but heat was involved in one way or another and the failure mode they encountered was caused by overheating and repeatedly giving an endless series ones. A switch to PNRGs was promptly introduced.
- jasperry 1y agoThanks, this is a great story to illustrate why there's almost never any advantage to using a TRNG over a cryptographic-strength PRNG. That's also why Linux removed the blocking RNG from the kernel; there was no attack model where it gave more security. Of course, PRNGs should still be seeded with real entropy from the outside world, but even if that fails at some point, your PRNG will still be producing effectively unpredictable numbers for a long time.
- 7e 1y agoWith a PRNG the seed must be kept secret and non-reverse-engineerable. Isn't that a real disadvantage compared with a TRNG?
- jasperry 1y agoOnce a seed is fed to a PRNG, it can be deleted. But you still have a point, because the state of an OS PRNG can be saved and restored, for example when the machine sleeps, and a hacker could potentially access this to reproduce generated bits. But whenever the entropy pool is seeded with new entropy, any previous state values become useless.
- 7e 1y agoExactly, you need to protect the state of the PRNG and you need to ensure that the seed isn’t deterministic or easily reversed (time of day, 0, etc). That includes recovery from events and timing seen by the hypervisor. And some cloud VMs don’t have a non-deterministic entropy pool, or one safe from the hypervisor.
- lacoolj 1y ago"...is something that nothing in the universe can predict in advance" The universe is a swirling vortex of entropy. In theory, with enough data, you can predict anything, at any point in time. There is no such thing as "truly random"
- sideshowb 1y agoMy regular mechanic does that. "How much to get this car working again?" [sucks through teeth...]
- t_mann 1y agoFor a lot of eg security-related applications where you want random numbers you don't want them to be publicly known. I wonder whether there are any risks to a naive approach of turning those numbers into private random numbers, eg hashing them together with a secret? Should you rotate the secret? It would be interesting if the researchers could clarify this before people start rolling their own solutions.
- ingen0s 1y agoTsotchke
- moktonar 1y agoWe live in a simulation and the random values are produced outside of it. "God" doesn't play dice, he knows the seed, while on the other hand we don't, and for us that noise is "truly random".That's why we can't simulate our own universe perfectly and predict our own future. Maths can do almost everything, except producing truly random values. The true laws of nature are actually "encrypted", a mathematical model will never be able to describe them. Computational irreducibility to the next level. The perfect sandbox for AI. The only thing that the Universe has ever produced is life (AGI), the rest is just a meaningless swirling pile of particles. QM is just an optimization strategy that defers computation until needed: when interactions that need definition of observables happen. GR is also an optimization strategy, it is just Adaptive Mesh Refinement on steroids, but grid cells are not divided, they are moved where more resolution is needed (where the energy is) and also the integration dt is adjusted based on the same metric.
- mathattack 1y agoAs an undergrad I had an argument with my Theory professor on if #s could ever be truly random. I believed they couldn't, they could just be #s we don't know in advance, but that everything was actually predetermined. His response, "If needed, we could get them at a quantum level." I didn't have the Physics knowledge at the time to realize he was right.
- vayup 1y agoQuantum random source is a solution looking for a problem. Today the industry widely uses hardware random number generators whose entropy source comes from physical phenomena. Yes, it has its own problems. But having an entropy source with insufficient entropy is not one of them.
- heroku 1y ago> once you publish a random number it is no longer random