American researchers have for the first time experimentally proven the existence of quantum randomness. Using the 56-qubit quantum computer Quantinuum and a protocol by Professor Scott Aaronson, they certified more than 71,000 bits of “pure” entropy—completely unpredictable and non-forgeable numbers.
The main advantage of quantum randomness is that it does not depend on initial conditions and cannot be imitated. Even with access to a quantum computer, the outcome cannot be predicted. This is the first time a quantum computer has solved a task unavailable to classical systems, and the result can be verified independently.
This may seem far from everyday life, but it matters more than ever now. Modern protection of banking transactions, confidentiality in messengers, online raffles and voting, the accuracy of scientific research, and the security of devices all rely on random numbers. If those numbers can be guessed, they can also be hacked.
Certified quantum randomness makes encryption truly reliable. It is a real tool capable of changing how we protect personal data.
