True Randomness

Random Circuit Sampling:
This technique involves sending randomly generated quantum circuits to a quantum processor and collecting its output. It reflects the idea of sampling, which means selecting a subset of outputs to study a larger phenomenon. In the article, this method was used to produce results that classical computers cannot replicate, highlighting the unpredictability of quantum systems.

Certified Randomness:
This refers to a formally validated result that meets strict criteria. It connects to the concept of certification, meaning researchers needed to prove that the generated number was truly random. In the article, the randomness was certified by showing that no classical method, including supercomputers, could reproduce the result.



People often describe unexpected things as “random,” like flipping a coin or picking a number. Scientists, however, particularly physicists and computer scientists, define randomness as something more profound and something that is not predictable or controllable by any rule or pattern. Most things that seem random are actually generated by algorithms or physical processes that follow rules. Because of this, creating a number that’s truly random, without any hidden structure, has been a long-standing challenge for scientists.

To solve this, researchers used a technique called random circuit sampling with a quantum computer. In simple terms, they created a series of random quantum operations, like instructions, and sent them to the quantum processor. That processor followed the instructions and gave back results. Because quantum particles behave unpredictably, the results are more random than anything a regular computer can generate. Think of it like shuffling a deck of cards millions of times in a way that’s impossible to trace, and then letting quantum weirdness decide which card to draw.

To prove the number was truly random, the team ran a test called certified randomness. They asked a classical supercomputer to try and guess or reproduce the results, but even the fastest supercomputer couldn’t do it; it simply couldn’t keep up or predict the outcome. That failure was key. If no existing classical machine can replicate the results, the output must be unpredictably random. It’s like giving a puzzle to the smartest solver alive, and even they can’t figure out the pattern.

This achievement is important because certified randomness can improve the fairness and security of real-world systems. For example, it could make encryption more secure by removing any chance of prediction. It might also help make decisions like jury selection completely unbiased. Beyond that, it shows that quantum computers can solve problems classical machines can’t, which is a big step forward for technology and science. By producing randomness we can trust, we unlock safer and fairer systems.