Real-World Uses of Quantum Random Number Generators

Is this the first real-world use case for quantum computers? True randomness is hard to come by. And in a world where cryptography and fairness rely on it, “close enough” just doesn’t cut it. A new paper in Nature claims to present a demonstrated, certified application of quantum computing, not in theory or simulation, but in the real world. Led by Quantinuum, JPMorganChase, Argonne National Laboratory, Oak Ridge National Laboratory, and The University of Texas at Austin, the team successfully ran a certified randomness expansion protocol on Quantinuum’s 56-qubit H2 quantum computer, and validated the results using over 1.1 exaflops of classical computing power. TL;DR is certified randomness--the kind of true, verifiable unpredictability that’s essential to cryptography and security--was generated by a quantum computer and validated by the world’s fastest supercomputers. Here’s why that matters: True randomness is anything but trivial. Classical systems can simulate randomness, but they’re still deterministic at the core. And for high-stakes environments such as finance, national security, or fairness in elections, you don’t want pseudo-anything. You want cold, hard entropy that no adversary can predict or reproduce. Quantum mechanics is probabilistic by nature. But just generating randomness with a quantum system isn’t enough; you need to certify that it’s truly random and not spoofed. That’s where this experiment comes in. Using a method called random circuit sampling, the team: ⚇ sent quantum circuits to Quantinuum’s 56-qubit H2 processor, ⚇ had it return outputs fast enough to make classical simulation infeasible, ⚇ verified the randomness mathematically using the Frontier supercomputer ⚇ while the quantum device accessed remotely, proving a future where secure, certifiable entropy doesn’t require trusting the hardware in front of you The result? Over 71,000 certifiably random bits generated in a way that proves they couldn’t have come from a classical machine. And it’s commercially viable. Certified randomness may sound niche—but it’s highly relevant to modern cryptography. This could be the start of the earliest true “quantum advantage” that actually matters in practice. And later this year, Quantinuum plans to make it a product. It’s a shift— from demos to deployment from supremacy claims to measurable utility from the theoretical to the trustworthy read more from Matt Swayne at The Quantum Insider here --> https://lnkd.in/gdkGMVRb peer-reviewed paper --> https://lnkd.in/g96FK7ip #QuantumComputing #CertifiedRandomness #Cryptography

NIST Releases Quantum Random Number Generator to the Public CURBy harnesses quantum entanglement to offer unprecedented randomness—now freely available for global use. ⸻ Quantum Mechanics Powers a New Era of Randomness The National Institute of Standards and Technology (NIST), in collaboration with the University of Colorado Boulder, has unveiled a breakthrough in secure computing: a publicly accessible quantum random number generator (QRNG). Known as CURBy (Colorado University Randomness Beacon), the system generates numbers using the inherent unpredictability of quantum physics—offering a new level of trust and transparency for everything from cryptography to public policy decisions. ⸻ What Makes CURBy Unique • Rooted in Quantum Science • CURBy is based on the Bell test, a fundamental quantum experiment used to prove entanglement—the mysterious linkage between quantum particles. • Unlike algorithmic or pseudo-random generators, CURBy’s outputs are inherently unpredictable and irreproducible, a hallmark of quantum behavior. • Verified and Proven • NIST’s original Bell test in 2015 was a landmark experiment confirming quantum entanglement. • In 2018, the team demonstrated that true randomness could be extracted from these experiments for practical use. • A New Kind of Randomness Beacon • CURBy operates as a randomness beacon, regularly publishing fresh quantum-generated numbers for open use. • Applications include: • Cryptography (e.g., encryption keys) • Statistical sampling (e.g., clinical trials, tax audits) • Public accountability (e.g., redistricting, jury selection) • Open and Free • As of June 2025, CURBy is free and publicly available, allowing anyone—from researchers to developers—to access quantum-certified randomness. ⸻ Why It Matters: Trustworthy Randomness for a Digital World Random numbers are central to data security, simulations, and fairness in governance—but conventional methods often rely on deterministic algorithms prone to bias or manipulation. CURBy offers a physics-backed, tamper-proof source of randomness that could redefine digital trust. As quantum computing rises, so too must our cryptographic foundations—and CURBy represents a key building block in preparing for that future. Keith King https://lnkd.in/gHPvUttw

Two days ago, we were proud to see the Nature Magazine publish our article on Certified Quantum Randomness, a task we demonstrated on the Quantinuum H2 trapped-ion #quantum computer, unattainable on any classical supercomputer. Unlike the randomness sources accessible on today's classical computers, the output of our #quantumcomputing-based protocol can be certified to be random under certain computational-hardness assumptions, with no trust required in the hardware generating the randomness. We are humbled by the enthusiastic response we received from the scientific community and industry. To better explain of the usefulness of Certified Quantum Randomness in the industry, we wrote a companion perspective paper, entitled "Applications of Certified Randomness," now available as an arXiv preprint at the following URL: https://lnkd.in/eCX7vDXP In this perspective, we explore real-world applications for which the use of certified randomness protocols may lead to improved security and fairness. We identify promising applications in areas including #cryptography, differential #privacy, financial markets, and #blockchain. Through this initial exploration, we hope to shed light on potential applications of certified randomness.