In a groundbreaking study published in Nature, a team of researchers from JPMorgan Chase, Quantinuum, Argonne National Laboratory, Oak Ridge National Laboratory, and The University of Texas at Austin has unveiled a major advancement in quantum computing—certified randomness. This achievement, realized using a 56-qubit quantum computer, opens new possibilities in various fields, including cryptography, fairness, and privacy. For the first time, the team demonstrated how a quantum computer can generate truly random numbers, validated by a classical supercomputer to confirm their freshness and authenticity. This milestone represents not just a theoretical breakthrough but also a practical application of quantum computers for tasks that classical systems could never achieve.
The Evolution of Quantum Computing: From Theory to Practicality
Quantum computing has long been celebrated for its immense computational potential. Unlike classical computers, which rely on bits that are either 0 or 1, quantum computers utilize quantum bits, or qubits, that can exist in multiple states simultaneously. This inherent parallelism enables quantum computers to perform calculations that are exponentially faster than classical systems. In recent years, companies like Google and teams from academic institutions have demonstrated “quantum supremacy,” where a quantum computer solves tasks impossible for classical computers to complete in a reasonable timeframe.
However, the shift from theoretical potential to practical applications has remained a challenge. Quantum supremacy was an impressive demonstration of quantum computers’ power, but it still lacked real-world utility—until now. The new research, led by experts like Scott Aaronson from The University of Texas at Austin, has made significant strides in applying quantum computing to tangible problems. The work described in the Nature paper illustrates how quantum computers can solve a real-world problem—certified randomness—that has direct applications in fields such as cryptography and data security.
What Is Certified Randomness and Why Does It Matter?
Randomness is a crucial resource in modern computing, particularly in cryptography, statistical sampling, and privacy-enhancing technologies. Traditional, classical computers struggle with generating truly random numbers. They often rely on pseudo-random number generators (PRNGs), which are algorithms that produce sequences of numbers that appear random but are ultimately deterministic and can be replicated if the algorithm’s state is known. This predictability becomes a problem in areas like cryptography, where the security of encryption methods depends on the randomness of the numbers used.
While PRNGs can suffice for many applications, they are vulnerable to manipulation. An adversary who gains control over the generator could predict or alter the random sequence, potentially compromising sensitive systems. For example, if an attacker can predict the randomness in a cryptographic algorithm, they could crack encryption codes and gain unauthorized access to secure data. Thus, the need for “true randomness” has grown as an essential aspect of cryptographic systems, privacy protocols, and even fairness in algorithms.
Quantum computers, by their very nature, can generate true randomness. The unpredictability of quantum processes, such as the spin of an electron or the polarization of a photon, ensures that the numbers generated from these systems are not deterministic and cannot be replicated—providing a level of randomness beyond what classical computers can achieve. However, until now, verifying that the randomness generated by a quantum computer is truly random and not the result of manipulation or malfunction has been a significant challenge.
This is where the concept of certified randomness comes in. Certified randomness involves not only generating random numbers but also proving, using classical computational techniques, that these numbers are indeed fresh, unpredictable, and untampered with. The experiment described in this study represents the first time such certified randomness has been achieved with a quantum computer.
Scott Aaronson’s Certified Randomness Protocol: A Vision Realized
The concept of certified randomness was initially proposed by Scott Aaronson, a renowned computer scientist at The University of Texas at Austin, in 2018. Aaronson’s original protocol aimed to leverage the unique properties of quantum mechanics to generate random numbers that could be certified as being genuinely random, even in the presence of potential adversaries or malicious actors. Aaronson’s vision, however, was always theoretical—until now.
Aaronson expressed his excitement about the experiment’s successful demonstration: “When I first proposed my certified randomness protocol in 2018, I had no idea how long I’d need to wait to see an experimental demonstration of it,” he remarked. “Building upon the original protocol and realizing it is a first step toward using quantum computers to generate certified random bits for actual cryptographic applications.”
This milestone demonstrates the practical applicability of quantum computers to real-world problems and validates Aaronson’s protocol as a useful tool for ensuring the integrity of random numbers in cryptographic applications.
Leveraging Random Circuit Sampling (RCS) for Certified Randomness
At the heart of the experiment lies a technique called random circuit sampling (RCS), which enables quantum computers to generate randomness. RCS involves designing quantum circuits that, when executed on a quantum computer, produce a distribution of possible outcomes. The quantum system, inherently probabilistic, “samples” from these outcomes, generating random bits. What sets this approach apart is the scale and complexity of the computations involved.
The team used the 56-qubit Quantinuum System Model H2, a trapped-ion quantum computer, to perform RCS. Unlike classical supercomputers, which struggle to solve complex problems that involve large, entangled quantum systems, quantum computers can quickly find solutions to these challenges. The team fed the quantum computer repeated challenges, each requiring it to solve a problem that was difficult, if not impossible, for even the world’s most advanced classical supercomputers. The quantum computer achieved this by selecting a random solution from multiple possibilities, thereby producing random outputs.
The second phase of the experiment involved certifying the randomness. This was done using classical supercomputers, which analyzed the quantum computer’s output to ensure it met the strict criteria for randomness. The process involved using classical methods to mathematically prove that the generated randomness could not have been mimicked by any known classical method. To perform this certification, the team leveraged some of the most powerful classical computing resources available, including leadership-scale supercomputers at Argonne National Laboratory and Oak Ridge National Laboratory. Their combined computational power—1.1 exaFLOPS (1.1 x 10^18 floating point operations per second)—was crucial in confirming the integrity of the quantum-generated randomness.
Through this dual approach, the team successfully certified 71,313 bits of entropy, demonstrating that the randomness was not only authentic but also fresh and untampered with.
Implications for Cryptography, Privacy, and Fairness
The implications of this breakthrough are profound, particularly in areas like cryptography, privacy, and fairness. In cryptographic systems, randomness is essential for generating encryption keys, digital signatures, and secure communication protocols. If the randomness is compromised, the entire security system can be undermined. With certified quantum randomness, cryptographic systems could achieve a new level of security, making it practically impossible for adversaries to predict or manipulate the random numbers used in encryption.
In addition to cryptography, certified randomness has applications in privacy-preserving technologies, such as anonymous communications and secure voting systems. By ensuring that random numbers used in privacy protocols are genuinely unpredictable, the risk of privacy breaches or manipulation of systems is significantly reduced. Furthermore, randomness plays a crucial role in ensuring fairness in algorithmic decision-making processes, such as random sampling for surveys, lotteries, or resource allocation. Certified randomness could ensure that such processes remain transparent, impartial, and free from manipulation.
Quantum Computing: From Research to Real-World Applications
The successful demonstration of certified randomness marks a turning point in quantum computing, proving that quantum technology can be harnessed for practical, real-world applications. As Marco Pistoia, Head of Global Technology Applied Research at JPMorgan Chase, noted, “This work marks a major milestone in quantum computing, demonstrating a solution to a real-world challenge using a quantum computer beyond the capabilities of classical supercomputers today.”
Dr. Rajeeb Hazra, President and CEO of Quantinuum, also underscored the importance of the achievement: “Today, we celebrate a pivotal milestone that brings quantum computing firmly into the realm of practical, real-world applications.” Hazra emphasized that the development of certified quantum randomness would not only enhance quantum security but also enable advanced simulations across various industries, such as finance, manufacturing, and beyond.
Conclusion: The Future of Certified Randomness and Quantum Security
This milestone in quantum computing opens a new frontier in the use of quantum technology for secure, fair, and privacy-respecting applications. Certified randomness could revolutionize fields that rely on random number generation, such as cryptography, statistical analysis, and fairness algorithms. As quantum computing technology continues to evolve, the potential for more complex and impactful applications grows exponentially.
The success of this experiment underscores the transformative potential of quantum computing, not just as a theoretical pursuit but as a technology poised to address some of the most pressing challenges in modern computing and security. As research continues and quantum systems become even more powerful, the promise of quantum computing in ensuring secure, private, and fair systems may soon be realized on an even larger scale.
Reference: Marco Pistoia, Certified randomness using a trapped-ion quantum processor, Nature (2025). DOI: 10.1038/s41586-025-08737-1. www.nature.com/articles/s41586-025-08737-1